17.95/11.11 MAYBE 17.95/11.11 17.95/11.11 Ultimate: Cannot open display: 17.95/11.11 This is Ultimate 0.1.24-8dc7c08-m 17.95/11.11 [2019-03-28 12:49:20,052 INFO L170 SettingsManager]: Resetting all preferences to default values... 17.95/11.11 [2019-03-28 12:49:20,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 17.95/11.11 [2019-03-28 12:49:20,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 17.95/11.11 [2019-03-28 12:49:20,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 17.95/11.11 [2019-03-28 12:49:20,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 17.95/11.11 [2019-03-28 12:49:20,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 17.95/11.11 [2019-03-28 12:49:20,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 17.95/11.11 [2019-03-28 12:49:20,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 17.95/11.11 [2019-03-28 12:49:20,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 17.95/11.11 [2019-03-28 12:49:20,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 17.95/11.11 [2019-03-28 12:49:20,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 17.95/11.11 [2019-03-28 12:49:20,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 17.95/11.11 [2019-03-28 12:49:20,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 17.95/11.11 [2019-03-28 12:49:20,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 17.95/11.11 [2019-03-28 12:49:20,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 17.95/11.11 [2019-03-28 12:49:20,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 17.95/11.11 [2019-03-28 12:49:20,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 17.95/11.11 [2019-03-28 12:49:20,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 17.95/11.11 [2019-03-28 12:49:20,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 17.95/11.11 [2019-03-28 12:49:20,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 17.95/11.11 [2019-03-28 12:49:20,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 17.95/11.11 [2019-03-28 12:49:20,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 17.95/11.11 [2019-03-28 12:49:20,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 17.95/11.11 [2019-03-28 12:49:20,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 17.95/11.11 [2019-03-28 12:49:20,092 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 17.95/11.11 [2019-03-28 12:49:20,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 17.95/11.11 [2019-03-28 12:49:20,093 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 17.95/11.11 [2019-03-28 12:49:20,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 17.95/11.11 [2019-03-28 12:49:20,094 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 17.95/11.11 [2019-03-28 12:49:20,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 17.95/11.11 [2019-03-28 12:49:20,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 17.95/11.11 [2019-03-28 12:49:20,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 17.95/11.11 [2019-03-28 12:49:20,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 17.95/11.11 [2019-03-28 12:49:20,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 17.95/11.11 [2019-03-28 12:49:20,097 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 17.95/11.11 [2019-03-28 12:49:20,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 17.95/11.11 [2019-03-28 12:49:20,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 17.95/11.11 [2019-03-28 12:49:20,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 17.95/11.11 [2019-03-28 12:49:20,099 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 17.95/11.11 [2019-03-28 12:49:20,115 INFO L110 SettingsManager]: Loading preferences was successful 17.95/11.11 [2019-03-28 12:49:20,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 17.95/11.11 [2019-03-28 12:49:20,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 17.95/11.11 [2019-03-28 12:49:20,117 INFO L133 SettingsManager]: * Rewrite not-equals=true 17.95/11.11 [2019-03-28 12:49:20,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 17.95/11.11 [2019-03-28 12:49:20,117 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 17.95/11.11 [2019-03-28 12:49:20,117 INFO L133 SettingsManager]: * Use SBE=true 17.95/11.11 [2019-03-28 12:49:20,117 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 17.95/11.11 [2019-03-28 12:49:20,118 INFO L133 SettingsManager]: * Use old map elimination=false 17.95/11.11 [2019-03-28 12:49:20,118 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 17.95/11.11 [2019-03-28 12:49:20,118 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 17.95/11.11 [2019-03-28 12:49:20,118 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 17.95/11.11 [2019-03-28 12:49:20,118 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 17.95/11.11 [2019-03-28 12:49:20,119 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 17.95/11.12 [2019-03-28 12:49:20,119 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.95/11.12 [2019-03-28 12:49:20,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 17.95/11.12 [2019-03-28 12:49:20,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 17.95/11.12 [2019-03-28 12:49:20,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE 17.95/11.12 [2019-03-28 12:49:20,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 17.95/11.12 [2019-03-28 12:49:20,120 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 17.95/11.12 [2019-03-28 12:49:20,120 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 17.95/11.12 [2019-03-28 12:49:20,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 17.95/11.12 [2019-03-28 12:49:20,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 17.95/11.12 [2019-03-28 12:49:20,120 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 17.95/11.12 [2019-03-28 12:49:20,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.95/11.12 [2019-03-28 12:49:20,121 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 17.95/11.12 [2019-03-28 12:49:20,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 17.95/11.12 [2019-03-28 12:49:20,121 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 17.95/11.12 [2019-03-28 12:49:20,121 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 17.95/11.12 [2019-03-28 12:49:20,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 17.95/11.12 [2019-03-28 12:49:20,220 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 17.95/11.12 [2019-03-28 12:49:20,223 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 17.95/11.12 [2019-03-28 12:49:20,225 INFO L271 PluginConnector]: Initializing CDTParser... 17.95/11.12 [2019-03-28 12:49:20,225 INFO L276 PluginConnector]: CDTParser initialized 17.95/11.12 [2019-03-28 12:49:20,226 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 17.95/11.12 [2019-03-28 12:49:20,356 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ac1eec6b4a714122a02fd04360c14d21/FLAG7a070b878 17.95/11.12 [2019-03-28 12:49:20,894 INFO L307 CDTParser]: Found 1 translation units. 17.95/11.12 [2019-03-28 12:49:20,894 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 17.95/11.12 [2019-03-28 12:49:20,895 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 17.95/11.12 [2019-03-28 12:49:20,901 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ac1eec6b4a714122a02fd04360c14d21/FLAG7a070b878 17.95/11.12 [2019-03-28 12:49:21,311 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ac1eec6b4a714122a02fd04360c14d21 17.95/11.12 [2019-03-28 12:49:21,322 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 17.95/11.12 [2019-03-28 12:49:21,324 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 17.95/11.12 [2019-03-28 12:49:21,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 17.95/11.12 [2019-03-28 12:49:21,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 17.95/11.12 [2019-03-28 12:49:21,329 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 17.95/11.12 [2019-03-28 12:49:21,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54dbf6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21, skipping insertion in model container 17.95/11.12 [2019-03-28 12:49:21,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 17.95/11.12 [2019-03-28 12:49:21,358 INFO L176 MainTranslator]: Built tables and reachable declarations 17.95/11.12 [2019-03-28 12:49:21,527 INFO L206 PostProcessor]: Analyzing one entry point: main 17.95/11.12 [2019-03-28 12:49:21,540 INFO L191 MainTranslator]: Completed pre-run 17.95/11.12 [2019-03-28 12:49:21,558 INFO L206 PostProcessor]: Analyzing one entry point: main 17.95/11.12 [2019-03-28 12:49:21,631 INFO L195 MainTranslator]: Completed translation 17.95/11.12 [2019-03-28 12:49:21,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21 WrapperNode 17.95/11.12 [2019-03-28 12:49:21,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 17.95/11.12 [2019-03-28 12:49:21,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 17.95/11.12 [2019-03-28 12:49:21,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 17.95/11.12 [2019-03-28 12:49:21,633 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 17.95/11.12 [2019-03-28 12:49:21,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 17.95/11.12 [2019-03-28 12:49:21,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 17.95/11.12 [2019-03-28 12:49:21,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 17.95/11.12 [2019-03-28 12:49:21,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized 17.95/11.12 [2019-03-28 12:49:21,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 [2019-03-28 12:49:21,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 17.95/11.12 [2019-03-28 12:49:21,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 17.95/11.12 [2019-03-28 12:49:21,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... 17.95/11.12 [2019-03-28 12:49:21,701 INFO L276 PluginConnector]: RCFGBuilder initialized 17.95/11.12 [2019-03-28 12:49:21,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (1/1) ... 17.95/11.12 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.95/11.12 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 17.95/11.12 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.95/11.12 [2019-03-28 12:49:21,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 17.95/11.12 [2019-03-28 12:49:21,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap 17.95/11.12 [2019-03-28 12:49:21,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 17.95/11.12 [2019-03-28 12:49:21,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 17.95/11.12 [2019-03-28 12:49:21,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 17.95/11.12 [2019-03-28 12:49:22,023 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 17.95/11.12 [2019-03-28 12:49:22,023 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. 17.95/11.12 [2019-03-28 12:49:22,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:49:22 BoogieIcfgContainer 17.95/11.12 [2019-03-28 12:49:22,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 17.95/11.12 [2019-03-28 12:49:22,025 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 17.95/11.12 [2019-03-28 12:49:22,026 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 17.95/11.12 [2019-03-28 12:49:22,028 INFO L276 PluginConnector]: BlockEncodingV2 initialized 17.95/11.12 [2019-03-28 12:49:22,028 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:49:22" (1/1) ... 17.95/11.12 [2019-03-28 12:49:22,045 INFO L313 BlockEncoder]: Initial Icfg 32 locations, 36 edges 17.95/11.12 [2019-03-28 12:49:22,046 INFO L258 BlockEncoder]: Using Remove infeasible edges 17.95/11.12 [2019-03-28 12:49:22,047 INFO L263 BlockEncoder]: Using Maximize final states 17.95/11.12 [2019-03-28 12:49:22,047 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 17.95/11.12 [2019-03-28 12:49:22,048 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 17.95/11.12 [2019-03-28 12:49:22,049 INFO L296 BlockEncoder]: Using Remove sink states 17.95/11.12 [2019-03-28 12:49:22,050 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 17.95/11.12 [2019-03-28 12:49:22,050 INFO L179 BlockEncoder]: Using Rewrite not-equals 17.95/11.12 [2019-03-28 12:49:22,073 INFO L185 BlockEncoder]: Using Use SBE 17.95/11.12 [2019-03-28 12:49:22,106 INFO L200 BlockEncoder]: SBE split 14 edges 17.95/11.12 [2019-03-28 12:49:22,114 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 17.95/11.12 [2019-03-28 12:49:22,116 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.95/11.12 [2019-03-28 12:49:22,150 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 17.95/11.12 [2019-03-28 12:49:22,153 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 17.95/11.12 [2019-03-28 12:49:22,154 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.95/11.12 [2019-03-28 12:49:22,155 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.95/11.12 [2019-03-28 12:49:22,155 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 17.95/11.12 [2019-03-28 12:49:22,156 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.95/11.12 [2019-03-28 12:49:22,156 INFO L313 BlockEncoder]: Encoded RCFG 24 locations, 51 edges 17.95/11.12 [2019-03-28 12:49:22,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:49:22 BasicIcfg 17.95/11.12 [2019-03-28 12:49:22,157 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 17.95/11.12 [2019-03-28 12:49:22,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 17.95/11.12 [2019-03-28 12:49:22,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... 17.95/11.12 [2019-03-28 12:49:22,161 INFO L276 PluginConnector]: TraceAbstraction initialized 17.95/11.12 [2019-03-28 12:49:22,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:49:21" (1/4) ... 17.95/11.12 [2019-03-28 12:49:22,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107ccd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:49:22, skipping insertion in model container 17.95/11.12 [2019-03-28 12:49:22,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:49:21" (2/4) ... 17.95/11.12 [2019-03-28 12:49:22,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107ccd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:49:22, skipping insertion in model container 17.95/11.12 [2019-03-28 12:49:22,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:49:22" (3/4) ... 17.95/11.12 [2019-03-28 12:49:22,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107ccd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:49:22, skipping insertion in model container 17.95/11.12 [2019-03-28 12:49:22,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:49:22" (4/4) ... 17.95/11.12 [2019-03-28 12:49:22,165 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.95/11.12 [2019-03-28 12:49:22,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 17.95/11.12 [2019-03-28 12:49:22,184 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. 17.95/11.12 [2019-03-28 12:49:22,201 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. 17.95/11.12 [2019-03-28 12:49:22,230 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.95/11.12 [2019-03-28 12:49:22,231 INFO L382 AbstractCegarLoop]: Interprodecural is true 17.95/11.12 [2019-03-28 12:49:22,231 INFO L383 AbstractCegarLoop]: Hoare is true 17.95/11.12 [2019-03-28 12:49:22,231 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 17.95/11.12 [2019-03-28 12:49:22,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 17.95/11.12 [2019-03-28 12:49:22,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.95/11.12 [2019-03-28 12:49:22,232 INFO L387 AbstractCegarLoop]: Difference is false 17.95/11.12 [2019-03-28 12:49:22,232 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 17.95/11.12 [2019-03-28 12:49:22,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 17.95/11.12 [2019-03-28 12:49:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. 17.95/11.12 [2019-03-28 12:49:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 17.95/11.12 [2019-03-28 12:49:22,253 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:22,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:22,254 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash 5488974, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:22,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:22,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:22,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:22,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.95/11.12 [2019-03-28 12:49:22,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 17.95/11.12 [2019-03-28 12:49:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.95/11.12 [2019-03-28 12:49:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:22,452 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. 17.95/11.12 [2019-03-28 12:49:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:22,572 INFO L93 Difference]: Finished difference Result 42 states and 92 transitions. 17.95/11.12 [2019-03-28 12:49:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:22,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 17.95/11.12 [2019-03-28 12:49:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:22,587 INFO L225 Difference]: With dead ends: 42 17.95/11.12 [2019-03-28 12:49:22,587 INFO L226 Difference]: Without dead ends: 23 17.95/11.12 [2019-03-28 12:49:22,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 17.95/11.12 [2019-03-28 12:49:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 17.95/11.12 [2019-03-28 12:49:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 17.95/11.12 [2019-03-28 12:49:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. 17.95/11.12 [2019-03-28 12:49:22,630 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 47 transitions. Word has length 4 17.95/11.12 [2019-03-28 12:49:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:22,631 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 47 transitions. 17.95/11.12 [2019-03-28 12:49:22,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 47 transitions. 17.95/11.12 [2019-03-28 12:49:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 17.95/11.12 [2019-03-28 12:49:22,631 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:22,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:22,632 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 5488976, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:22,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:22,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:22,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:22,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 17.95/11.12 [2019-03-28 12:49:22,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 17.95/11.12 [2019-03-28 12:49:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.95/11.12 [2019-03-28 12:49:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 17.95/11.12 [2019-03-28 12:49:22,683 INFO L87 Difference]: Start difference. First operand 23 states and 47 transitions. Second operand 4 states. 17.95/11.12 [2019-03-28 12:49:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:22,753 INFO L93 Difference]: Finished difference Result 24 states and 47 transitions. 17.95/11.12 [2019-03-28 12:49:22,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 17.95/11.12 [2019-03-28 12:49:22,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 17.95/11.12 [2019-03-28 12:49:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:22,755 INFO L225 Difference]: With dead ends: 24 17.95/11.12 [2019-03-28 12:49:22,755 INFO L226 Difference]: Without dead ends: 23 17.95/11.12 [2019-03-28 12:49:22,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 17.95/11.12 [2019-03-28 12:49:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 17.95/11.12 [2019-03-28 12:49:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 17.95/11.12 [2019-03-28 12:49:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 17.95/11.12 [2019-03-28 12:49:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 46 transitions. 17.95/11.12 [2019-03-28 12:49:22,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 46 transitions. Word has length 4 17.95/11.12 [2019-03-28 12:49:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:22,762 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 46 transitions. 17.95/11.12 [2019-03-28 12:49:22,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 17.95/11.12 [2019-03-28 12:49:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 46 transitions. 17.95/11.12 [2019-03-28 12:49:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 17.95/11.12 [2019-03-28 12:49:22,762 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:22,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:22,763 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:22,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash 5488977, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:22,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:22,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:22,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:22,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:22,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.95/11.12 [2019-03-28 12:49:22,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 17.95/11.12 [2019-03-28 12:49:22,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.95/11.12 [2019-03-28 12:49:22,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:22,814 INFO L87 Difference]: Start difference. First operand 23 states and 46 transitions. Second operand 3 states. 17.95/11.12 [2019-03-28 12:49:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:22,880 INFO L93 Difference]: Finished difference Result 23 states and 46 transitions. 17.95/11.12 [2019-03-28 12:49:22,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:22,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 17.95/11.12 [2019-03-28 12:49:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:22,881 INFO L225 Difference]: With dead ends: 23 17.95/11.12 [2019-03-28 12:49:22,881 INFO L226 Difference]: Without dead ends: 22 17.95/11.12 [2019-03-28 12:49:22,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 17.95/11.12 [2019-03-28 12:49:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 17.95/11.12 [2019-03-28 12:49:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 17.95/11.12 [2019-03-28 12:49:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 45 transitions. 17.95/11.12 [2019-03-28 12:49:22,887 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 45 transitions. Word has length 4 17.95/11.12 [2019-03-28 12:49:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:22,887 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 45 transitions. 17.95/11.12 [2019-03-28 12:49:22,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 45 transitions. 17.95/11.12 [2019-03-28 12:49:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 17.95/11.12 [2019-03-28 12:49:22,888 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:22,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:22,888 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 170159490, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:22,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:22,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:22,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:22,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.95/11.12 [2019-03-28 12:49:22,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 17.95/11.12 [2019-03-28 12:49:22,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.95/11.12 [2019-03-28 12:49:22,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:22,926 INFO L87 Difference]: Start difference. First operand 22 states and 45 transitions. Second operand 3 states. 17.95/11.12 [2019-03-28 12:49:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:23,000 INFO L93 Difference]: Finished difference Result 22 states and 45 transitions. 17.95/11.12 [2019-03-28 12:49:23,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:23,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 17.95/11.12 [2019-03-28 12:49:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:23,001 INFO L225 Difference]: With dead ends: 22 17.95/11.12 [2019-03-28 12:49:23,001 INFO L226 Difference]: Without dead ends: 19 17.95/11.12 [2019-03-28 12:49:23,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 17.95/11.12 [2019-03-28 12:49:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 17.95/11.12 [2019-03-28 12:49:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 17.95/11.12 [2019-03-28 12:49:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 39 transitions. 17.95/11.12 [2019-03-28 12:49:23,006 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 39 transitions. Word has length 5 17.95/11.12 [2019-03-28 12:49:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:23,006 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 39 transitions. 17.95/11.12 [2019-03-28 12:49:23,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 39 transitions. 17.95/11.12 [2019-03-28 12:49:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 17.95/11.12 [2019-03-28 12:49:23,007 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:23,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:23,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash 170159492, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:23,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:23,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:23,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:23,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 17.95/11.12 [2019-03-28 12:49:23,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 17.95/11.12 [2019-03-28 12:49:23,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.95/11.12 [2019-03-28 12:49:23,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 17.95/11.12 [2019-03-28 12:49:23,039 INFO L87 Difference]: Start difference. First operand 19 states and 39 transitions. Second operand 4 states. 17.95/11.12 [2019-03-28 12:49:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:23,147 INFO L93 Difference]: Finished difference Result 37 states and 72 transitions. 17.95/11.12 [2019-03-28 12:49:23,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 17.95/11.12 [2019-03-28 12:49:23,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 17.95/11.12 [2019-03-28 12:49:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:23,148 INFO L225 Difference]: With dead ends: 37 17.95/11.12 [2019-03-28 12:49:23,149 INFO L226 Difference]: Without dead ends: 34 17.95/11.12 [2019-03-28 12:49:23,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 17.95/11.12 [2019-03-28 12:49:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 17.95/11.12 [2019-03-28 12:49:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. 17.95/11.12 [2019-03-28 12:49:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 17.95/11.12 [2019-03-28 12:49:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. 17.95/11.12 [2019-03-28 12:49:23,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 5 17.95/11.12 [2019-03-28 12:49:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:23,156 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. 17.95/11.12 [2019-03-28 12:49:23,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 17.95/11.12 [2019-03-28 12:49:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. 17.95/11.12 [2019-03-28 12:49:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 17.95/11.12 [2019-03-28 12:49:23,157 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:23,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:23,157 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:23,158 INFO L82 PathProgramCache]: Analyzing trace with hash 170159493, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:23,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:23,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:23,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:23,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 17.95/11.12 [2019-03-28 12:49:23,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 17.95/11.12 [2019-03-28 12:49:23,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 17.95/11.12 [2019-03-28 12:49:23,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 17.95/11.12 [2019-03-28 12:49:23,227 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 5 states. 17.95/11.12 [2019-03-28 12:49:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:23,395 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. 17.95/11.12 [2019-03-28 12:49:23,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 17.95/11.12 [2019-03-28 12:49:23,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 17.95/11.12 [2019-03-28 12:49:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:23,397 INFO L225 Difference]: With dead ends: 34 17.95/11.12 [2019-03-28 12:49:23,397 INFO L226 Difference]: Without dead ends: 31 17.95/11.12 [2019-03-28 12:49:23,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 17.95/11.12 [2019-03-28 12:49:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 17.95/11.12 [2019-03-28 12:49:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. 17.95/11.12 [2019-03-28 12:49:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 17.95/11.12 [2019-03-28 12:49:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 58 transitions. 17.95/11.12 [2019-03-28 12:49:23,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 58 transitions. Word has length 5 17.95/11.12 [2019-03-28 12:49:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:23,404 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 58 transitions. 17.95/11.12 [2019-03-28 12:49:23,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 17.95/11.12 [2019-03-28 12:49:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 58 transitions. 17.95/11.12 [2019-03-28 12:49:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 17.95/11.12 [2019-03-28 12:49:23,404 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:23,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:23,405 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1576972878, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:23,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:23,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:23,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 17.95/11.12 [2019-03-28 12:49:23,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 17.95/11.12 [2019-03-28 12:49:23,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.95/11.12 [2019-03-28 12:49:23,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:23,435 INFO L87 Difference]: Start difference. First operand 26 states and 58 transitions. Second operand 3 states. 17.95/11.12 [2019-03-28 12:49:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:23,500 INFO L93 Difference]: Finished difference Result 47 states and 102 transitions. 17.95/11.12 [2019-03-28 12:49:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:23,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 17.95/11.12 [2019-03-28 12:49:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:23,502 INFO L225 Difference]: With dead ends: 47 17.95/11.12 [2019-03-28 12:49:23,502 INFO L226 Difference]: Without dead ends: 30 17.95/11.12 [2019-03-28 12:49:23,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 17.95/11.12 [2019-03-28 12:49:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. 17.95/11.12 [2019-03-28 12:49:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 17.95/11.12 [2019-03-28 12:49:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 61 transitions. 17.95/11.12 [2019-03-28 12:49:23,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 61 transitions. Word has length 9 17.95/11.12 [2019-03-28 12:49:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:23,508 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 61 transitions. 17.95/11.12 [2019-03-28 12:49:23,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 61 transitions. 17.95/11.12 [2019-03-28 12:49:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 17.95/11.12 [2019-03-28 12:49:23,509 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:23,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:23,510 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:23,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1576943087, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:23,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:23,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:23,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:23,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 17.95/11.12 [2019-03-28 12:49:23,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 17.95/11.12 [2019-03-28 12:49:23,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.95/11.12 [2019-03-28 12:49:23,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:23,539 INFO L87 Difference]: Start difference. First operand 29 states and 61 transitions. Second operand 3 states. 17.95/11.12 [2019-03-28 12:49:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:23,605 INFO L93 Difference]: Finished difference Result 50 states and 109 transitions. 17.95/11.12 [2019-03-28 12:49:23,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:23,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 17.95/11.12 [2019-03-28 12:49:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:23,607 INFO L225 Difference]: With dead ends: 50 17.95/11.12 [2019-03-28 12:49:23,607 INFO L226 Difference]: Without dead ends: 29 17.95/11.12 [2019-03-28 12:49:23,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.95/11.12 [2019-03-28 12:49:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 17.95/11.12 [2019-03-28 12:49:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 17.95/11.12 [2019-03-28 12:49:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 17.95/11.12 [2019-03-28 12:49:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 57 transitions. 17.95/11.12 [2019-03-28 12:49:23,612 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 57 transitions. Word has length 9 17.95/11.12 [2019-03-28 12:49:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:23,612 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 57 transitions. 17.95/11.12 [2019-03-28 12:49:23,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 17.95/11.12 [2019-03-28 12:49:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 57 transitions. 17.95/11.12 [2019-03-28 12:49:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 17.95/11.12 [2019-03-28 12:49:23,613 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:23,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:23,613 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:23,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash -654102284, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:23,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:23,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:23,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:23,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.95/11.12 [2019-03-28 12:49:23,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.95/11.12 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.95/11.12 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.95/11.12 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.95/11.12 [2019-03-28 12:49:23,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:23,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core 17.95/11.12 [2019-03-28 12:49:23,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.95/11.12 [2019-03-28 12:49:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:23,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:23,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 17.95/11.12 [2019-03-28 12:49:23,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 17.95/11.12 [2019-03-28 12:49:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 17.95/11.12 [2019-03-28 12:49:23,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 17.95/11.12 [2019-03-28 12:49:23,748 INFO L87 Difference]: Start difference. First operand 29 states and 57 transitions. Second operand 6 states. 17.95/11.12 [2019-03-28 12:49:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:23,900 INFO L93 Difference]: Finished difference Result 38 states and 66 transitions. 17.95/11.12 [2019-03-28 12:49:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 17.95/11.12 [2019-03-28 12:49:23,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 17.95/11.12 [2019-03-28 12:49:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:23,903 INFO L225 Difference]: With dead ends: 38 17.95/11.12 [2019-03-28 12:49:23,903 INFO L226 Difference]: Without dead ends: 35 17.95/11.12 [2019-03-28 12:49:23,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 17.95/11.12 [2019-03-28 12:49:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 17.95/11.12 [2019-03-28 12:49:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. 17.95/11.12 [2019-03-28 12:49:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 17.95/11.12 [2019-03-28 12:49:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. 17.95/11.12 [2019-03-28 12:49:23,909 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 11 17.95/11.12 [2019-03-28 12:49:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:23,910 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 54 transitions. 17.95/11.12 [2019-03-28 12:49:23,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 17.95/11.12 [2019-03-28 12:49:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 54 transitions. 17.95/11.12 [2019-03-28 12:49:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 17.95/11.12 [2019-03-28 12:49:23,911 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:23,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:23,912 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash -654102283, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:23,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:23,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:23,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:24,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.95/11.12 [2019-03-28 12:49:24,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.95/11.12 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.95/11.12 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.95/11.12 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.95/11.12 [2019-03-28 12:49:24,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.95/11.12 [2019-03-28 12:49:24,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core 17.95/11.12 [2019-03-28 12:49:24,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.95/11.12 [2019-03-28 12:49:24,115 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 17.95/11.12 [2019-03-28 12:49:24,115 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 17.95/11.12 [2019-03-28 12:49:24,126 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 17.95/11.12 [2019-03-28 12:49:24,127 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 17.95/11.12 [2019-03-28 12:49:24,127 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 17.95/11.12 [2019-03-28 12:49:24,180 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 17.95/11.12 [2019-03-28 12:49:24,181 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 17.95/11.12 [2019-03-28 12:49:24,185 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 17.95/11.12 [2019-03-28 12:49:24,200 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 17.95/11.12 [2019-03-28 12:49:24,206 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 17.95/11.12 [2019-03-28 12:49:24,206 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 17.95/11.12 [2019-03-28 12:49:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.95/11.12 [2019-03-28 12:49:24,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.95/11.12 [2019-03-28 12:49:24,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 17.95/11.12 [2019-03-28 12:49:24,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 17.95/11.12 [2019-03-28 12:49:24,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 17.95/11.12 [2019-03-28 12:49:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 17.95/11.12 [2019-03-28 12:49:24,286 INFO L87 Difference]: Start difference. First operand 29 states and 54 transitions. Second operand 11 states. 17.95/11.12 [2019-03-28 12:49:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.95/11.12 [2019-03-28 12:49:24,824 INFO L93 Difference]: Finished difference Result 50 states and 90 transitions. 17.95/11.12 [2019-03-28 12:49:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 17.95/11.12 [2019-03-28 12:49:24,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 17.95/11.12 [2019-03-28 12:49:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.95/11.12 [2019-03-28 12:49:24,826 INFO L225 Difference]: With dead ends: 50 17.95/11.12 [2019-03-28 12:49:24,826 INFO L226 Difference]: Without dead ends: 47 17.95/11.12 [2019-03-28 12:49:24,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 17.95/11.12 [2019-03-28 12:49:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 17.95/11.12 [2019-03-28 12:49:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. 17.95/11.12 [2019-03-28 12:49:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 17.95/11.12 [2019-03-28 12:49:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 51 transitions. 17.95/11.12 [2019-03-28 12:49:24,832 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 51 transitions. Word has length 11 17.95/11.12 [2019-03-28 12:49:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. 17.95/11.12 [2019-03-28 12:49:24,832 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 51 transitions. 17.95/11.12 [2019-03-28 12:49:24,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 17.95/11.12 [2019-03-28 12:49:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 51 transitions. 17.95/11.12 [2019-03-28 12:49:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 17.95/11.12 [2019-03-28 12:49:24,833 INFO L394 BasicCegarLoop]: Found error trace 17.95/11.12 [2019-03-28 12:49:24,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 17.95/11.12 [2019-03-28 12:49:24,833 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 17.95/11.12 [2019-03-28 12:49:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.95/11.12 [2019-03-28 12:49:24,834 INFO L82 PathProgramCache]: Analyzing trace with hash 357354030, now seen corresponding path program 1 times 17.95/11.12 [2019-03-28 12:49:24,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.95/11.12 [2019-03-28 12:49:24,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.95/11.12 [2019-03-28 12:49:24,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:24,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:24,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.95/11.12 [2019-03-28 12:49:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.95/11.12 [2019-03-28 12:49:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.95/11.12 [2019-03-28 12:49:24,877 INFO L469 BasicCegarLoop]: Counterexample might be feasible 17.95/11.12 [2019-03-28 12:49:24,908 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 17.95/11.12 [2019-03-28 12:49:24,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:49:24 BasicIcfg 17.95/11.12 [2019-03-28 12:49:24,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 17.95/11.12 [2019-03-28 12:49:24,912 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 17.95/11.12 [2019-03-28 12:49:24,912 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 17.95/11.12 [2019-03-28 12:49:24,915 INFO L276 PluginConnector]: BuchiAutomizer initialized 17.95/11.12 [2019-03-28 12:49:24,915 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 17.95/11.12 [2019-03-28 12:49:24,915 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 17.95/11.12 [2019-03-28 12:49:24,916 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 17.95/11.12 [2019-03-28 12:49:24,916 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 17.95/11.12 [2019-03-28 12:49:24,916 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 17.95/11.12 [2019-03-28 12:49:24,916 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 17.95/11.12 [2019-03-28 12:49:24,916 INFO L168 Benchmark]: Toolchain (without parser) took 3593.63 ms. Allocated memory was 645.4 MB in the beginning and 736.6 MB in the end (delta: 91.2 MB). Free memory was 561.3 MB in the beginning and 599.7 MB in the end (delta: -38.4 MB). Peak memory consumption was 52.8 MB. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,917 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 645.4 MB. Free memory is still 581.6 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.50 ms. Allocated memory was 645.4 MB in the beginning and 655.4 MB in the end (delta: 10.0 MB). Free memory was 560.0 MB in the beginning and 622.8 MB in the end (delta: -62.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.70 ms. Allocated memory is still 655.4 MB. Free memory was 622.8 MB in the beginning and 619.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,919 INFO L168 Benchmark]: Boogie Preprocessor took 25.00 ms. Allocated memory is still 655.4 MB. Free memory was 619.7 MB in the beginning and 617.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,920 INFO L168 Benchmark]: RCFGBuilder took 324.80 ms. Allocated memory is still 655.4 MB. Free memory was 617.1 MB in the beginning and 595.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,920 INFO L168 Benchmark]: BlockEncodingV2 took 131.53 ms. Allocated memory is still 655.4 MB. Free memory was 595.1 MB in the beginning and 585.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,921 INFO L168 Benchmark]: TraceAbstraction took 2753.34 ms. Allocated memory was 655.4 MB in the beginning and 736.6 MB in the end (delta: 81.3 MB). Free memory was 585.7 MB in the beginning and 599.7 MB in the end (delta: -14.0 MB). Peak memory consumption was 67.3 MB. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,921 INFO L168 Benchmark]: BuchiAutomizer took 4.22 ms. Allocated memory is still 736.6 MB. Free memory is still 599.7 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.95/11.12 [2019-03-28 12:49:24,925 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 17.95/11.12 --- Results --- 17.95/11.12 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 17.95/11.12 - StatisticsResult: Initial Icfg 17.95/11.12 32 locations, 36 edges 17.95/11.12 - StatisticsResult: Encoded RCFG 17.95/11.12 24 locations, 51 edges 17.95/11.12 * Results from de.uni_freiburg.informatik.ultimate.core: 17.95/11.12 - StatisticsResult: Toolchain Benchmarks 17.95/11.12 Benchmark results are: 17.95/11.12 * CDTParser took 0.17 ms. Allocated memory is still 645.4 MB. Free memory is still 581.6 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.95/11.12 * CACSL2BoogieTranslator took 307.50 ms. Allocated memory was 645.4 MB in the beginning and 655.4 MB in the end (delta: 10.0 MB). Free memory was 560.0 MB in the beginning and 622.8 MB in the end (delta: -62.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 17.95/11.12 * Boogie Procedure Inliner took 41.70 ms. Allocated memory is still 655.4 MB. Free memory was 622.8 MB in the beginning and 619.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 17.95/11.12 * Boogie Preprocessor took 25.00 ms. Allocated memory is still 655.4 MB. Free memory was 619.7 MB in the beginning and 617.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 17.95/11.12 * RCFGBuilder took 324.80 ms. Allocated memory is still 655.4 MB. Free memory was 617.1 MB in the beginning and 595.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. 17.95/11.12 * BlockEncodingV2 took 131.53 ms. Allocated memory is still 655.4 MB. Free memory was 595.1 MB in the beginning and 585.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 17.95/11.12 * TraceAbstraction took 2753.34 ms. Allocated memory was 655.4 MB in the beginning and 736.6 MB in the end (delta: 81.3 MB). Free memory was 585.7 MB in the beginning and 599.7 MB in the end (delta: -14.0 MB). Peak memory consumption was 67.3 MB. Max. memory is 50.3 GB. 17.95/11.12 * BuchiAutomizer took 4.22 ms. Allocated memory is still 736.6 MB. Free memory is still 599.7 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.95/11.12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 17.95/11.12 - CounterExampleResult [Line: 36]: pointer dereference may fail 17.95/11.12 pointer dereference may fail 17.95/11.12 We found a FailurePath: 17.95/11.12 [L12] int length = __VERIFIER_nondet_int(); 17.95/11.12 [L13] COND FALSE !(length < 1) 17.95/11.12 [L16] char* nondetString = (char*) malloc(length * sizeof(char)); 17.95/11.12 [L17] nondetString[length-1] = '\0' 17.95/11.12 [L18] return nondetString; 17.95/11.12 [L30] EXPR \read(*s) 17.95/11.12 [L30] *s != '\0' && *s != (char)c 17.95/11.12 [L30] COND FALSE !(*s != '\0' && *s != (char)c) 17.95/11.12 [L32] EXPR \read(*s) 17.95/11.12 [L32] EXPR (*s == c) ? (char *) s : 0 17.95/11.12 [L32] return ( (*s == c) ? (char *) s : 0 ); 17.95/11.12 17.95/11.12 - StatisticsResult: Ultimate Automizer benchmark data 17.95/11.12 CFG has 1 procedures, 24 locations, 10 error locations. UNSAFE Result, 2.6s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 85 SDtfs, 826 SDslu, 283 SDs, 0 SdLazy, 703 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 77 ConstructedInterpolants, 1 QuantifiedInterpolants, 2695 SizeOfPredicates, 12 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 17.95/11.12 RESULT: Ultimate proved your program to be incorrect! 17.95/11.12 !SESSION 2019-03-28 12:49:15.827 ----------------------------------------------- 17.95/11.12 eclipse.buildId=unknown 17.95/11.12 java.version=1.8.0_181 17.95/11.12 java.vendor=Oracle Corporation 17.95/11.12 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 17.95/11.12 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 17.95/11.12 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 17.95/11.12 17.95/11.12 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:49:25.156 17.95/11.12 !MESSAGE The workspace will exit with unsaved changes in this session. 17.95/11.12 Received shutdown request... 17.95/11.12 Ultimate: 17.95/11.12 GTK+ Version Check 17.95/11.12 EOF