./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56f043bec3037ec37b4a132611abd4a337934428 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:06:38,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:06:38,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:06:38,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:06:38,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:06:38,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:06:38,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:06:38,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:06:38,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:06:38,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:06:38,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:06:38,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:06:38,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:06:38,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:06:38,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:06:38,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:06:38,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:06:38,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:06:38,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:06:38,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:06:38,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:06:38,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:06:38,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:06:38,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:06:38,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:06:38,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:06:38,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:06:38,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:06:38,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:06:38,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:06:38,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:06:38,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:06:38,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:06:38,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:06:38,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:06:39,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:06:39,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:06:39,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:06:39,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:06:39,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:06:39,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:06:39,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:06:39,040 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:06:39,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:06:39,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:06:39,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:06:39,043 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:06:39,043 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:06:39,043 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:06:39,044 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:06:39,044 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:06:39,044 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:06:39,045 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:06:39,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:06:39,046 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:06:39,047 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:06:39,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:06:39,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:06:39,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:06:39,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:06:39,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:06:39,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:06:39,049 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:06:39,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:06:39,050 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:06:39,050 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:06:39,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:06:39,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:06:39,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:06:39,051 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:06:39,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:06:39,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:06:39,052 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:06:39,054 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:06:39,055 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-11-28 03:06:39,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:06:39,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:06:39,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:06:39,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:06:39,365 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:06:39,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2019-11-28 03:06:39,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e334b75/474f72549b78416fb267abd6834d7efe/FLAGf7c5b3366 [2019-11-28 03:06:39,923 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:06:39,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2019-11-28 03:06:39,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e334b75/474f72549b78416fb267abd6834d7efe/FLAGf7c5b3366 [2019-11-28 03:06:40,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e334b75/474f72549b78416fb267abd6834d7efe [2019-11-28 03:06:40,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:06:40,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:06:40,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:06:40,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:06:40,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:06:40,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1187dbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40, skipping insertion in model container [2019-11-28 03:06:40,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:06:40,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:06:40,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:06:40,622 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:06:40,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:06:40,736 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:06:40,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40 WrapperNode [2019-11-28 03:06:40,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:06:40,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:06:40,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:06:40,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:06:40,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:06:40,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:06:40,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:06:40,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:06:40,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... [2019-11-28 03:06:40,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:06:40,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:06:40,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:06:40,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:06:40,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:06:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:06:40,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:06:41,205 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:06:41,206 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 03:06:41,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:41 BoogieIcfgContainer [2019-11-28 03:06:41,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:06:41,208 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:06:41,209 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:06:41,216 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:06:41,218 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:41,218 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:06:40" (1/3) ... [2019-11-28 03:06:41,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70aac81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:06:41, skipping insertion in model container [2019-11-28 03:06:41,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:41,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:06:40" (2/3) ... [2019-11-28 03:06:41,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70aac81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:06:41, skipping insertion in model container [2019-11-28 03:06:41,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:06:41,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:41" (3/3) ... [2019-11-28 03:06:41,223 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2019-11-28 03:06:41,284 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:06:41,285 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:06:41,285 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:06:41,285 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:06:41,285 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:06:41,285 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:06:41,286 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:06:41,286 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:06:41,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2019-11-28 03:06:41,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 03:06:41,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:41,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:41,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:41,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:41,331 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:06:41,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2019-11-28 03:06:41,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 03:06:41,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:41,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:41,336 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:41,340 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:41,349 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 29#L167-1true [2019-11-28 03:06:41,350 INFO L796 eck$LassoCheckResult]: Loop: 29#L167-1true assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 38#L44true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 7#L71true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L71-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 35#L75-1true assume !(0 != main_~p3~0); 43#L79-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 31#L83-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 16#L87-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 3#L91-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 11#L95-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 40#L99-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 30#L103-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 14#L107-1true assume !(0 != main_~p11~0); 23#L111-1true assume !(0 != main_~p1~0); 12#L117-1true assume !(0 != main_~p2~0); 24#L122-1true assume !(0 != main_~p3~0); 33#L127-1true assume !(0 != main_~p4~0); 41#L132-1true assume !(0 != main_~p5~0); 9#L137-1true assume !(0 != main_~p6~0); 21#L142-1true assume !(0 != main_~p7~0); 32#L147-1true assume !(0 != main_~p8~0); 39#L152-1true assume !(0 != main_~p9~0); 6#L157-1true assume !(0 != main_~p10~0); 18#L162-1true assume !(0 != main_~p11~0); 29#L167-1true [2019-11-28 03:06:41,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:41,358 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 03:06:41,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:41,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373915843] [2019-11-28 03:06:41,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:41,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash -504227868, now seen corresponding path program 1 times [2019-11-28 03:06:41,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:41,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385098137] [2019-11-28 03:06:41,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:41,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385098137] [2019-11-28 03:06:41,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:41,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:41,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056132017] [2019-11-28 03:06:41,571 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:41,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:41,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:41,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:41,591 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-11-28 03:06:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:41,634 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2019-11-28 03:06:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:41,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 141 transitions. [2019-11-28 03:06:41,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-11-28 03:06:41,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 70 states and 112 transitions. [2019-11-28 03:06:41,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-11-28 03:06:41,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-11-28 03:06:41,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 112 transitions. [2019-11-28 03:06:41,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:41,653 INFO L688 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2019-11-28 03:06:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 112 transitions. [2019-11-28 03:06:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-28 03:06:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 03:06:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 112 transitions. [2019-11-28 03:06:41,696 INFO L711 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2019-11-28 03:06:41,696 INFO L591 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2019-11-28 03:06:41,697 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:06:41,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 112 transitions. [2019-11-28 03:06:41,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-11-28 03:06:41,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:41,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:41,701 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:41,701 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:41,702 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 172#L167-1 [2019-11-28 03:06:41,702 INFO L796 eck$LassoCheckResult]: Loop: 172#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 181#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 180#L71 assume !(0 != main_~p1~0); 132#L71-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 133#L75-1 assume !(0 != main_~p3~0); 170#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 167#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 156#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 130#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 131#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 173#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 174#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 153#L107-1 assume !(0 != main_~p11~0); 154#L111-1 assume !(0 != main_~p1~0); 148#L117-1 assume !(0 != main_~p2~0); 149#L122-1 assume !(0 != main_~p3~0); 160#L127-1 assume !(0 != main_~p4~0); 135#L132-1 assume !(0 != main_~p5~0); 141#L137-1 assume !(0 != main_~p6~0); 142#L142-1 assume !(0 != main_~p7~0); 152#L147-1 assume !(0 != main_~p8~0); 163#L152-1 assume !(0 != main_~p9~0); 169#L157-1 assume !(0 != main_~p10~0); 183#L162-1 assume !(0 != main_~p11~0); 172#L167-1 [2019-11-28 03:06:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 03:06:41,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:41,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305660917] [2019-11-28 03:06:41,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:41,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash -285373150, now seen corresponding path program 1 times [2019-11-28 03:06:41,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:41,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566550615] [2019-11-28 03:06:41,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:41,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566550615] [2019-11-28 03:06:41,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:41,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:41,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675946457] [2019-11-28 03:06:41,799 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:41,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:41,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:41,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:41,801 INFO L87 Difference]: Start difference. First operand 70 states and 112 transitions. cyclomatic complexity: 44 Second operand 3 states. [2019-11-28 03:06:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:41,835 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2019-11-28 03:06:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:41,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 217 transitions. [2019-11-28 03:06:41,841 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2019-11-28 03:06:41,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 217 transitions. [2019-11-28 03:06:41,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-11-28 03:06:41,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-11-28 03:06:41,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 217 transitions. [2019-11-28 03:06:41,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:41,853 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2019-11-28 03:06:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 217 transitions. [2019-11-28 03:06:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-28 03:06:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-28 03:06:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2019-11-28 03:06:41,869 INFO L711 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2019-11-28 03:06:41,869 INFO L591 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2019-11-28 03:06:41,869 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:06:41,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 217 transitions. [2019-11-28 03:06:41,875 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2019-11-28 03:06:41,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:41,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:41,880 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:41,880 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:41,880 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 384#L167-1 [2019-11-28 03:06:41,881 INFO L796 eck$LassoCheckResult]: Loop: 384#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 392#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 389#L71 assume !(0 != main_~p1~0); 390#L71-2 assume !(0 != main_~p2~0); 449#L75-1 assume !(0 != main_~p3~0); 447#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 445#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 443#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 441#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 439#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 437#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 435#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 434#L107-1 assume !(0 != main_~p11~0); 433#L111-1 assume !(0 != main_~p1~0); 430#L117-1 assume !(0 != main_~p2~0); 426#L122-1 assume !(0 != main_~p3~0); 423#L127-1 assume !(0 != main_~p4~0); 419#L132-1 assume !(0 != main_~p5~0); 415#L137-1 assume !(0 != main_~p6~0); 411#L142-1 assume !(0 != main_~p7~0); 407#L147-1 assume !(0 != main_~p8~0); 403#L152-1 assume !(0 != main_~p9~0); 399#L157-1 assume !(0 != main_~p10~0); 397#L162-1 assume !(0 != main_~p11~0); 384#L167-1 [2019-11-28 03:06:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 03:06:41,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:41,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757768666] [2019-11-28 03:06:41,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:41,896 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash 137328676, now seen corresponding path program 1 times [2019-11-28 03:06:41,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:41,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755162201] [2019-11-28 03:06:41,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:41,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755162201] [2019-11-28 03:06:41,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:41,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:41,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61027962] [2019-11-28 03:06:41,941 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:41,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:41,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:41,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:41,942 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-11-28 03:06:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:41,974 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2019-11-28 03:06:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:41,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 421 transitions. [2019-11-28 03:06:41,979 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2019-11-28 03:06:41,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 269 states and 421 transitions. [2019-11-28 03:06:41,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 [2019-11-28 03:06:41,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-11-28 03:06:41,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 421 transitions. [2019-11-28 03:06:41,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:41,986 INFO L688 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2019-11-28 03:06:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 421 transitions. [2019-11-28 03:06:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-11-28 03:06:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-28 03:06:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 421 transitions. [2019-11-28 03:06:42,006 INFO L711 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2019-11-28 03:06:42,006 INFO L591 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2019-11-28 03:06:42,006 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:06:42,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 421 transitions. [2019-11-28 03:06:42,009 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2019-11-28 03:06:42,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:42,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:42,010 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:42,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:42,010 INFO L794 eck$LassoCheckResult]: Stem: 802#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 803#L167-1 [2019-11-28 03:06:42,011 INFO L796 eck$LassoCheckResult]: Loop: 803#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 817#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 818#L71 assume !(0 != main_~p1~0); 898#L71-2 assume !(0 != main_~p2~0); 896#L75-1 assume !(0 != main_~p3~0); 894#L79-1 assume !(0 != main_~p4~0); 892#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 890#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 888#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 886#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 884#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 882#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 880#L107-1 assume !(0 != main_~p11~0); 876#L111-1 assume !(0 != main_~p1~0); 872#L117-1 assume !(0 != main_~p2~0); 868#L122-1 assume !(0 != main_~p3~0); 866#L127-1 assume !(0 != main_~p4~0); 860#L132-1 assume !(0 != main_~p5~0); 859#L137-1 assume !(0 != main_~p6~0); 848#L142-1 assume !(0 != main_~p7~0); 847#L147-1 assume !(0 != main_~p8~0); 836#L152-1 assume !(0 != main_~p9~0); 835#L157-1 assume !(0 != main_~p10~0); 827#L162-1 assume !(0 != main_~p11~0); 803#L167-1 [2019-11-28 03:06:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 03:06:42,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58196063] [2019-11-28 03:06:42,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,025 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1551615066, now seen corresponding path program 1 times [2019-11-28 03:06:42,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914072438] [2019-11-28 03:06:42,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:42,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914072438] [2019-11-28 03:06:42,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:42,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:42,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415877538] [2019-11-28 03:06:42,061 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:42,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:42,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:42,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:42,062 INFO L87 Difference]: Start difference. First operand 269 states and 421 transitions. cyclomatic complexity: 160 Second operand 3 states. [2019-11-28 03:06:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:42,091 INFO L93 Difference]: Finished difference Result 529 states and 817 transitions. [2019-11-28 03:06:42,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:42,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 817 transitions. [2019-11-28 03:06:42,097 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2019-11-28 03:06:42,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 529 states and 817 transitions. [2019-11-28 03:06:42,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2019-11-28 03:06:42,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2019-11-28 03:06:42,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 817 transitions. [2019-11-28 03:06:42,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:42,107 INFO L688 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2019-11-28 03:06:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 817 transitions. [2019-11-28 03:06:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-11-28 03:06:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-11-28 03:06:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 817 transitions. [2019-11-28 03:06:42,134 INFO L711 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2019-11-28 03:06:42,135 INFO L591 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2019-11-28 03:06:42,135 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:06:42,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 529 states and 817 transitions. [2019-11-28 03:06:42,139 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2019-11-28 03:06:42,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:42,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:42,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:42,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:42,141 INFO L794 eck$LassoCheckResult]: Stem: 1603#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 1604#L167-1 [2019-11-28 03:06:42,141 INFO L796 eck$LassoCheckResult]: Loop: 1604#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 1704#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 1700#L71 assume !(0 != main_~p1~0); 1696#L71-2 assume !(0 != main_~p2~0); 1694#L75-1 assume !(0 != main_~p3~0); 1692#L79-1 assume !(0 != main_~p4~0); 1688#L83-1 assume !(0 != main_~p5~0); 1686#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1684#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1682#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1680#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1678#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1676#L107-1 assume !(0 != main_~p11~0); 1672#L111-1 assume !(0 != main_~p1~0); 1668#L117-1 assume !(0 != main_~p2~0); 1664#L122-1 assume !(0 != main_~p3~0); 1661#L127-1 assume !(0 != main_~p4~0); 1662#L132-1 assume !(0 != main_~p5~0); 1728#L137-1 assume !(0 != main_~p6~0); 1724#L142-1 assume !(0 != main_~p7~0); 1720#L147-1 assume !(0 != main_~p8~0); 1716#L152-1 assume !(0 != main_~p9~0); 1712#L157-1 assume !(0 != main_~p10~0); 1708#L162-1 assume !(0 != main_~p11~0); 1604#L167-1 [2019-11-28 03:06:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 03:06:42,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833884189] [2019-11-28 03:06:42,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,155 INFO L82 PathProgramCache]: Analyzing trace with hash 749207524, now seen corresponding path program 1 times [2019-11-28 03:06:42,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996176699] [2019-11-28 03:06:42,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:42,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996176699] [2019-11-28 03:06:42,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:42,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:42,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551549075] [2019-11-28 03:06:42,189 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:42,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:42,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:42,191 INFO L87 Difference]: Start difference. First operand 529 states and 817 transitions. cyclomatic complexity: 304 Second operand 3 states. [2019-11-28 03:06:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:42,214 INFO L93 Difference]: Finished difference Result 1041 states and 1585 transitions. [2019-11-28 03:06:42,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:42,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1041 states and 1585 transitions. [2019-11-28 03:06:42,225 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2019-11-28 03:06:42,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1041 states to 1041 states and 1585 transitions. [2019-11-28 03:06:42,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1041 [2019-11-28 03:06:42,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1041 [2019-11-28 03:06:42,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1041 states and 1585 transitions. [2019-11-28 03:06:42,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:42,239 INFO L688 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2019-11-28 03:06:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states and 1585 transitions. [2019-11-28 03:06:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2019-11-28 03:06:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-11-28 03:06:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1585 transitions. [2019-11-28 03:06:42,269 INFO L711 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2019-11-28 03:06:42,269 INFO L591 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2019-11-28 03:06:42,269 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:06:42,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1041 states and 1585 transitions. [2019-11-28 03:06:42,277 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2019-11-28 03:06:42,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:42,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:42,278 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:42,278 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:42,278 INFO L794 eck$LassoCheckResult]: Stem: 3181#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 3182#L167-1 [2019-11-28 03:06:42,279 INFO L796 eck$LassoCheckResult]: Loop: 3182#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 3284#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 3280#L71 assume !(0 != main_~p1~0); 3276#L71-2 assume !(0 != main_~p2~0); 3274#L75-1 assume !(0 != main_~p3~0); 3272#L79-1 assume !(0 != main_~p4~0); 3268#L83-1 assume !(0 != main_~p5~0); 3264#L87-1 assume !(0 != main_~p6~0); 3262#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3260#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3258#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3256#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3254#L107-1 assume !(0 != main_~p11~0); 3250#L111-1 assume !(0 != main_~p1~0); 3246#L117-1 assume !(0 != main_~p2~0); 3242#L122-1 assume !(0 != main_~p3~0); 3239#L127-1 assume !(0 != main_~p4~0); 3240#L132-1 assume !(0 != main_~p5~0); 3307#L137-1 assume !(0 != main_~p6~0); 3304#L142-1 assume !(0 != main_~p7~0); 3300#L147-1 assume !(0 != main_~p8~0); 3296#L152-1 assume !(0 != main_~p9~0); 3292#L157-1 assume !(0 != main_~p10~0); 3288#L162-1 assume !(0 != main_~p11~0); 3182#L167-1 [2019-11-28 03:06:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-28 03:06:42,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477546293] [2019-11-28 03:06:42,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash -839140378, now seen corresponding path program 1 times [2019-11-28 03:06:42,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269384313] [2019-11-28 03:06:42,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:42,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269384313] [2019-11-28 03:06:42,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:42,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:42,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872077158] [2019-11-28 03:06:42,331 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:42,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:42,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:42,332 INFO L87 Difference]: Start difference. First operand 1041 states and 1585 transitions. cyclomatic complexity: 576 Second operand 3 states. [2019-11-28 03:06:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:42,360 INFO L93 Difference]: Finished difference Result 2049 states and 3073 transitions. [2019-11-28 03:06:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:42,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2049 states and 3073 transitions. [2019-11-28 03:06:42,385 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2019-11-28 03:06:42,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2049 states to 2049 states and 3073 transitions. [2019-11-28 03:06:42,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2049 [2019-11-28 03:06:42,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2049 [2019-11-28 03:06:42,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2049 states and 3073 transitions. [2019-11-28 03:06:42,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:42,409 INFO L688 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2019-11-28 03:06:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states and 3073 transitions. [2019-11-28 03:06:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2019-11-28 03:06:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-11-28 03:06:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3073 transitions. [2019-11-28 03:06:42,459 INFO L711 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2019-11-28 03:06:42,459 INFO L591 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2019-11-28 03:06:42,460 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:06:42,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2049 states and 3073 transitions. [2019-11-28 03:06:42,475 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2019-11-28 03:06:42,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:42,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:42,476 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:42,476 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:42,477 INFO L794 eck$LassoCheckResult]: Stem: 6279#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 6280#L167-1 [2019-11-28 03:06:42,477 INFO L796 eck$LassoCheckResult]: Loop: 6280#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 6452#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 6449#L71 assume !(0 != main_~p1~0); 6450#L71-2 assume !(0 != main_~p2~0); 6431#L75-1 assume !(0 != main_~p3~0); 6432#L79-1 assume !(0 != main_~p4~0); 6417#L83-1 assume !(0 != main_~p5~0); 6418#L87-1 assume !(0 != main_~p6~0); 6395#L91-1 assume !(0 != main_~p7~0); 6397#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6381#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6382#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6366#L107-1 assume !(0 != main_~p11~0); 6367#L111-1 assume !(0 != main_~p1~0); 6485#L117-1 assume !(0 != main_~p2~0); 6483#L122-1 assume !(0 != main_~p3~0); 6481#L127-1 assume !(0 != main_~p4~0); 6479#L132-1 assume !(0 != main_~p5~0); 6477#L137-1 assume !(0 != main_~p6~0); 6473#L142-1 assume !(0 != main_~p7~0); 6470#L147-1 assume !(0 != main_~p8~0); 6464#L152-1 assume !(0 != main_~p9~0); 6460#L157-1 assume !(0 != main_~p10~0); 6456#L162-1 assume !(0 != main_~p11~0); 6280#L167-1 [2019-11-28 03:06:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-28 03:06:42,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815581141] [2019-11-28 03:06:42,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,489 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:42,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1860208732, now seen corresponding path program 1 times [2019-11-28 03:06:42,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501036570] [2019-11-28 03:06:42,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:42,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501036570] [2019-11-28 03:06:42,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:42,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:42,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322707268] [2019-11-28 03:06:42,542 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:42,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:42,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:42,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:42,543 INFO L87 Difference]: Start difference. First operand 2049 states and 3073 transitions. cyclomatic complexity: 1088 Second operand 3 states. [2019-11-28 03:06:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:42,583 INFO L93 Difference]: Finished difference Result 4033 states and 5953 transitions. [2019-11-28 03:06:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:42,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4033 states and 5953 transitions. [2019-11-28 03:06:42,622 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2019-11-28 03:06:42,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4033 states to 4033 states and 5953 transitions. [2019-11-28 03:06:42,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4033 [2019-11-28 03:06:42,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4033 [2019-11-28 03:06:42,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4033 states and 5953 transitions. [2019-11-28 03:06:42,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:42,665 INFO L688 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2019-11-28 03:06:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states and 5953 transitions. [2019-11-28 03:06:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 4033. [2019-11-28 03:06:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4033 states. [2019-11-28 03:06:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5953 transitions. [2019-11-28 03:06:42,767 INFO L711 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2019-11-28 03:06:42,767 INFO L591 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2019-11-28 03:06:42,767 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:06:42,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4033 states and 5953 transitions. [2019-11-28 03:06:42,794 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2019-11-28 03:06:42,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:42,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:42,795 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:42,795 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:42,795 INFO L794 eck$LassoCheckResult]: Stem: 12362#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 12363#L167-1 [2019-11-28 03:06:42,797 INFO L796 eck$LassoCheckResult]: Loop: 12363#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 12540#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 12537#L71 assume !(0 != main_~p1~0); 12538#L71-2 assume !(0 != main_~p2~0); 12517#L75-1 assume !(0 != main_~p3~0); 12518#L79-1 assume !(0 != main_~p4~0); 12501#L83-1 assume !(0 != main_~p5~0); 12503#L87-1 assume !(0 != main_~p6~0); 12477#L91-1 assume !(0 != main_~p7~0); 12479#L95-1 assume !(0 != main_~p8~0); 12457#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 12458#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 12441#L107-1 assume !(0 != main_~p11~0); 12442#L111-1 assume !(0 != main_~p1~0); 12573#L117-1 assume !(0 != main_~p2~0); 12571#L122-1 assume !(0 != main_~p3~0); 12569#L127-1 assume !(0 != main_~p4~0); 12567#L132-1 assume !(0 != main_~p5~0); 12563#L137-1 assume !(0 != main_~p6~0); 12559#L142-1 assume !(0 != main_~p7~0); 12555#L147-1 assume !(0 != main_~p8~0); 12552#L152-1 assume !(0 != main_~p9~0); 12548#L157-1 assume !(0 != main_~p10~0); 12544#L162-1 assume !(0 != main_~p11~0); 12363#L167-1 [2019-11-28 03:06:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-28 03:06:42,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588883655] [2019-11-28 03:06:42,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:42,824 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1154894886, now seen corresponding path program 1 times [2019-11-28 03:06:42,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:42,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718114061] [2019-11-28 03:06:42,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:42,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718114061] [2019-11-28 03:06:42,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:42,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:42,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464528838] [2019-11-28 03:06:42,871 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:42,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:42,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:42,873 INFO L87 Difference]: Start difference. First operand 4033 states and 5953 transitions. cyclomatic complexity: 2048 Second operand 3 states. [2019-11-28 03:06:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:42,925 INFO L93 Difference]: Finished difference Result 7937 states and 11521 transitions. [2019-11-28 03:06:42,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:42,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7937 states and 11521 transitions. [2019-11-28 03:06:42,983 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2019-11-28 03:06:43,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7937 states to 7937 states and 11521 transitions. [2019-11-28 03:06:43,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7937 [2019-11-28 03:06:43,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7937 [2019-11-28 03:06:43,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7937 states and 11521 transitions. [2019-11-28 03:06:43,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:43,067 INFO L688 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2019-11-28 03:06:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7937 states and 11521 transitions. [2019-11-28 03:06:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7937 to 7937. [2019-11-28 03:06:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-11-28 03:06:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 11521 transitions. [2019-11-28 03:06:43,255 INFO L711 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2019-11-28 03:06:43,255 INFO L591 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2019-11-28 03:06:43,255 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:06:43,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7937 states and 11521 transitions. [2019-11-28 03:06:43,295 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2019-11-28 03:06:43,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:43,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:43,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:43,296 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:43,296 INFO L794 eck$LassoCheckResult]: Stem: 24344#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 24345#L167-1 [2019-11-28 03:06:43,296 INFO L796 eck$LassoCheckResult]: Loop: 24345#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 24451#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 24447#L71 assume !(0 != main_~p1~0); 24443#L71-2 assume !(0 != main_~p2~0); 24441#L75-1 assume !(0 != main_~p3~0); 24439#L79-1 assume !(0 != main_~p4~0); 24435#L83-1 assume !(0 != main_~p5~0); 24431#L87-1 assume !(0 != main_~p6~0); 24427#L91-1 assume !(0 != main_~p7~0); 24423#L95-1 assume !(0 != main_~p8~0); 24419#L99-1 assume !(0 != main_~p9~0); 24417#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 24415#L107-1 assume !(0 != main_~p11~0); 24411#L111-1 assume !(0 != main_~p1~0); 24407#L117-1 assume !(0 != main_~p2~0); 24403#L122-1 assume !(0 != main_~p3~0); 24400#L127-1 assume !(0 != main_~p4~0); 24401#L132-1 assume !(0 != main_~p5~0); 24474#L137-1 assume !(0 != main_~p6~0); 24470#L142-1 assume !(0 != main_~p7~0); 24466#L147-1 assume !(0 != main_~p8~0); 24462#L152-1 assume !(0 != main_~p9~0); 24459#L157-1 assume !(0 != main_~p10~0); 24455#L162-1 assume !(0 != main_~p11~0); 24345#L167-1 [2019-11-28 03:06:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:43,297 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-28 03:06:43,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:43,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354313914] [2019-11-28 03:06:43,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:43,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:43,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash 143777636, now seen corresponding path program 1 times [2019-11-28 03:06:43,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:43,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052442611] [2019-11-28 03:06:43,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:06:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:06:43,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052442611] [2019-11-28 03:06:43,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:06:43,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:06:43,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468466718] [2019-11-28 03:06:43,358 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:06:43,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:06:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:06:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:06:43,359 INFO L87 Difference]: Start difference. First operand 7937 states and 11521 transitions. cyclomatic complexity: 3840 Second operand 3 states. [2019-11-28 03:06:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:06:43,416 INFO L93 Difference]: Finished difference Result 15617 states and 22273 transitions. [2019-11-28 03:06:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:06:43,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15617 states and 22273 transitions. [2019-11-28 03:06:43,562 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2019-11-28 03:06:43,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15617 states to 15617 states and 22273 transitions. [2019-11-28 03:06:43,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15617 [2019-11-28 03:06:43,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15617 [2019-11-28 03:06:43,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15617 states and 22273 transitions. [2019-11-28 03:06:43,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:06:43,661 INFO L688 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2019-11-28 03:06:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states and 22273 transitions. [2019-11-28 03:06:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 15617. [2019-11-28 03:06:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15617 states. [2019-11-28 03:06:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15617 states to 15617 states and 22273 transitions. [2019-11-28 03:06:43,929 INFO L711 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2019-11-28 03:06:43,929 INFO L591 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2019-11-28 03:06:43,929 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:06:43,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15617 states and 22273 transitions. [2019-11-28 03:06:43,992 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2019-11-28 03:06:43,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:06:43,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:06:43,994 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 03:06:43,994 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:06:43,994 INFO L794 eck$LassoCheckResult]: Stem: 47901#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 47902#L167-1 [2019-11-28 03:06:43,994 INFO L796 eck$LassoCheckResult]: Loop: 47902#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 48083#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 48080#L71 assume !(0 != main_~p1~0); 48081#L71-2 assume !(0 != main_~p2~0); 48064#L75-1 assume !(0 != main_~p3~0); 48065#L79-1 assume !(0 != main_~p4~0); 48044#L83-1 assume !(0 != main_~p5~0); 48046#L87-1 assume !(0 != main_~p6~0); 48020#L91-1 assume !(0 != main_~p7~0); 48022#L95-1 assume !(0 != main_~p8~0); 47996#L99-1 assume !(0 != main_~p9~0); 47998#L103-1 assume !(0 != main_~p10~0); 47976#L107-1 assume !(0 != main_~p11~0); 47977#L111-1 assume !(0 != main_~p1~0); 48119#L117-1 assume !(0 != main_~p2~0); 48116#L122-1 assume !(0 != main_~p3~0); 48114#L127-1 assume !(0 != main_~p4~0); 48110#L132-1 assume !(0 != main_~p5~0); 48106#L137-1 assume !(0 != main_~p6~0); 48102#L142-1 assume !(0 != main_~p7~0); 48098#L147-1 assume !(0 != main_~p8~0); 48094#L152-1 assume !(0 != main_~p9~0); 48090#L157-1 assume !(0 != main_~p10~0); 48087#L162-1 assume !(0 != main_~p11~0); 47902#L167-1 [2019-11-28 03:06:43,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-28 03:06:43,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:43,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496712181] [2019-11-28 03:06:43,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:44,003 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash -443028378, now seen corresponding path program 1 times [2019-11-28 03:06:44,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:44,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647114581] [2019-11-28 03:06:44,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:44,029 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:06:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash -412008571, now seen corresponding path program 1 times [2019-11-28 03:06:44,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:06:44,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970951881] [2019-11-28 03:06:44,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:06:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:06:44,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:06:44,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:06:44 BoogieIcfgContainer [2019-11-28 03:06:44,297 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:06:44,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:06:44,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:06:44,299 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:06:44,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:06:41" (3/4) ... [2019-11-28 03:06:44,304 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:06:44,398 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:06:44,398 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:06:44,401 INFO L168 Benchmark]: Toolchain (without parser) took 4080.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 267.4 MB). Free memory was 959.0 MB in the beginning and 1.0 GB in the end (delta: -85.9 MB). Peak memory consumption was 181.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:44,401 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:06:44,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:44,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:06:44,402 INFO L168 Benchmark]: Boogie Preprocessor took 28.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:06:44,409 INFO L168 Benchmark]: RCFGBuilder took 405.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:44,410 INFO L168 Benchmark]: BuchiAutomizer took 3089.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:44,410 INFO L168 Benchmark]: Witness Printer took 99.62 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:06:44,412 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 416.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 405.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3089.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 11.5 GB. * Witness Printer took 99.62 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15617 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 15617 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 787 SDtfs, 411 SDslu, 482 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 42]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50a84213=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41ea8cc=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f0d9757=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dc3cf89=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76f442c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f7a0fd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cc0ff1f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5dd074f7=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4384626d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@178d9829=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79846d44=0, p11=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4075fbd9=0, lk11=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L40] int cond; Loop: [L42] COND TRUE 1 [L43] cond = __VERIFIER_nondet_int() [L44] COND FALSE !(cond == 0) [L47] lk1 = 0 [L49] lk2 = 0 [L51] lk3 = 0 [L53] lk4 = 0 [L55] lk5 = 0 [L57] lk6 = 0 [L59] lk7 = 0 [L61] lk8 = 0 [L63] lk9 = 0 [L65] lk10 = 0 [L67] lk11 = 0 [L71] COND FALSE !(p1 != 0) [L75] COND FALSE !(p2 != 0) [L79] COND FALSE !(p3 != 0) [L83] COND FALSE !(p4 != 0) [L87] COND FALSE !(p5 != 0) [L91] COND FALSE !(p6 != 0) [L95] COND FALSE !(p7 != 0) [L99] COND FALSE !(p8 != 0) [L103] COND FALSE !(p9 != 0) [L107] COND FALSE !(p10 != 0) [L111] COND FALSE !(p11 != 0) [L117] COND FALSE !(p1 != 0) [L122] COND FALSE !(p2 != 0) [L127] COND FALSE !(p3 != 0) [L132] COND FALSE !(p4 != 0) [L137] COND FALSE !(p5 != 0) [L142] COND FALSE !(p6 != 0) [L147] COND FALSE !(p7 != 0) [L152] COND FALSE !(p8 != 0) [L157] COND FALSE !(p9 != 0) [L162] COND FALSE !(p10 != 0) [L167] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...