./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer --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 6191f76ca1968cb0b63f42b60887059af617e3ab .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:11:09,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:11:09,102 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:11:09,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:11:09,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:11:09,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:11:09,111 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:11:09,112 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:11:09,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:11:09,114 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:11:09,115 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:11:09,115 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:11:09,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:11:09,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:11:09,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:11:09,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:11:09,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:11:09,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:11:09,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:11:09,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:11:09,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:11:09,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:11:09,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:11:09,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:11:09,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:11:09,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:11:09,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:11:09,126 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:11:09,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:11:09,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:11:09,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:11:09,128 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:11:09,128 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:11:09,128 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:11:09,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:11:09,129 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:11:09,129 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:11:09,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:11:09,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:11:09,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:11:09,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:11:09,141 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:11:09,141 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:11:09,141 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:11:09,142 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:11:09,142 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:11:09,142 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:11:09,142 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:11:09,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:11:09,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:11:09,142 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:11:09,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:11:09,143 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:11:09,144 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:11:09,144 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:11:09,144 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:11:09,144 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:11:09,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:11:09,144 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:11:09,144 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:11:09,145 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:11:09,145 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer 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 -> 6191f76ca1968cb0b63f42b60887059af617e3ab [2018-11-28 13:11:09,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:11:09,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:11:09,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:11:09,181 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:11:09,181 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:11:09,182 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 13:11:09,220 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/data/d12304f05/01561a7bce324a30b093038f5c4ea722/FLAG25dd0a46c [2018-11-28 13:11:09,643 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:11:09,644 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 13:11:09,651 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/data/d12304f05/01561a7bce324a30b093038f5c4ea722/FLAG25dd0a46c [2018-11-28 13:11:09,662 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/data/d12304f05/01561a7bce324a30b093038f5c4ea722 [2018-11-28 13:11:09,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:11:09,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:11:09,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:11:09,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:11:09,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:11:09,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eb1ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09, skipping insertion in model container [2018-11-28 13:11:09,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:11:09,697 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:11:09,839 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:11:09,845 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:11:09,880 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:11:09,929 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:11:09,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09 WrapperNode [2018-11-28 13:11:09,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:11:09,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:11:09,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:11:09,930 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:11:09,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:11:09,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:11:09,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:11:09,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:11:09,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... [2018-11-28 13:11:09,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:11:09,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:11:09,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:11:09,985 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:11:09,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/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 [2018-11-28 13:11:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:11:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:11:10,400 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:11:10,400 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-11-28 13:11:10,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:11:10 BoogieIcfgContainer [2018-11-28 13:11:10,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:11:10,401 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:11:10,401 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:11:10,403 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:11:10,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:11:10,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:11:09" (1/3) ... [2018-11-28 13:11:10,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@adb9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:11:10, skipping insertion in model container [2018-11-28 13:11:10,405 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:11:10,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:11:09" (2/3) ... [2018-11-28 13:11:10,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@adb9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:11:10, skipping insertion in model container [2018-11-28 13:11:10,405 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:11:10,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:11:10" (3/3) ... [2018-11-28 13:11:10,406 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 13:11:10,438 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:11:10,438 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:11:10,438 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:11:10,438 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:11:10,438 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:11:10,438 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:11:10,438 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:11:10,439 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:11:10,439 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:11:10,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2018-11-28 13:11:10,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-28 13:11:10,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:11:10,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:11:10,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:11:10,473 INFO L867 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, 1, 1] [2018-11-28 13:11:10,473 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:11:10,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2018-11-28 13:11:10,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-28 13:11:10,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:11:10,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:11:10,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:11:10,477 INFO L867 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, 1, 1] [2018-11-28 13:11:10,482 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 14#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 32#L242true assume !(0 == ~r1~0);init_~tmp~0 := 0; 30#L242-1true init_#res := init_~tmp~0; 76#L367true main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 39#L439-2true [2018-11-28 13:11:10,482 INFO L796 eck$LassoCheckResult]: Loop: 39#L439-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 7#L113true assume !(0 != ~mode1~0 % 256); 71#L129true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 67#L129-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 3#L113-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 89#L141true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 59#L144true assume !(node2_~m2~0 != ~nomsg~0); 55#L144-1true ~mode2~0 := 0; 86#L141-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 61#L166true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 40#L169true assume !(node3_~m3~0 != ~nomsg~0); 35#L169-1true ~mode3~0 := 0; 77#L166-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 68#L191true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 49#L194true assume !(node4_~m4~0 != ~nomsg~0); 48#L194-1true ~mode4~0 := 0; 34#L191-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 51#L216true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 5#L219true assume !(node5_~m5~0 != ~nomsg~0); 4#L219-1true ~mode5~0 := 0; 47#L216-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 82#L375true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 83#L375-1true check_#res := check_~tmp~1; 37#L395true main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 64#L469true assume !(0 == assert_~arg % 256); 25#L464true main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 39#L439-2true [2018-11-28 13:11:10,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 28874490, now seen corresponding path program 1 times [2018-11-28 13:11:10,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:10,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:10,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:10,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:10,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:11:10,624 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:11:10,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2097075120, now seen corresponding path program 1 times [2018-11-28 13:11:10,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:10,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:10,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:11:10,706 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:11:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:11:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:11:10,716 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-11-28 13:11:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:10,780 INFO L93 Difference]: Finished difference Result 92 states and 152 transitions. [2018-11-28 13:11:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:11:10,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 152 transitions. [2018-11-28 13:11:10,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-11-28 13:11:10,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 85 states and 115 transitions. [2018-11-28 13:11:10,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-28 13:11:10,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-28 13:11:10,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 115 transitions. [2018-11-28 13:11:10,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:11:10,789 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2018-11-28 13:11:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 115 transitions. [2018-11-28 13:11:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-28 13:11:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 13:11:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2018-11-28 13:11:10,816 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2018-11-28 13:11:10,816 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2018-11-28 13:11:10,816 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:11:10,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 115 transitions. [2018-11-28 13:11:10,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-11-28 13:11:10,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:11:10,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:11:10,819 INFO L866 BuchiCegarLoop]: Counterexample stem 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:10,819 INFO L867 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, 1, 1] [2018-11-28 13:11:10,820 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 217#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 218#L242 assume 0 == ~r1~0; 244#L243 assume ~id1~0 >= 0; 273#L244 assume 0 == ~st1~0; 254#L245 assume ~send1~0 == ~id1~0; 255#L246 assume 0 == ~mode1~0 % 256; 277#L247 assume ~id2~0 >= 0; 228#L248 assume 0 == ~st2~0; 229#L249 assume ~send2~0 == ~id2~0; 265#L250 assume 0 == ~mode2~0 % 256; 268#L251 assume ~id3~0 >= 0; 211#L252 assume 0 == ~st3~0; 212#L253 assume ~send3~0 == ~id3~0; 246#L254 assume 0 == ~mode3~0 % 256; 219#L255 assume ~id4~0 >= 0; 220#L256 assume 0 == ~st4~0; 257#L257 assume ~send4~0 == ~id4~0; 278#L258 assume 0 == ~mode4~0 % 256; 232#L259 assume ~id5~0 >= 0; 233#L260 assume 0 == ~st5~0; 266#L261 assume ~send5~0 == ~id5~0; 269#L262 assume 0 == ~mode5~0 % 256; 213#L263 assume ~id1~0 != ~id2~0; 214#L264 assume ~id1~0 != ~id3~0; 247#L265 assume ~id1~0 != ~id4~0; 221#L266 assume ~id1~0 != ~id5~0; 222#L267 assume ~id2~0 != ~id3~0; 258#L268 assume ~id2~0 != ~id4~0; 279#L269 assume ~id2~0 != ~id5~0; 234#L270 assume ~id3~0 != ~id4~0; 235#L271 assume ~id3~0 != ~id5~0; 236#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 241#L242-1 init_#res := init_~tmp~0; 242#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 231#L439-2 [2018-11-28 13:11:10,820 INFO L796 eck$LassoCheckResult]: Loop: 231#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 206#L113 assume !(0 != ~mode1~0 % 256); 208#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 275#L129-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 197#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 198#L141 assume !(0 != ~mode2~0 % 256); 237#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 238#L154-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 262#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 272#L166 assume !(0 != ~mode3~0 % 256); 215#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 209#L179-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 210#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 276#L191 assume !(0 != ~mode4~0 % 256); 225#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 223#L204-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 224#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 245#L216 assume !(0 != ~mode5~0 % 256); 263#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 281#L229-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 200#L216-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 259#L375 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 226#L375-1 check_#res := check_~tmp~1; 249#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 250#L469 assume !(0 == assert_~arg % 256); 230#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 231#L439-2 [2018-11-28 13:11:10,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:10,820 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 1 times [2018-11-28 13:11:10,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:10,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:10,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash 219355176, now seen corresponding path program 1 times [2018-11-28 13:11:10,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:10,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:10,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:10,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:10,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:11:10,956 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:11:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:11:10,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:11:10,956 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-28 13:11:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:10,984 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2018-11-28 13:11:10,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:11:10,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 117 transitions. [2018-11-28 13:11:10,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-11-28 13:11:10,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 85 states and 112 transitions. [2018-11-28 13:11:10,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-28 13:11:10,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-28 13:11:10,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 112 transitions. [2018-11-28 13:11:10,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:11:10,988 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-11-28 13:11:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 112 transitions. [2018-11-28 13:11:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-28 13:11:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 13:11:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2018-11-28 13:11:10,992 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-11-28 13:11:10,992 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-11-28 13:11:10,993 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:11:10,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 112 transitions. [2018-11-28 13:11:10,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-11-28 13:11:10,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:11:10,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:11:10,995 INFO L866 BuchiCegarLoop]: Counterexample stem 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:10,995 INFO L867 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, 1, 1, 1, 1] [2018-11-28 13:11:10,995 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 402#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 403#L242 assume 0 == ~r1~0; 429#L243 assume ~id1~0 >= 0; 458#L244 assume 0 == ~st1~0; 438#L245 assume ~send1~0 == ~id1~0; 439#L246 assume 0 == ~mode1~0 % 256; 462#L247 assume ~id2~0 >= 0; 413#L248 assume 0 == ~st2~0; 414#L249 assume ~send2~0 == ~id2~0; 449#L250 assume 0 == ~mode2~0 % 256; 453#L251 assume ~id3~0 >= 0; 396#L252 assume 0 == ~st3~0; 397#L253 assume ~send3~0 == ~id3~0; 430#L254 assume 0 == ~mode3~0 % 256; 404#L255 assume ~id4~0 >= 0; 405#L256 assume 0 == ~st4~0; 442#L257 assume ~send4~0 == ~id4~0; 463#L258 assume 0 == ~mode4~0 % 256; 415#L259 assume ~id5~0 >= 0; 416#L260 assume 0 == ~st5~0; 451#L261 assume ~send5~0 == ~id5~0; 454#L262 assume 0 == ~mode5~0 % 256; 398#L263 assume ~id1~0 != ~id2~0; 399#L264 assume ~id1~0 != ~id3~0; 432#L265 assume ~id1~0 != ~id4~0; 406#L266 assume ~id1~0 != ~id5~0; 407#L267 assume ~id2~0 != ~id3~0; 443#L268 assume ~id2~0 != ~id4~0; 464#L269 assume ~id2~0 != ~id5~0; 419#L270 assume ~id3~0 != ~id4~0; 420#L271 assume ~id3~0 != ~id5~0; 421#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 426#L242-1 init_#res := init_~tmp~0; 427#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 418#L439-2 [2018-11-28 13:11:10,996 INFO L796 eck$LassoCheckResult]: Loop: 418#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 391#L113 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 392#L117 assume !(node1_~m1~0 != ~nomsg~0); 401#L117-1 ~mode1~0 := 0; 382#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 383#L141 assume !(0 != ~mode2~0 % 256); 422#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 423#L154-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 447#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 457#L166 assume !(0 != ~mode3~0 % 256); 400#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 394#L179-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 395#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 461#L191 assume !(0 != ~mode4~0 % 256); 410#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 408#L204-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 409#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 431#L216 assume !(0 != ~mode5~0 % 256); 448#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 466#L229-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 385#L216-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 444#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 388#L376 assume ~r1~0 >= 5; 389#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 411#L375-1 check_#res := check_~tmp~1; 434#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 435#L469 assume !(0 == assert_~arg % 256); 417#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 418#L439-2 [2018-11-28 13:11:10,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 2 times [2018-11-28 13:11:10,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:10,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:10,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:10,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:11,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1823427134, now seen corresponding path program 1 times [2018-11-28 13:11:11,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:11,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:11,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:11:11,053 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:11:11,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:11:11,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:11:11,053 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-28 13:11:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:11,079 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2018-11-28 13:11:11,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:11:11,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 178 transitions. [2018-11-28 13:11:11,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-11-28 13:11:11,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 178 transitions. [2018-11-28 13:11:11,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2018-11-28 13:11:11,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-11-28 13:11:11,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 178 transitions. [2018-11-28 13:11:11,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:11:11,085 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2018-11-28 13:11:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 178 transitions. [2018-11-28 13:11:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-28 13:11:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-28 13:11:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2018-11-28 13:11:11,091 INFO L728 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2018-11-28 13:11:11,091 INFO L608 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2018-11-28 13:11:11,091 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:11:11,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 178 transitions. [2018-11-28 13:11:11,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-11-28 13:11:11,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:11:11,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:11:11,093 INFO L866 BuchiCegarLoop]: Counterexample stem 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:11,093 INFO L867 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, 1, 1, 1, 1, 1] [2018-11-28 13:11:11,093 INFO L794 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 622#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 623#L242 assume 0 == ~r1~0; 648#L243 assume ~id1~0 >= 0; 679#L244 assume 0 == ~st1~0; 658#L245 assume ~send1~0 == ~id1~0; 659#L246 assume 0 == ~mode1~0 % 256; 683#L247 assume ~id2~0 >= 0; 632#L248 assume 0 == ~st2~0; 633#L249 assume ~send2~0 == ~id2~0; 670#L250 assume 0 == ~mode2~0 % 256; 673#L251 assume ~id3~0 >= 0; 615#L252 assume 0 == ~st3~0; 616#L253 assume ~send3~0 == ~id3~0; 650#L254 assume 0 == ~mode3~0 % 256; 624#L255 assume ~id4~0 >= 0; 625#L256 assume 0 == ~st4~0; 662#L257 assume ~send4~0 == ~id4~0; 684#L258 assume 0 == ~mode4~0 % 256; 636#L259 assume ~id5~0 >= 0; 637#L260 assume 0 == ~st5~0; 671#L261 assume ~send5~0 == ~id5~0; 674#L262 assume 0 == ~mode5~0 % 256; 617#L263 assume ~id1~0 != ~id2~0; 618#L264 assume ~id1~0 != ~id3~0; 654#L265 assume ~id1~0 != ~id4~0; 628#L266 assume ~id1~0 != ~id5~0; 629#L267 assume ~id2~0 != ~id3~0; 663#L268 assume ~id2~0 != ~id4~0; 685#L269 assume ~id2~0 != ~id5~0; 638#L270 assume ~id3~0 != ~id4~0; 639#L271 assume ~id3~0 != ~id5~0; 640#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 645#L242-1 init_#res := init_~tmp~0; 646#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 687#L439-2 [2018-11-28 13:11:11,094 INFO L796 eck$LassoCheckResult]: Loop: 687#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 724#L113 assume !(0 != ~mode1~0 % 256); 723#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 722#L129-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 621#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 721#L141 assume !(0 != ~mode2~0 % 256); 720#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 719#L154-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 718#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 717#L166 assume !(0 != ~mode3~0 % 256); 713#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 711#L179-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 710#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 709#L191 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 707#L194 assume !(node4_~m4~0 != ~nomsg~0); 703#L194-1 ~mode4~0 := 0; 702#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 701#L216 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 699#L219 assume !(node5_~m5~0 != ~nomsg~0); 695#L219-1 ~mode5~0 := 0; 694#L216-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 693#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 692#L376 assume !(~r1~0 >= 5); 690#L379 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 691#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 730#L375-1 check_#res := check_~tmp~1; 729#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 728#L469 assume !(0 == assert_~arg % 256); 727#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 687#L439-2 [2018-11-28 13:11:11,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 3 times [2018-11-28 13:11:11,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:11,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:11,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:11,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:11,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1664257150, now seen corresponding path program 1 times [2018-11-28 13:11:11,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:11,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:11,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash -241790386, now seen corresponding path program 1 times [2018-11-28 13:11:11,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:11,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:11,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:11:11,515 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2018-11-28 13:11:13,112 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 145 DAG size of output: 134 [2018-11-28 13:11:13,124 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:11:13,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:11:13,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:11:13,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:11:13,125 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:11:13,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:11:13,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:11:13,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:11:13,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-28 13:11:13,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:11:13,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:11:13,143 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 13:11:13,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,351 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-11-28 13:11:13,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:13,576 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-11-28 13:11:13,632 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-28 13:11:41,138 WARN L180 SmtUtils]: Spent 27.36 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2018-11-28 13:11:41,226 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:11:41,226 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:11:41,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:11:41,235 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe826fc2-6b3d-48df-8fb2-522905d6df74/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:11:41,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:11:41,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:11:41,401 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:11:41,403 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:11:41,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:11:41,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:11:41,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:11:41,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:11:41,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:11:41,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:11:41,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:11:41,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-28 13:11:41,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:11:41,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:11:41,406 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 13:11:41,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,600 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-11-28 13:11:41,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:11:41,861 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-11-28 13:11:41,919 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-28 13:12:13,789 WARN L180 SmtUtils]: Spent 31.78 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2018-11-28 13:12:13,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:12:13,848 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:12:13,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:13,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:13,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:13,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:12:13,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:12:13,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:13,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:13,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:13,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:13,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:13,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:13,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:12:13,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:12:13,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:13,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:13,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:13,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:12:13,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:12:13,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:13,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:13,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:13,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:13,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:13,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:13,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:13,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:12:13,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:12:13,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:13,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:13,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:13,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:13,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:13,897 INFO L206 nArgumentSynthesizer]: 64 loop disjuncts [2018-11-28 13:12:13,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:13,974 INFO L402 nArgumentSynthesizer]: We have 128 Motzkin's Theorem applications. [2018-11-28 13:12:13,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:14,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:14,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:14,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:14,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:14,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:14,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:14,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:14,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:14,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:14,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:14,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:14,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:14,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:14,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:14,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:14,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:14,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:14,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:14,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:14,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:14,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:14,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:14,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:14,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:14,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:12:14,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:12:14,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:14,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:14,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:14,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:14,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:14,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:14,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:14,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:14,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:14,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:12:14,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:12:14,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:12:14,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:12:14,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:12:14,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:12:14,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:12:14,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:12:14,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:12:14,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:12:14,249 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:12:14,249 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:12:14,251 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:12:14,251 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:12:14,251 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:12:14,251 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-28 13:12:14,252 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:12:14,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:14,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:12:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:14,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:12:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:14,344 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:12:14,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 178 transitions. cyclomatic complexity: 50 Second operand 3 states. [2018-11-28 13:12:14,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 178 transitions. cyclomatic complexity: 50. Second operand 3 states. Result 222 states and 321 transitions. Complement of second has 4 states. [2018-11-28 13:12:14,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:12:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:12:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2018-11-28 13:12:14,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 35 letters. Loop has 29 letters. [2018-11-28 13:12:14,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:12:14,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 64 letters. Loop has 29 letters. [2018-11-28 13:12:14,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:12:14,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 35 letters. Loop has 58 letters. [2018-11-28 13:12:14,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:12:14,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 321 transitions. [2018-11-28 13:12:14,389 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:12:14,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 0 states and 0 transitions. [2018-11-28 13:12:14,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:12:14,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:12:14,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:12:14,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:12:14,390 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:12:14,390 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:12:14,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:14,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:14,391 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-28 13:12:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:14,392 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 13:12:14,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:12:14,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 13:12:14,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:12:14,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:12:14,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:12:14,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:12:14,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:12:14,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:12:14,392 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:12:14,392 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:12:14,392 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:12:14,393 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:12:14,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:12:14,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:12:14,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:12:14,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:12:14 BoogieIcfgContainer [2018-11-28 13:12:14,398 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:12:14,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:12:14,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:12:14,399 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:12:14,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:11:10" (3/4) ... [2018-11-28 13:12:14,402 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:12:14,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:12:14,403 INFO L168 Benchmark]: Toolchain (without parser) took 64738.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 403.7 MB). Free memory was 952.2 MB in the beginning and 907.4 MB in the end (delta: 44.9 MB). Peak memory consumption was 448.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:14,404 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:12:14,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:14,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.63 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:14,405 INFO L168 Benchmark]: Boogie Preprocessor took 25.64 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:14,406 INFO L168 Benchmark]: RCFGBuilder took 415.91 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:14,406 INFO L168 Benchmark]: BuchiAutomizer took 63996.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.9 MB). Free memory was 1.1 GB in the beginning and 918.8 MB in the end (delta: 167.8 MB). Peak memory consumption was 435.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:14,406 INFO L168 Benchmark]: Witness Printer took 3.22 ms. Allocated memory is still 1.4 GB. Free memory was 918.8 MB in the beginning and 907.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:14,409 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.63 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.64 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 415.91 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 63996.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.9 MB). Free memory was 1.1 GB in the beginning and 918.8 MB in the end (delta: 167.8 MB). Peak memory consumption was 435.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.22 ms. Allocated memory is still 1.4 GB. Free memory was 918.8 MB in the beginning and 907.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 63.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 63.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 129 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 543 SDtfs, 178 SDslu, 775 SDs, 0 SdLazy, 32 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1394 mio100 ax104 hnf100 lsp14 ukn65 mio100 lsp100 div172 bol100 ite100 ukn100 eq166 hnf67 smp100 dnf40036 smp11 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 337ms VariablesStem: 0 VariablesLoop: 32 DisjunctsStem: 1 DisjunctsLoop: 64 SupportingInvariants: 0 MotzkinApplications: 128 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...