./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/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 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:21:24,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:21:24,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:21:24,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:21:24,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:21:24,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:21:24,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:21:24,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:21:24,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:21:24,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:21:24,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:21:24,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:21:24,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:21:24,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:21:24,429 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:21:24,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:21:24,430 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:21:24,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:21:24,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:21:24,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:21:24,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:21:24,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:21:24,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:21:24,437 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:21:24,437 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:21:24,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:21:24,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:21:24,439 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:21:24,440 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:21:24,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:21:24,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:21:24,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:21:24,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:21:24,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:21:24,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:21:24,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:21:24,443 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 09:21:24,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:21:24,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:21:24,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:21:24,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:21:24,455 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:21:24,455 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:21:24,455 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:21:24,455 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:21:24,455 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:21:24,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:21:24,456 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:21:24,457 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:21:24,457 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:21:24,457 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:21:24,457 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:21:24,457 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:21:24,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:21:24,457 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:21:24,457 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:21:24,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:21:24,458 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:21:24,458 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:21:24,458 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:21:24,458 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_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/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 -> 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c [2018-11-10 09:21:24,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:21:24,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:21:24,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:21:24,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:21:24,496 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:21:24,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 09:21:24,541 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/data/c7d297ef9/41ff9cc80d2140f9a36ae5a3fb1da963/FLAGb587651ae [2018-11-10 09:21:24,894 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:21:24,894 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 09:21:24,900 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/data/c7d297ef9/41ff9cc80d2140f9a36ae5a3fb1da963/FLAGb587651ae [2018-11-10 09:21:24,912 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/data/c7d297ef9/41ff9cc80d2140f9a36ae5a3fb1da963 [2018-11-10 09:21:24,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:21:24,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:21:24,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:21:24,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:21:24,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:21:24,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:24" (1/1) ... [2018-11-10 09:21:24,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a294ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:24, skipping insertion in model container [2018-11-10 09:21:24,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:24" (1/1) ... [2018-11-10 09:21:24,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:21:24,954 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:21:25,102 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:21:25,106 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:21:25,147 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:21:25,159 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:21:25,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25 WrapperNode [2018-11-10 09:21:25,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:21:25,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:21:25,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:21:25,160 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:21:25,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:21:25,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:21:25,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:21:25,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:21:25,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2018-11-10 09:21:25,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:21:25,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:21:25,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:21:25,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:21:25,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/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-10 09:21:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:21:25,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:21:26,396 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:21:26,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:21:26 BoogieIcfgContainer [2018-11-10 09:21:26,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:21:26,397 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:21:26,397 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:21:26,400 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:21:26,400 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:26,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:21:24" (1/3) ... [2018-11-10 09:21:26,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e3fa1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:21:26, skipping insertion in model container [2018-11-10 09:21:26,402 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:26,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (2/3) ... [2018-11-10 09:21:26,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e3fa1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:21:26, skipping insertion in model container [2018-11-10 09:21:26,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:26,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:21:26" (3/3) ... [2018-11-10 09:21:26,406 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 09:21:26,450 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:21:26,450 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:21:26,450 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:21:26,451 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:21:26,451 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:21:26,451 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:21:26,451 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:21:26,451 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:21:26,451 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:21:26,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 492 states. [2018-11-10 09:21:26,503 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 473 [2018-11-10 09:21:26,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:26,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:26,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:21:26,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:26,510 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:21:26,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 492 states. [2018-11-10 09:21:26,516 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 473 [2018-11-10 09:21:26,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:26,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:26,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:21:26,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:26,522 INFO L793 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 211#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 393#L116-3true [2018-11-10 09:21:26,522 INFO L795 eck$LassoCheckResult]: Loop: 393#L116-3true assume true; 398#L116-1true assume !!(add_history_type_~var~0 < 3); 360#L117true assume !(add_history_type_~history_id == 0); 193#L123true assume !(add_history_type_~history_id == 1); 476#L129true assume !(add_history_type_~history_id == 2); 160#L135true assume !(add_history_type_~history_id == 3); 159#L135-2true add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 393#L116-3true [2018-11-10 09:21:26,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 09:21:26,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:26,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:26,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:26,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:26,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:26,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:26,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1102018133, now seen corresponding path program 1 times [2018-11-10 09:21:26,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:26,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:26,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:26,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:26,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:26,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash 444278697, now seen corresponding path program 1 times [2018-11-10 09:21:26,632 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:26,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:26,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:26,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:26,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:26,695 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-10 09:21:26,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:26,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:26,739 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:26,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:26,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:26,740 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:26,740 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:26,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:26,741 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:26,741 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:26,741 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-10 09:21:26,741 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:26,741 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:26,756 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-10 09:21:26,761 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-10 09:21:26,764 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-10 09:21:26,766 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-10 09:21:26,782 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-10 09:21:26,784 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-10 09:21:26,786 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-10 09:21:26,787 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-10 09:21:26,789 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-10 09:21:26,803 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-10 09:21:26,809 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-10 09:21:26,947 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:26,947 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/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-10 09:21:26,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:26,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:26,970 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:26,970 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_1=3} Honda state: {v_rep#funAddr~voter.offset_1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/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-10 09:21:26,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:26,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:26,975 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:26,976 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:26,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:26,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:26,995 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:26,995 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:27,013 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:27,015 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:27,016 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:27,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:27,049 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:27,049 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_1=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:27,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:27,078 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:27,078 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_1=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 09:21:27,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:27,081 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,098 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:27,098 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_1=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:27,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:27,105 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:27,105 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_1=-1} Honda state: {v_rep#funAddr~voter.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:27,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:27,125 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:27,126 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=-8} Honda state: {ULTIMATE.start_add_history_type_~history_id=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:27,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:27,145 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:27,145 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:27,177 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:27,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:27,214 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:27,215 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:27,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:27,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:27,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:27,216 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:27,216 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:27,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:27,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-10 09:21:27,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:27,217 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:27,219 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-10 09:21:27,221 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-10 09:21:27,224 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-10 09:21:27,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-10 09:21:27,228 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-10 09:21:27,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-10 09:21:27,230 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-10 09:21:27,232 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-10 09:21:27,233 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-10 09:21:27,234 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-10 09:21:27,245 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-10 09:21:27,389 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:27,393 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:27,395 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-10 09:21:27,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:27,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:27,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,406 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-10 09:21:27,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:27,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:27,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,413 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-10 09:21:27,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:27,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:27,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,419 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-10 09:21:27,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:27,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:27,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,425 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-10 09:21:27,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:27,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:27,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,431 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-10 09:21:27,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:27,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:27,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,436 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-10 09:21:27,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:27,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:27,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,442 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-10 09:21:27,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:27,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:27,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,447 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-10 09:21:27,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:27,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:27,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:27,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,450 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-10 09:21:27,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:27,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,450 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 09:21:27,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,451 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 09:21:27,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:27,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:27,452 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-10 09:21:27,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:27,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:27,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:27,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:27,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:27,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:27,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:27,456 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:27,458 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:27,458 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:27,459 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:27,460 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:27,460 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:27,460 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 5 Supporting invariants [] [2018-11-10 09:21:27,461 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:27,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:27,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:27,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:27,516 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-10 09:21:27,525 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-10 09:21:27,526 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 492 states. Second operand 4 states. [2018-11-10 09:21:27,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 492 states.. Second operand 4 states. Result 2046 states and 3370 transitions. Complement of second has 8 states. [2018-11-10 09:21:27,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1764 transitions. [2018-11-10 09:21:27,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1764 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-10 09:21:27,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:27,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1764 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 09:21:27,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:27,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1764 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-10 09:21:27,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:27,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2046 states and 3370 transitions. [2018-11-10 09:21:27,664 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 864 [2018-11-10 09:21:27,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2046 states to 988 states and 1630 transitions. [2018-11-10 09:21:27,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 934 [2018-11-10 09:21:27,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 935 [2018-11-10 09:21:27,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 988 states and 1630 transitions. [2018-11-10 09:21:27,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:27,681 INFO L705 BuchiCegarLoop]: Abstraction has 988 states and 1630 transitions. [2018-11-10 09:21:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states and 1630 transitions. [2018-11-10 09:21:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 761. [2018-11-10 09:21:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-10 09:21:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1265 transitions. [2018-11-10 09:21:27,729 INFO L728 BuchiCegarLoop]: Abstraction has 761 states and 1265 transitions. [2018-11-10 09:21:27,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:27,733 INFO L87 Difference]: Start difference. First operand 761 states and 1265 transitions. Second operand 3 states. [2018-11-10 09:21:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:27,819 INFO L93 Difference]: Finished difference Result 956 states and 1515 transitions. [2018-11-10 09:21:27,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:27,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 956 states and 1515 transitions. [2018-11-10 09:21:27,826 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 843 [2018-11-10 09:21:27,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 956 states to 902 states and 1461 transitions. [2018-11-10 09:21:27,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 885 [2018-11-10 09:21:27,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 885 [2018-11-10 09:21:27,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 902 states and 1461 transitions. [2018-11-10 09:21:27,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:27,833 INFO L705 BuchiCegarLoop]: Abstraction has 902 states and 1461 transitions. [2018-11-10 09:21:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states and 1461 transitions. [2018-11-10 09:21:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 443. [2018-11-10 09:21:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-10 09:21:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 725 transitions. [2018-11-10 09:21:27,843 INFO L728 BuchiCegarLoop]: Abstraction has 443 states and 725 transitions. [2018-11-10 09:21:27,843 INFO L608 BuchiCegarLoop]: Abstraction has 443 states and 725 transitions. [2018-11-10 09:21:27,843 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:21:27,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 443 states and 725 transitions. [2018-11-10 09:21:27,845 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 395 [2018-11-10 09:21:27,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:27,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:27,846 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:27,846 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:27,846 INFO L793 eck$LassoCheckResult]: Stem: 4680#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 4630#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 4631#L116-3 assume true; 4733#L116-1 assume !(add_history_type_~var~0 < 3); 4730#L116-4 add_history_type_#res := 1; 4677#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 4528#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 4529#L116-8 [2018-11-10 09:21:27,846 INFO L795 eck$LassoCheckResult]: Loop: 4529#L116-8 assume true; 4736#L116-6 assume !!(add_history_type_~var~0 < 3); 4738#L117-2 assume !(add_history_type_~history_id == 0); 4623#L123-2 assume !(add_history_type_~history_id == 1); 4624#L129-2 assume !(add_history_type_~history_id == 2); 4573#L135-3 assume !(add_history_type_~history_id == 3); 4349#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 4529#L116-8 [2018-11-10 09:21:27,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1806157978, now seen corresponding path program 1 times [2018-11-10 09:21:27,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:27,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:27,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:27,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:27,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:27,877 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-10 09:21:27,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:27,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:27,877 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:27,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1633825204, now seen corresponding path program 1 times [2018-11-10 09:21:27,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:27,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:27,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:27,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:27,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:27,943 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:27,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:27,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:27,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:27,943 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:27,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:27,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:27,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:27,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-10 09:21:27,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:27,944 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:27,945 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-10 09:21:27,949 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-10 09:21:27,950 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-10 09:21:27,952 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-10 09:21:27,954 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-10 09:21:27,955 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-10 09:21:27,957 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-10 09:21:27,959 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-10 09:21:27,962 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-10 09:21:27,964 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-10 09:21:27,965 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-10 09:21:28,089 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:28,089 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:28,097 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:28,097 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:28,142 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:28,142 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_3=3} Honda state: {v_rep#funAddr~voter.offset_3=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:28,152 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:28,153 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_3=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,170 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:28,186 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:28,186 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_3=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:28,208 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:28,208 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_3=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:28,214 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:28,214 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_3=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:28,233 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:28,233 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_3=-1} Honda state: {v_rep#funAddr~voter.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,248 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:28,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:28,287 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:28,288 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:28,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:28,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:28,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:28,288 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:28,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:28,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:28,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-10 09:21:28,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:28,289 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:28,290 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-10 09:21:28,291 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-10 09:21:28,294 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-10 09:21:28,295 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-10 09:21:28,296 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-10 09:21:28,299 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-10 09:21:28,301 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-10 09:21:28,303 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-10 09:21:28,304 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-10 09:21:28,306 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-10 09:21:28,318 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-10 09:21:28,419 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:28,420 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:28,420 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-10 09:21:28,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:28,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:28,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:28,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:28,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:28,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:28,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:28,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:28,422 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-10 09:21:28,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:28,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:28,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:28,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:28,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:28,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:28,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:28,428 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-10 09:21:28,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:28,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:28,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:28,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:28,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:28,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:28,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:28,432 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-10 09:21:28,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:28,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:28,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:28,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:28,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:28,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:28,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:28,437 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-10 09:21:28,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:28,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:28,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:28,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:28,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:28,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:28,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:28,440 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:28,442 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:28,442 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:28,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:28,442 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:28,442 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:28,443 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 5 Supporting invariants [] [2018-11-10 09:21:28,443 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:28,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:28,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:28,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:28,487 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-10 09:21:28,487 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-10 09:21:28,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 443 states and 725 transitions. cyclomatic complexity: 290 Second operand 4 states. [2018-11-10 09:21:28,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 443 states and 725 transitions. cyclomatic complexity: 290. Second operand 4 states. Result 1631 states and 2640 transitions. Complement of second has 7 states. [2018-11-10 09:21:28,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1217 transitions. [2018-11-10 09:21:28,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1217 transitions. Stem has 7 letters. Loop has 7 letters. [2018-11-10 09:21:28,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:28,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1217 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-10 09:21:28,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:28,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1217 transitions. Stem has 7 letters. Loop has 14 letters. [2018-11-10 09:21:28,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:28,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1631 states and 2640 transitions. [2018-11-10 09:21:28,563 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1010 [2018-11-10 09:21:28,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1631 states to 1174 states and 1900 transitions. [2018-11-10 09:21:28,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1098 [2018-11-10 09:21:28,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1100 [2018-11-10 09:21:28,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1174 states and 1900 transitions. [2018-11-10 09:21:28,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:28,571 INFO L705 BuchiCegarLoop]: Abstraction has 1174 states and 1900 transitions. [2018-11-10 09:21:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states and 1900 transitions. [2018-11-10 09:21:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 497. [2018-11-10 09:21:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-11-10 09:21:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 811 transitions. [2018-11-10 09:21:28,581 INFO L728 BuchiCegarLoop]: Abstraction has 497 states and 811 transitions. [2018-11-10 09:21:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:28,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:28,581 INFO L87 Difference]: Start difference. First operand 497 states and 811 transitions. Second operand 3 states. [2018-11-10 09:21:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:28,638 INFO L93 Difference]: Finished difference Result 973 states and 1589 transitions. [2018-11-10 09:21:28,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:28,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 973 states and 1589 transitions. [2018-11-10 09:21:28,644 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 562 [2018-11-10 09:21:28,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 973 states to 973 states and 1589 transitions. [2018-11-10 09:21:28,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 830 [2018-11-10 09:21:28,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 830 [2018-11-10 09:21:28,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 973 states and 1589 transitions. [2018-11-10 09:21:28,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:28,650 INFO L705 BuchiCegarLoop]: Abstraction has 973 states and 1589 transitions. [2018-11-10 09:21:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states and 1589 transitions. [2018-11-10 09:21:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 503. [2018-11-10 09:21:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-10 09:21:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 817 transitions. [2018-11-10 09:21:28,659 INFO L728 BuchiCegarLoop]: Abstraction has 503 states and 817 transitions. [2018-11-10 09:21:28,659 INFO L608 BuchiCegarLoop]: Abstraction has 503 states and 817 transitions. [2018-11-10 09:21:28,659 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:21:28,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 503 states and 817 transitions. [2018-11-10 09:21:28,661 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 338 [2018-11-10 09:21:28,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:28,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:28,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:28,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:28,663 INFO L793 eck$LassoCheckResult]: Stem: 8334#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 8276#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 8277#L116-3 assume true; 8398#L116-1 assume !!(add_history_type_~var~0 < 3); 8375#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 8013#L171 assume read_history_bool_~history_id == 0; 8014#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 8020#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8142#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8330#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 8166#L255 assume init_~tmp~1 == 0;init_#res := 0; 8033#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 7997#L554-3 [2018-11-10 09:21:28,663 INFO L795 eck$LassoCheckResult]: Loop: 7997#L554-3 assume true; 7992#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 7993#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8029#L236-2 assume { :end_inline_write_history_bool } true; 8137#L390 assume ~gate1Failed~0 % 256 != 0; 8027#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 8028#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 8035#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8010#L226-2 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8011#L236-5 assume { :end_inline_write_history_bool } true; 8094#L421 assume ~gate2Failed~0 % 256 != 0; 8001#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 7984#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 7985#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8336#L226-4 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8083#L236-8 assume { :end_inline_write_history_bool } true; 8134#L452 assume ~gate3Failed~0 % 256 != 0; 8172#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 8156#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 8157#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 8170#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 7995#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 7998#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 8248#L211-2 assume { :end_inline_write_history_int8 } true; 8249#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 8289#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 8224#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 8225#L171-12 assume read_history_bool_~history_id == 0; 8368#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 8063#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 8110#L307 assume !(check_~tmp___3~0 % 256 == 0); 8202#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 8285#L151-7 assume read_history_int8_~history_id == 3; 8300#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 8186#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 8150#L346 assume !(check_~tmp___10~0 > -2); 8135#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 8136#L151-9 assume read_history_int8_~history_id == 3; 8295#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 8182#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 8217#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 8149#L366-1 check_#res := 1; 8002#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 8003#L579-72 assume !(assert_~arg % 256 == 0); 8233#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 7997#L554-3 [2018-11-10 09:21:28,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1149248423, now seen corresponding path program 1 times [2018-11-10 09:21:28,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:28,701 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-10 09:21:28,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:28,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:21:28,701 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:28,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2062420512, now seen corresponding path program 1 times [2018-11-10 09:21:28,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:28,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:28,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:28,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:28,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:28,725 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-10 09:21:28,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:28,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:28,726 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:28,726 INFO L87 Difference]: Start difference. First operand 503 states and 817 transitions. cyclomatic complexity: 322 Second operand 3 states. [2018-11-10 09:21:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:28,738 INFO L93 Difference]: Finished difference Result 504 states and 817 transitions. [2018-11-10 09:21:28,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:28,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 504 states and 817 transitions. [2018-11-10 09:21:28,741 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 338 [2018-11-10 09:21:28,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 504 states to 503 states and 813 transitions. [2018-11-10 09:21:28,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 429 [2018-11-10 09:21:28,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 429 [2018-11-10 09:21:28,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 503 states and 813 transitions. [2018-11-10 09:21:28,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:28,745 INFO L705 BuchiCegarLoop]: Abstraction has 503 states and 813 transitions. [2018-11-10 09:21:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states and 813 transitions. [2018-11-10 09:21:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2018-11-10 09:21:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-10 09:21:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 813 transitions. [2018-11-10 09:21:28,752 INFO L728 BuchiCegarLoop]: Abstraction has 503 states and 813 transitions. [2018-11-10 09:21:28,752 INFO L608 BuchiCegarLoop]: Abstraction has 503 states and 813 transitions. [2018-11-10 09:21:28,752 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:21:28,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 503 states and 813 transitions. [2018-11-10 09:21:28,754 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 338 [2018-11-10 09:21:28,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:28,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:28,755 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] [2018-11-10 09:21:28,755 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:28,755 INFO L793 eck$LassoCheckResult]: Stem: 9348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 9293#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9294#L116-3 assume true; 9410#L116-1 assume !!(add_history_type_~var~0 < 3); 9389#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 9028#L171 assume read_history_bool_~history_id == 0; 9029#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 9035#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 9157#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 9344#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 9181#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9182#L116-8 assume true; 9415#L116-6 assume !!(add_history_type_~var~0 < 3); 9419#L117-2 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 9376#L171-3 assume read_history_bool_~history_id == 0; 9379#L172-3 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 9115#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 9119#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8980#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 9046#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9047#L116-13 assume true; 9400#L116-11 assume !!(add_history_type_~var~0 < 3); 9401#L117-4 [2018-11-10 09:21:28,756 INFO L795 eck$LassoCheckResult]: Loop: 9401#L117-4 assume !(add_history_type_~history_id == 0); 9277#L123-4 assume !(add_history_type_~history_id == 1); 9278#L129-4 assume !(add_history_type_~history_id == 2); 9226#L135-6 assume !(add_history_type_~history_id == 3); 8971#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 9434#L116-13 assume true; 9433#L116-11 assume !!(add_history_type_~var~0 < 3); 9401#L117-4 [2018-11-10 09:21:28,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1206696970, now seen corresponding path program 1 times [2018-11-10 09:21:28,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:28,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:28,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:28,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:28,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:28,798 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-10 09:21:28,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:28,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:28,798 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:28,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1214143545, now seen corresponding path program 1 times [2018-11-10 09:21:28,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:28,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:28,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:28,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:28,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:28,820 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:28,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:28,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:28,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:28,820 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:28,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:28,821 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:28,821 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-10 09:21:28,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:28,821 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:28,822 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-10 09:21:28,828 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-10 09:21:28,830 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-10 09:21:28,831 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-10 09:21:28,833 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-10 09:21:28,834 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-10 09:21:28,837 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-10 09:21:28,842 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-10 09:21:28,844 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-10 09:21:28,845 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-10 09:21:28,847 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-10 09:21:28,955 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:28,955 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:28,958 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:28,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:28,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,046 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:29,048 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:29,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:29,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:29,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:29,048 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:29,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:29,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:29,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-10 09:21:29,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:29,048 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:29,049 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-10 09:21:29,054 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-10 09:21:29,057 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-10 09:21:29,059 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-10 09:21:29,060 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-10 09:21:29,061 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-10 09:21:29,063 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-10 09:21:29,065 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-10 09:21:29,070 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-10 09:21:29,072 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-10 09:21:29,075 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-10 09:21:29,156 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:29,156 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:29,156 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-10 09:21:29,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:29,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:29,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:29,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:29,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:29,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:29,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:29,160 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-10 09:21:29,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:29,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:29,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:29,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:29,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:29,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:29,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:29,163 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:29,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:29,169 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:29,169 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:29,170 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:29,170 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:29,170 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 3 Supporting invariants [] [2018-11-10 09:21:29,170 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:29,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:29,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:29,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:29,233 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-10 09:21:29,234 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-10 09:21:29,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 503 states and 813 transitions. cyclomatic complexity: 318 Second operand 4 states. [2018-11-10 09:21:29,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 503 states and 813 transitions. cyclomatic complexity: 318. Second operand 4 states. Result 566 states and 917 transitions. Complement of second has 7 states. [2018-11-10 09:21:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2018-11-10 09:21:29,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 22 letters. Loop has 7 letters. [2018-11-10 09:21:29,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:29,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 29 letters. Loop has 7 letters. [2018-11-10 09:21:29,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:29,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 22 letters. Loop has 14 letters. [2018-11-10 09:21:29,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:29,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 566 states and 917 transitions. [2018-11-10 09:21:29,285 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 281 [2018-11-10 09:21:29,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 566 states to 561 states and 908 transitions. [2018-11-10 09:21:29,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2018-11-10 09:21:29,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 430 [2018-11-10 09:21:29,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 908 transitions. [2018-11-10 09:21:29,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:29,289 INFO L705 BuchiCegarLoop]: Abstraction has 561 states and 908 transitions. [2018-11-10 09:21:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 908 transitions. [2018-11-10 09:21:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 556. [2018-11-10 09:21:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-11-10 09:21:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 903 transitions. [2018-11-10 09:21:29,296 INFO L728 BuchiCegarLoop]: Abstraction has 556 states and 903 transitions. [2018-11-10 09:21:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:21:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:21:29,297 INFO L87 Difference]: Start difference. First operand 556 states and 903 transitions. Second operand 4 states. [2018-11-10 09:21:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:29,353 INFO L93 Difference]: Finished difference Result 789 states and 1272 transitions. [2018-11-10 09:21:29,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:21:29,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 789 states and 1272 transitions. [2018-11-10 09:21:29,358 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 505 [2018-11-10 09:21:29,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 789 states to 772 states and 1245 transitions. [2018-11-10 09:21:29,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 641 [2018-11-10 09:21:29,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 641 [2018-11-10 09:21:29,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 772 states and 1245 transitions. [2018-11-10 09:21:29,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:29,362 INFO L705 BuchiCegarLoop]: Abstraction has 772 states and 1245 transitions. [2018-11-10 09:21:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states and 1245 transitions. [2018-11-10 09:21:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 541. [2018-11-10 09:21:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-11-10 09:21:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 877 transitions. [2018-11-10 09:21:29,369 INFO L728 BuchiCegarLoop]: Abstraction has 541 states and 877 transitions. [2018-11-10 09:21:29,370 INFO L608 BuchiCegarLoop]: Abstraction has 541 states and 877 transitions. [2018-11-10 09:21:29,370 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:21:29,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 541 states and 877 transitions. [2018-11-10 09:21:29,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 281 [2018-11-10 09:21:29,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:29,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:29,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 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-10 09:21:29,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:29,373 INFO L793 eck$LassoCheckResult]: Stem: 11904#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 11845#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11846#L116-3 assume true; 11971#L116-1 assume !!(add_history_type_~var~0 < 3); 11954#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11563#L171 assume read_history_bool_~history_id == 0; 11564#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 11567#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11700#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 11767#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 11768#L116-3 assume true; 11972#L116-1 assume !(add_history_type_~var~0 < 3); 11968#L116-4 add_history_type_#res := 1; 11902#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 11725#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11726#L116-8 assume true; 11976#L116-6 assume !!(add_history_type_~var~0 < 3); 11981#L117-2 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11940#L171-3 assume read_history_bool_~history_id == 0; 11943#L172-3 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 11650#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11654#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11509#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 11575#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11576#L116-13 assume true; 11992#L116-11 assume !!(add_history_type_~var~0 < 3); 11931#L117-4 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11933#L171-6 assume read_history_bool_~history_id == 0; 11927#L172-6 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 11615#L203-6 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11619#L119-2 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11499#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 11843#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11844#L116-18 assume true; 11966#L116-16 assume !!(add_history_type_~var~0 < 3); 11967#L117-6 [2018-11-10 09:21:29,373 INFO L795 eck$LassoCheckResult]: Loop: 11967#L117-6 assume !(add_history_type_~history_id == 0); 11821#L123-6 assume !(add_history_type_~history_id == 1); 11822#L129-6 assume !(add_history_type_~history_id == 2); 11556#L135-9 assume !(add_history_type_~history_id == 3); 11489#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 11995#L116-18 assume true; 11994#L116-16 assume !!(add_history_type_~var~0 < 3); 11967#L117-6 [2018-11-10 09:21:29,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash 986945626, now seen corresponding path program 1 times [2018-11-10 09:21:29,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:29,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:29,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:29,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:29,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:21:29,404 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:29,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:29,404 INFO L82 PathProgramCache]: Analyzing trace with hash 682336474, now seen corresponding path program 1 times [2018-11-10 09:21:29,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:29,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:29,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:29,427 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:29,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:29,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:29,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:29,428 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:29,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:29,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:29,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-10 09:21:29,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:29,428 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:29,430 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-10 09:21:29,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-10 09:21:29,436 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-10 09:21:29,437 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-10 09:21:29,440 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-10 09:21:29,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-10 09:21:29,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-10 09:21:29,456 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-10 09:21:29,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-10 09:21:29,461 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-10 09:21:29,466 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-10 09:21:29,590 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:29,590 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,598 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,605 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,605 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_7=-1} Honda state: {v_rep#funAddr~voter.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,642 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,642 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_7=3} Honda state: {v_rep#funAddr~voter.offset_7=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,645 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,647 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,647 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,681 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,681 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_7=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,684 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,686 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,687 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,718 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,718 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_7=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,721 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,721 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,724 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,724 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=-8} Honda state: {ULTIMATE.start_add_history_type_~history_id=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,741 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,743 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,743 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,759 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,761 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:29,761 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:29,777 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:29,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:29,863 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:29,864 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:29,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:29,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:29,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:29,864 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:29,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:29,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:29,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:29,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-10 09:21:29,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:29,865 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:29,866 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-10 09:21:29,873 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-10 09:21:29,874 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-10 09:21:29,876 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-10 09:21:29,880 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-10 09:21:29,882 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-10 09:21:29,883 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-10 09:21:29,885 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-10 09:21:29,886 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-10 09:21:29,889 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-10 09:21:29,891 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-10 09:21:30,001 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:30,001 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:30,002 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-10 09:21:30,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:30,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:30,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:30,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:30,006 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-10 09:21:30,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:30,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:30,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:30,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:30,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:30,008 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-10 09:21:30,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:30,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:30,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:30,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:30,012 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-10 09:21:30,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:30,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,013 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 09:21:30,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,013 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 09:21:30,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:30,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:30,014 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-10 09:21:30,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:30,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:30,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:30,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:30,018 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-10 09:21:30,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:30,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:30,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:30,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:30,021 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-10 09:21:30,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:30,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:30,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:30,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:30,025 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-10 09:21:30,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:30,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:30,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:30,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:30,029 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-10 09:21:30,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:30,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:30,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:30,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:30,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:30,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:30,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:30,032 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:30,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:30,033 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:30,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:30,033 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:30,033 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:30,033 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 3 Supporting invariants [] [2018-11-10 09:21:30,034 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:30,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:30,123 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-10 09:21:30,123 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-10 09:21:30,124 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 877 transitions. cyclomatic complexity: 344 Second operand 4 states. [2018-11-10 09:21:30,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 877 transitions. cyclomatic complexity: 344. Second operand 4 states. Result 1279 states and 2069 transitions. Complement of second has 6 states. [2018-11-10 09:21:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1045 transitions. [2018-11-10 09:21:30,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1045 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 09:21:30,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:30,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1045 transitions. Stem has 42 letters. Loop has 7 letters. [2018-11-10 09:21:30,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:30,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1045 transitions. Stem has 35 letters. Loop has 14 letters. [2018-11-10 09:21:30,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:30,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 2069 transitions. [2018-11-10 09:21:30,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 448 [2018-11-10 09:21:30,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 824 states and 1334 transitions. [2018-11-10 09:21:30,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 634 [2018-11-10 09:21:30,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 636 [2018-11-10 09:21:30,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 824 states and 1334 transitions. [2018-11-10 09:21:30,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:30,172 INFO L705 BuchiCegarLoop]: Abstraction has 824 states and 1334 transitions. [2018-11-10 09:21:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states and 1334 transitions. [2018-11-10 09:21:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 594. [2018-11-10 09:21:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-10 09:21:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 967 transitions. [2018-11-10 09:21:30,182 INFO L728 BuchiCegarLoop]: Abstraction has 594 states and 967 transitions. [2018-11-10 09:21:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:21:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:21:30,182 INFO L87 Difference]: Start difference. First operand 594 states and 967 transitions. Second operand 5 states. [2018-11-10 09:21:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:30,267 INFO L93 Difference]: Finished difference Result 733 states and 1173 transitions. [2018-11-10 09:21:30,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:21:30,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 733 states and 1173 transitions. [2018-11-10 09:21:30,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 448 [2018-11-10 09:21:30,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 733 states to 733 states and 1173 transitions. [2018-11-10 09:21:30,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 596 [2018-11-10 09:21:30,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 596 [2018-11-10 09:21:30,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 733 states and 1173 transitions. [2018-11-10 09:21:30,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:30,276 INFO L705 BuchiCegarLoop]: Abstraction has 733 states and 1173 transitions. [2018-11-10 09:21:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states and 1173 transitions. [2018-11-10 09:21:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 502. [2018-11-10 09:21:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-11-10 09:21:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 805 transitions. [2018-11-10 09:21:30,283 INFO L728 BuchiCegarLoop]: Abstraction has 502 states and 805 transitions. [2018-11-10 09:21:30,283 INFO L608 BuchiCegarLoop]: Abstraction has 502 states and 805 transitions. [2018-11-10 09:21:30,283 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 09:21:30,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 502 states and 805 transitions. [2018-11-10 09:21:30,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 224 [2018-11-10 09:21:30,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:30,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:30,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,286 INFO L793 eck$LassoCheckResult]: Stem: 15038#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 14789#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14790#L116-3 assume true; 15186#L116-1 assume !!(add_history_type_~var~0 < 3); 15161#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 14995#L171 assume read_history_bool_~history_id == 0; 14996#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14768#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 14978#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 14979#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 15187#L116-3 assume true; 15188#L116-1 assume !(add_history_type_~var~0 < 3); 15182#L116-4 add_history_type_#res := 1; 15011#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 15012#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15146#L116-8 assume true; 15198#L116-6 assume !!(add_history_type_~var~0 < 3); 15139#L117-2 assume !(add_history_type_~history_id == 0); 15140#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15189#L171-4 assume read_history_bool_~history_id == 0; 15137#L172-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14806#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14846#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14817#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 15006#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15007#L116-13 assume true; 15171#L116-11 assume !!(add_history_type_~var~0 < 3); 15129#L117-4 assume !(add_history_type_~history_id == 0); 15130#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15206#L171-7 assume read_history_bool_~history_id == 0; 15119#L172-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14896#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14839#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14811#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 14775#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14776#L116-18 assume true; 15180#L116-16 assume !!(add_history_type_~var~0 < 3); 15112#L117-6 assume !(add_history_type_~history_id == 0); 15114#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15195#L171-10 assume read_history_bool_~history_id == 0; 15151#L172-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14876#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14831#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14801#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 15039#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 15009#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 14925#L554-3 [2018-11-10 09:21:30,286 INFO L795 eck$LassoCheckResult]: Loop: 14925#L554-3 assume true; 14913#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 14914#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15003#L236-2 assume { :end_inline_write_history_bool } true; 15101#L390 assume ~gate1Failed~0 % 256 != 0; 15001#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 15002#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 15008#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 14992#L226-2 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14993#L236-5 assume { :end_inline_write_history_bool } true; 15061#L421 assume ~gate2Failed~0 % 256 != 0; 14930#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 14871#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 14850#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15049#L226-4 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15041#L236-8 assume { :end_inline_write_history_bool } true; 15089#L452 assume ~gate3Failed~0 % 256 != 0; 15154#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 15121#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 15122#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 15153#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 14916#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 14926#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 15257#L211-2 assume { :end_inline_write_history_int8 } true; 14823#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 14824#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 15033#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15191#L171-12 assume read_history_bool_~history_id == 0; 15148#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14932#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 14797#L307 assume !(check_~tmp___3~0 % 256 == 0); 14798#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 14809#L151-7 assume read_history_int8_~history_id == 3; 14884#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 14886#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 14891#L346 assume !(check_~tmp___10~0 > -2); 15090#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 15091#L151-9 assume read_history_int8_~history_id == 3; 14872#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 14873#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 14879#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 14954#L366-1 check_#res := 1; 14944#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 14945#L579-72 assume !(assert_~arg % 256 == 0); 14988#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 14925#L554-3 [2018-11-10 09:21:30,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1672512711, now seen corresponding path program 1 times [2018-11-10 09:21:30,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:30,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:21:30,329 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:30,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2062420512, now seen corresponding path program 2 times [2018-11-10 09:21:30,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:30,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,370 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-10 09:21:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:30,371 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:30,371 INFO L87 Difference]: Start difference. First operand 502 states and 805 transitions. cyclomatic complexity: 308 Second operand 3 states. [2018-11-10 09:21:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:30,396 INFO L93 Difference]: Finished difference Result 515 states and 821 transitions. [2018-11-10 09:21:30,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:30,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 515 states and 821 transitions. [2018-11-10 09:21:30,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 235 [2018-11-10 09:21:30,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 515 states to 515 states and 821 transitions. [2018-11-10 09:21:30,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2018-11-10 09:21:30,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 378 [2018-11-10 09:21:30,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 515 states and 821 transitions. [2018-11-10 09:21:30,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:30,403 INFO L705 BuchiCegarLoop]: Abstraction has 515 states and 821 transitions. [2018-11-10 09:21:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 821 transitions. [2018-11-10 09:21:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 502. [2018-11-10 09:21:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-11-10 09:21:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 803 transitions. [2018-11-10 09:21:30,410 INFO L728 BuchiCegarLoop]: Abstraction has 502 states and 803 transitions. [2018-11-10 09:21:30,410 INFO L608 BuchiCegarLoop]: Abstraction has 502 states and 803 transitions. [2018-11-10 09:21:30,410 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 09:21:30,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 502 states and 803 transitions. [2018-11-10 09:21:30,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 224 [2018-11-10 09:21:30,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:30,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:30,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,414 INFO L793 eck$LassoCheckResult]: Stem: 16064#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 15815#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15816#L116-3 assume true; 16211#L116-1 assume !!(add_history_type_~var~0 < 3); 16187#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16020#L171 assume read_history_bool_~history_id == 0; 16021#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15794#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 16004#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 16005#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 16212#L116-3 assume true; 16213#L116-1 assume !(add_history_type_~var~0 < 3); 16207#L116-4 add_history_type_#res := 1; 16036#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 16037#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16172#L116-8 assume true; 16223#L116-6 assume !!(add_history_type_~var~0 < 3); 16165#L117-2 assume !(add_history_type_~history_id == 0); 16166#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16214#L171-4 assume read_history_bool_~history_id == 0; 16163#L172-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15832#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15872#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15843#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 16030#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16031#L116-13 assume true; 16197#L116-11 assume !!(add_history_type_~var~0 < 3); 16155#L117-4 assume !(add_history_type_~history_id == 0); 16156#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16231#L171-7 assume read_history_bool_~history_id == 0; 16144#L172-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15919#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15859#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15836#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 15801#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15802#L116-18 assume true; 16204#L116-16 assume !!(add_history_type_~var~0 < 3); 16138#L117-6 assume !(add_history_type_~history_id == 0); 16140#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16220#L171-10 assume read_history_bool_~history_id == 0; 16177#L172-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15898#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15851#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15824#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 16065#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 16033#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 15946#L554-3 [2018-11-10 09:21:30,414 INFO L795 eck$LassoCheckResult]: Loop: 15946#L554-3 assume true; 15937#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15938#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 16028#L236-2 assume { :end_inline_write_history_bool } true; 16125#L390 assume ~gate1Failed~0 % 256 != 0; 16026#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 16027#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 16034#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16018#L226-2 assume !(write_history_bool_~history_id == 0); 16019#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16039#L236-5 assume { :end_inline_write_history_bool } true; 16087#L421 assume ~gate2Failed~0 % 256 != 0; 15956#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 15901#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 15876#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16077#L226-4 assume !(write_history_bool_~history_id == 0); 16066#L231-4 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16067#L236-8 assume { :end_inline_write_history_bool } true; 16115#L452 assume ~gate3Failed~0 % 256 != 0; 16180#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 16147#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 16148#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 16179#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 15942#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 15952#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 16282#L211-2 assume { :end_inline_write_history_int8 } true; 15849#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 15850#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 16059#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16216#L171-12 assume read_history_bool_~history_id == 0; 16174#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15958#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 15828#L307 assume !(check_~tmp___3~0 % 256 == 0); 15829#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 15840#L151-7 assume read_history_int8_~history_id == 3; 15914#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 15916#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 15917#L346 assume !(check_~tmp___10~0 > -2); 16116#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 16117#L151-9 assume read_history_int8_~history_id == 3; 15902#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 15903#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 15905#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 15980#L366-1 check_#res := 1; 15970#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 15971#L579-72 assume !(assert_~arg % 256 == 0); 16014#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 15946#L554-3 [2018-11-10 09:21:30,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1672512711, now seen corresponding path program 2 times [2018-11-10 09:21:30,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:30,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:21:30,458 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:30,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1201618353, now seen corresponding path program 1 times [2018-11-10 09:21:30,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,477 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-10 09:21:30,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:30,477 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:30,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:21:30,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:21:30,478 INFO L87 Difference]: Start difference. First operand 502 states and 803 transitions. cyclomatic complexity: 306 Second operand 5 states. [2018-11-10 09:21:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:30,722 INFO L93 Difference]: Finished difference Result 1052 states and 1593 transitions. [2018-11-10 09:21:30,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:21:30,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1052 states and 1593 transitions. [2018-11-10 09:21:30,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 676 [2018-11-10 09:21:30,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1052 states to 1052 states and 1593 transitions. [2018-11-10 09:21:30,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 879 [2018-11-10 09:21:30,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 879 [2018-11-10 09:21:30,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1052 states and 1593 transitions. [2018-11-10 09:21:30,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:30,734 INFO L705 BuchiCegarLoop]: Abstraction has 1052 states and 1593 transitions. [2018-11-10 09:21:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states and 1593 transitions. [2018-11-10 09:21:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 470. [2018-11-10 09:21:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-11-10 09:21:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 723 transitions. [2018-11-10 09:21:30,745 INFO L728 BuchiCegarLoop]: Abstraction has 470 states and 723 transitions. [2018-11-10 09:21:30,745 INFO L608 BuchiCegarLoop]: Abstraction has 470 states and 723 transitions. [2018-11-10 09:21:30,745 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 09:21:30,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 470 states and 723 transitions. [2018-11-10 09:21:30,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 216 [2018-11-10 09:21:30,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:30,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:30,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,748 INFO L793 eck$LassoCheckResult]: Stem: 17632#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 17387#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17388#L116-3 assume true; 17751#L116-1 assume !!(add_history_type_~var~0 < 3); 17730#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17588#L171 assume read_history_bool_~history_id == 0; 17589#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 17366#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 17578#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 17579#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 17752#L116-3 assume true; 17753#L116-1 assume !(add_history_type_~var~0 < 3); 17747#L116-4 add_history_type_#res := 1; 17604#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 17605#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17721#L116-8 assume true; 17763#L116-6 assume !!(add_history_type_~var~0 < 3); 17715#L117-2 assume !(add_history_type_~history_id == 0); 17716#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17754#L171-4 assume !(read_history_bool_~history_id == 0); 17647#L181-4 assume read_history_bool_~history_id == 1; 17648#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 17548#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17434#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17407#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 17598#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17599#L116-13 assume true; 17738#L116-11 assume !!(add_history_type_~var~0 < 3); 17709#L117-4 assume !(add_history_type_~history_id == 0); 17710#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17771#L171-7 assume !(read_history_bool_~history_id == 0); 17676#L181-7 assume read_history_bool_~history_id == 1; 17677#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 17483#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17423#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17400#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 17373#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17374#L116-18 assume true; 17744#L116-16 assume !!(add_history_type_~var~0 < 3); 17694#L117-6 assume !(add_history_type_~history_id == 0); 17696#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17760#L171-10 assume !(read_history_bool_~history_id == 0); 17664#L181-10 assume read_history_bool_~history_id == 1; 17665#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 17462#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17421#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17392#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 17633#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 17601#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 17512#L554-3 [2018-11-10 09:21:30,756 INFO L795 eck$LassoCheckResult]: Loop: 17512#L554-3 assume true; 17503#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17504#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 17596#L236-2 assume { :end_inline_write_history_bool } true; 17685#L390 assume ~gate1Failed~0 % 256 != 0; 17594#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 17595#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 17602#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17586#L226-2 assume !(write_history_bool_~history_id == 0); 17587#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17607#L236-5 assume { :end_inline_write_history_bool } true; 17655#L421 assume ~gate2Failed~0 % 256 != 0; 17522#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 17465#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 17440#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17645#L226-4 assume !(write_history_bool_~history_id == 0); 17634#L231-4 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17635#L236-8 assume { :end_inline_write_history_bool } true; 17682#L452 assume ~gate3Failed~0 % 256 != 0; 17725#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 17701#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 17702#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 17724#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 17508#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 17518#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 17822#L211-2 assume { :end_inline_write_history_int8 } true; 17413#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 17414#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 17627#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17756#L171-12 assume read_history_bool_~history_id == 0; 17723#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 17524#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 17396#L307 assume !(check_~tmp___3~0 % 256 == 0); 17397#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 17404#L151-7 assume read_history_int8_~history_id == 3; 17478#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 17480#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 17481#L346 assume !(check_~tmp___10~0 > -2); 17683#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 17684#L151-9 assume read_history_int8_~history_id == 3; 17466#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 17467#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 17469#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 17546#L366-1 check_#res := 1; 17536#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17537#L579-72 assume !(assert_~arg % 256 == 0); 17582#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 17512#L554-3 [2018-11-10 09:21:30,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 1 times [2018-11-10 09:21:30,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:30,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:30,800 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:30,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1201618353, now seen corresponding path program 2 times [2018-11-10 09:21:30,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,830 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-10 09:21:30,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:30,830 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:30,831 INFO L87 Difference]: Start difference. First operand 470 states and 723 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-11-10 09:21:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:30,854 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2018-11-10 09:21:30,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:30,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 756 transitions. [2018-11-10 09:21:30,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2018-11-10 09:21:30,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 494 states and 756 transitions. [2018-11-10 09:21:30,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2018-11-10 09:21:30,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2018-11-10 09:21:30,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 756 transitions. [2018-11-10 09:21:30,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:30,860 INFO L705 BuchiCegarLoop]: Abstraction has 494 states and 756 transitions. [2018-11-10 09:21:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 756 transitions. [2018-11-10 09:21:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 470. [2018-11-10 09:21:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-11-10 09:21:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 722 transitions. [2018-11-10 09:21:30,865 INFO L728 BuchiCegarLoop]: Abstraction has 470 states and 722 transitions. [2018-11-10 09:21:30,866 INFO L608 BuchiCegarLoop]: Abstraction has 470 states and 722 transitions. [2018-11-10 09:21:30,866 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 09:21:30,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 470 states and 722 transitions. [2018-11-10 09:21:30,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 216 [2018-11-10 09:21:30,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:30,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:30,868 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,870 INFO L793 eck$LassoCheckResult]: Stem: 18604#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 18359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18360#L116-3 assume true; 18723#L116-1 assume !!(add_history_type_~var~0 < 3); 18702#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18560#L171 assume read_history_bool_~history_id == 0; 18561#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 18335#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 18544#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 18545#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 18724#L116-3 assume true; 18725#L116-1 assume !(add_history_type_~var~0 < 3); 18719#L116-4 add_history_type_#res := 1; 18575#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 18576#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18693#L116-8 assume true; 18735#L116-6 assume !!(add_history_type_~var~0 < 3); 18687#L117-2 assume !(add_history_type_~history_id == 0); 18688#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18726#L171-4 assume !(read_history_bool_~history_id == 0); 18619#L181-4 assume read_history_bool_~history_id == 1; 18620#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 18520#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18406#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18379#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 18570#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18571#L116-13 assume true; 18710#L116-11 assume !!(add_history_type_~var~0 < 3); 18681#L117-4 assume !(add_history_type_~history_id == 0); 18682#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18743#L171-7 assume !(read_history_bool_~history_id == 0); 18648#L181-7 assume read_history_bool_~history_id == 1; 18649#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 18455#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18401#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18372#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 18345#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18346#L116-18 assume true; 18716#L116-16 assume !!(add_history_type_~var~0 < 3); 18666#L117-6 assume !(add_history_type_~history_id == 0); 18667#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18732#L171-10 assume !(read_history_bool_~history_id == 0); 18636#L181-10 assume read_history_bool_~history_id == 1; 18637#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 18434#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18393#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18364#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 18605#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 18573#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 18484#L554-3 [2018-11-10 09:21:30,870 INFO L795 eck$LassoCheckResult]: Loop: 18484#L554-3 assume true; 18475#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18476#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 18568#L236-2 assume { :end_inline_write_history_bool } true; 18657#L390 assume ~gate1Failed~0 % 256 != 0; 18566#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 18567#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 18574#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18558#L226-2 assume !(write_history_bool_~history_id == 0); 18559#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 18579#L236-5 assume { :end_inline_write_history_bool } true; 18627#L421 assume ~gate2Failed~0 % 256 != 0; 18494#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 18437#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 18412#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18616#L226-4 assume !(write_history_bool_~history_id == 0); 18606#L231-4 assume !(write_history_bool_~history_id == 1); 18607#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 18617#L236-8 assume { :end_inline_write_history_bool } true; 18654#L452 assume ~gate3Failed~0 % 256 != 0; 18697#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 18673#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 18674#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 18696#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 18480#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 18490#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 18794#L211-2 assume { :end_inline_write_history_int8 } true; 18385#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 18386#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 18599#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18728#L171-12 assume read_history_bool_~history_id == 0; 18695#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 18496#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 18368#L307 assume !(check_~tmp___3~0 % 256 == 0); 18369#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 18376#L151-7 assume read_history_int8_~history_id == 3; 18450#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 18452#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 18453#L346 assume !(check_~tmp___10~0 > -2); 18655#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 18656#L151-9 assume read_history_int8_~history_id == 3; 18438#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 18439#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 18441#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 18518#L366-1 check_#res := 1; 18508#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 18509#L579-72 assume !(assert_~arg % 256 == 0); 18554#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 18484#L554-3 [2018-11-10 09:21:30,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 2 times [2018-11-10 09:21:30,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:30,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:30,895 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:30,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1491283154, now seen corresponding path program 1 times [2018-11-10 09:21:30,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,926 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-10 09:21:30,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:30,927 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:30,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:30,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:30,927 INFO L87 Difference]: Start difference. First operand 470 states and 722 transitions. cyclomatic complexity: 257 Second operand 3 states. [2018-11-10 09:21:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:30,954 INFO L93 Difference]: Finished difference Result 669 states and 1032 transitions. [2018-11-10 09:21:30,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:30,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 669 states and 1032 transitions. [2018-11-10 09:21:30,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 415 [2018-11-10 09:21:30,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 669 states to 669 states and 1032 transitions. [2018-11-10 09:21:30,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 544 [2018-11-10 09:21:30,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 544 [2018-11-10 09:21:30,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 669 states and 1032 transitions. [2018-11-10 09:21:30,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:30,960 INFO L705 BuchiCegarLoop]: Abstraction has 669 states and 1032 transitions. [2018-11-10 09:21:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states and 1032 transitions. [2018-11-10 09:21:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 520. [2018-11-10 09:21:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-10 09:21:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 794 transitions. [2018-11-10 09:21:30,967 INFO L728 BuchiCegarLoop]: Abstraction has 520 states and 794 transitions. [2018-11-10 09:21:30,967 INFO L608 BuchiCegarLoop]: Abstraction has 520 states and 794 transitions. [2018-11-10 09:21:30,967 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 09:21:30,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 794 transitions. [2018-11-10 09:21:30,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 266 [2018-11-10 09:21:30,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:30,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:30,970 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:30,970 INFO L793 eck$LassoCheckResult]: Stem: 19752#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 19506#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19507#L116-3 assume true; 19875#L116-1 assume !!(add_history_type_~var~0 < 3); 19852#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19708#L171 assume read_history_bool_~history_id == 0; 19709#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 19482#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 19692#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 19693#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 19876#L116-3 assume true; 19877#L116-1 assume !(add_history_type_~var~0 < 3); 19871#L116-4 add_history_type_#res := 1; 19724#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 19725#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19843#L116-8 assume true; 19887#L116-6 assume !!(add_history_type_~var~0 < 3); 19837#L117-2 assume !(add_history_type_~history_id == 0); 19838#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19878#L171-4 assume !(read_history_bool_~history_id == 0); 19767#L181-4 assume read_history_bool_~history_id == 1; 19768#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 19668#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19553#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19526#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 19718#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19719#L116-13 assume true; 19865#L116-11 assume !!(add_history_type_~var~0 < 3); 19831#L117-4 assume !(add_history_type_~history_id == 0); 19832#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19896#L171-7 assume !(read_history_bool_~history_id == 0); 19797#L181-7 assume read_history_bool_~history_id == 1; 19798#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 19605#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19548#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19519#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 19492#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19493#L116-18 assume true; 19868#L116-16 assume !!(add_history_type_~var~0 < 3); 19815#L117-6 assume !(add_history_type_~history_id == 0); 19816#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19884#L171-10 assume !(read_history_bool_~history_id == 0); 19785#L181-10 assume read_history_bool_~history_id == 1; 19786#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 19581#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19540#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19511#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 19753#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 19721#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 19631#L554-3 [2018-11-10 09:21:30,970 INFO L795 eck$LassoCheckResult]: Loop: 19631#L554-3 assume true; 19622#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 19623#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 19716#L236-2 assume { :end_inline_write_history_bool } true; 19806#L390 assume ~gate1Failed~0 % 256 != 0; 19714#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 19715#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 19722#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 20000#L226-2 assume !(write_history_bool_~history_id == 0); 19998#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 19775#L236-5 assume { :end_inline_write_history_bool } true; 19776#L421 assume ~gate2Failed~0 % 256 != 0; 19641#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 19584#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 19559#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 19764#L226-4 assume !(write_history_bool_~history_id == 0); 19754#L231-4 assume !(write_history_bool_~history_id == 1); 19755#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 19765#L236-8 assume { :end_inline_write_history_bool } true; 19803#L452 assume ~gate3Failed~0 % 256 != 0; 19847#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 19823#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 19824#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 19968#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 19965#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 19963#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 19961#L211-2 assume { :end_inline_write_history_int8 } true; 19532#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 19533#L294 assume !(~gate1Failed~0 % 256 == 0); 19746#L297 assume ~gate2Failed~0 % 256 == 0;check_~tmp~2 := 1; 19747#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19880#L171-12 assume read_history_bool_~history_id == 0; 19845#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 19643#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 19515#L307 assume !(check_~tmp___3~0 % 256 == 0); 19516#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 19523#L151-7 assume read_history_int8_~history_id == 3; 19597#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 19599#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 19600#L346 assume !(check_~tmp___10~0 > -2); 19804#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 19805#L151-9 assume read_history_int8_~history_id == 3; 19585#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 19586#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 19588#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 19665#L366-1 check_#res := 1; 19655#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 19656#L579-72 assume !(assert_~arg % 256 == 0); 19702#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 19631#L554-3 [2018-11-10 09:21:30,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 3 times [2018-11-10 09:21:30,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:30,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:30,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:30,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:30,996 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:30,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:30,996 INFO L82 PathProgramCache]: Analyzing trace with hash 661943605, now seen corresponding path program 1 times [2018-11-10 09:21:30,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:30,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:30,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,019 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-10 09:21:31,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,019 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:31,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:31,020 INFO L87 Difference]: Start difference. First operand 520 states and 794 transitions. cyclomatic complexity: 279 Second operand 3 states. [2018-11-10 09:21:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:31,049 INFO L93 Difference]: Finished difference Result 755 states and 1157 transitions. [2018-11-10 09:21:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:31,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 1157 transitions. [2018-11-10 09:21:31,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 501 [2018-11-10 09:21:31,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 755 states and 1157 transitions. [2018-11-10 09:21:31,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 630 [2018-11-10 09:21:31,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 630 [2018-11-10 09:21:31,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 755 states and 1157 transitions. [2018-11-10 09:21:31,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:31,057 INFO L705 BuchiCegarLoop]: Abstraction has 755 states and 1157 transitions. [2018-11-10 09:21:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states and 1157 transitions. [2018-11-10 09:21:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 589. [2018-11-10 09:21:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-11-10 09:21:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 894 transitions. [2018-11-10 09:21:31,065 INFO L728 BuchiCegarLoop]: Abstraction has 589 states and 894 transitions. [2018-11-10 09:21:31,065 INFO L608 BuchiCegarLoop]: Abstraction has 589 states and 894 transitions. [2018-11-10 09:21:31,065 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 09:21:31,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 589 states and 894 transitions. [2018-11-10 09:21:31,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 335 [2018-11-10 09:21:31,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:31,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:31,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,068 INFO L793 eck$LassoCheckResult]: Stem: 21034#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 20789#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 20790#L116-3 assume true; 21156#L116-1 assume !!(add_history_type_~var~0 < 3); 21132#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 20991#L171 assume read_history_bool_~history_id == 0; 20992#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 20768#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 20975#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 20976#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 21157#L116-3 assume true; 21158#L116-1 assume !(add_history_type_~var~0 < 3); 21152#L116-4 add_history_type_#res := 1; 21007#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 21008#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21123#L116-8 assume true; 21169#L116-6 assume !!(add_history_type_~var~0 < 3); 21117#L117-2 assume !(add_history_type_~history_id == 0); 21118#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21159#L171-4 assume !(read_history_bool_~history_id == 0); 21049#L181-4 assume read_history_bool_~history_id == 1; 21050#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 20953#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 20836#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 20809#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 21002#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21003#L116-13 assume true; 21145#L116-11 assume !!(add_history_type_~var~0 < 3); 21111#L117-4 assume !(add_history_type_~history_id == 0); 21112#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21177#L171-7 assume !(read_history_bool_~history_id == 0); 21078#L181-7 assume read_history_bool_~history_id == 1; 21079#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 20889#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 20831#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 20803#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 20775#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 20776#L116-18 assume true; 21150#L116-16 assume !!(add_history_type_~var~0 < 3); 21096#L117-6 assume !(add_history_type_~history_id == 0); 21097#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21166#L171-10 assume !(read_history_bool_~history_id == 0); 21066#L181-10 assume read_history_bool_~history_id == 1; 21067#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 20867#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 20823#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 20794#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 21035#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 21005#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 20917#L554-3 [2018-11-10 09:21:31,068 INFO L795 eck$LassoCheckResult]: Loop: 20917#L554-3 assume true; 20908#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 20909#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 20999#L236-2 assume { :end_inline_write_history_bool } true; 21087#L390 assume ~gate1Failed~0 % 256 != 0; 20997#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 20998#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 21004#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 20989#L226-2 assume !(write_history_bool_~history_id == 0); 20990#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 21012#L236-5 assume { :end_inline_write_history_bool } true; 21057#L421 assume ~gate2Failed~0 % 256 != 0; 21217#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 21352#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 21351#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21350#L226-4 assume !(write_history_bool_~history_id == 0); 21349#L231-4 assume !(write_history_bool_~history_id == 1); 21345#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 21343#L236-8 assume { :end_inline_write_history_bool } true; 21336#L452 assume ~gate3Failed~0 % 256 != 0; 21331#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 21326#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 21322#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 21126#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 20911#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 20922#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 21231#L211-2 assume { :end_inline_write_history_int8 } true; 20815#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 20816#L294 assume !(~gate1Failed~0 % 256 == 0); 21029#L297 assume !(~gate2Failed~0 % 256 == 0); 21030#L300 assume ~gate3Failed~0 % 256 == 0;check_~tmp~2 := 1; 21214#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21162#L171-12 assume read_history_bool_~history_id == 0; 21125#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 20930#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 20798#L307 assume !(check_~tmp___3~0 % 256 == 0); 20799#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 20801#L151-7 assume read_history_int8_~history_id == 3; 20877#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 20879#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 20884#L346 assume !(check_~tmp___10~0 > -2); 21085#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 21086#L151-9 assume read_history_int8_~history_id == 3; 20863#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 20864#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 20872#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 20949#L366-1 check_#res := 1; 20939#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 20940#L579-72 assume !(assert_~arg % 256 == 0); 20985#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 20917#L554-3 [2018-11-10 09:21:31,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 4 times [2018-11-10 09:21:31,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:31,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:31,112 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:31,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1321899763, now seen corresponding path program 1 times [2018-11-10 09:21:31,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:31,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,139 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-10 09:21:31,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,139 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:21:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:21:31,140 INFO L87 Difference]: Start difference. First operand 589 states and 894 transitions. cyclomatic complexity: 310 Second operand 4 states. [2018-11-10 09:21:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:31,173 INFO L93 Difference]: Finished difference Result 931 states and 1410 transitions. [2018-11-10 09:21:31,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:21:31,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 931 states and 1410 transitions. [2018-11-10 09:21:31,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 670 [2018-11-10 09:21:31,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 931 states to 895 states and 1356 transitions. [2018-11-10 09:21:31,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 770 [2018-11-10 09:21:31,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 770 [2018-11-10 09:21:31,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 895 states and 1356 transitions. [2018-11-10 09:21:31,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:31,182 INFO L705 BuchiCegarLoop]: Abstraction has 895 states and 1356 transitions. [2018-11-10 09:21:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states and 1356 transitions. [2018-11-10 09:21:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 555. [2018-11-10 09:21:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-11-10 09:21:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 841 transitions. [2018-11-10 09:21:31,190 INFO L728 BuchiCegarLoop]: Abstraction has 555 states and 841 transitions. [2018-11-10 09:21:31,190 INFO L608 BuchiCegarLoop]: Abstraction has 555 states and 841 transitions. [2018-11-10 09:21:31,190 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 09:21:31,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 555 states and 841 transitions. [2018-11-10 09:21:31,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 335 [2018-11-10 09:21:31,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:31,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:31,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,193 INFO L793 eck$LassoCheckResult]: Stem: 22547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 22319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22320#L116-3 assume true; 22656#L116-1 assume !!(add_history_type_~var~0 < 3); 22635#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22504#L171 assume read_history_bool_~history_id == 0; 22505#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 22295#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 22492#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 22493#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 22657#L116-3 assume true; 22658#L116-1 assume !(add_history_type_~var~0 < 3); 22653#L116-4 add_history_type_#res := 1; 22519#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 22520#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22627#L116-8 assume true; 22666#L116-6 assume !!(add_history_type_~var~0 < 3); 22623#L117-2 assume !(add_history_type_~history_id == 0); 22624#L123-2 assume !(add_history_type_~history_id == 1); 22716#L129-2 assume !(add_history_type_~history_id == 2); 22690#L135-3 assume !(add_history_type_~history_id == 3); 22339#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 22667#L116-8 assume true; 22668#L116-6 assume !(add_history_type_~var~0 < 3); 22663#L116-9 add_history_type_#res := 1; 22551#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 22514#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22515#L116-13 assume true; 22732#L116-11 assume !!(add_history_type_~var~0 < 3); 22618#L117-4 assume !(add_history_type_~history_id == 0); 22619#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22674#L171-7 assume !(read_history_bool_~history_id == 0); 22586#L181-7 assume read_history_bool_~history_id == 1; 22587#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 22407#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22353#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22332#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 22305#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22306#L116-18 assume true; 22650#L116-16 assume !!(add_history_type_~var~0 < 3); 22604#L117-6 assume !(add_history_type_~history_id == 0); 22605#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22664#L171-10 assume !(read_history_bool_~history_id == 0); 22574#L181-10 assume read_history_bool_~history_id == 1; 22575#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 22385#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22348#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22324#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 22548#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 22517#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 22434#L554-3 [2018-11-10 09:21:31,193 INFO L795 eck$LassoCheckResult]: Loop: 22434#L554-3 assume true; 22425#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22426#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 22512#L236-2 assume { :end_inline_write_history_bool } true; 22595#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 22563#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 22509#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 22516#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 22654#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 22609#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22502#L226-2 assume !(write_history_bool_~history_id == 0); 22503#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 22523#L236-5 assume { :end_inline_write_history_bool } true; 22565#L421 assume ~gate2Failed~0 % 256 != 0; 22711#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 22848#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 22847#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22846#L226-4 assume !(write_history_bool_~history_id == 0); 22845#L231-4 assume !(write_history_bool_~history_id == 1); 22842#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 22839#L236-8 assume { :end_inline_write_history_bool } true; 22836#L452 assume ~gate3Failed~0 % 256 != 0; 22834#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 22833#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 22831#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 22824#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 22820#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 22818#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 22816#L211-2 assume { :end_inline_write_history_int8 } true; 22815#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 22733#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 22708#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22660#L171-12 assume read_history_bool_~history_id == 0; 22629#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 22446#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 22328#L307 assume !(check_~tmp___3~0 % 256 == 0); 22329#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 22336#L151-7 assume read_history_int8_~history_id == 3; 22402#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 22404#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 22405#L346 assume !(check_~tmp___10~0 > -2); 22593#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 22594#L151-9 assume read_history_int8_~history_id == 3; 22390#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 22391#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 22393#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 22468#L366-1 check_#res := 1; 22458#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 22459#L579-72 assume !(assert_~arg % 256 == 0); 22498#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 22434#L554-3 [2018-11-10 09:21:31,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1805174397, now seen corresponding path program 1 times [2018-11-10 09:21:31,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:31,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,238 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:31,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1345278617, now seen corresponding path program 1 times [2018-11-10 09:21:31,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,278 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-10 09:21:31,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,278 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:31,279 INFO L87 Difference]: Start difference. First operand 555 states and 841 transitions. cyclomatic complexity: 291 Second operand 3 states. [2018-11-10 09:21:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:31,366 INFO L93 Difference]: Finished difference Result 860 states and 1246 transitions. [2018-11-10 09:21:31,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:31,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 860 states and 1246 transitions. [2018-11-10 09:21:31,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 335 [2018-11-10 09:21:31,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 860 states to 860 states and 1246 transitions. [2018-11-10 09:21:31,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2018-11-10 09:21:31,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2018-11-10 09:21:31,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 860 states and 1246 transitions. [2018-11-10 09:21:31,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:31,371 INFO L705 BuchiCegarLoop]: Abstraction has 860 states and 1246 transitions. [2018-11-10 09:21:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states and 1246 transitions. [2018-11-10 09:21:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 555. [2018-11-10 09:21:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-11-10 09:21:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 813 transitions. [2018-11-10 09:21:31,376 INFO L728 BuchiCegarLoop]: Abstraction has 555 states and 813 transitions. [2018-11-10 09:21:31,376 INFO L608 BuchiCegarLoop]: Abstraction has 555 states and 813 transitions. [2018-11-10 09:21:31,376 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 09:21:31,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 555 states and 813 transitions. [2018-11-10 09:21:31,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 335 [2018-11-10 09:21:31,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:31,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:31,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,378 INFO L793 eck$LassoCheckResult]: Stem: 23971#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 23741#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23742#L116-3 assume true; 24082#L116-1 assume !!(add_history_type_~var~0 < 3); 24061#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23928#L171 assume read_history_bool_~history_id == 0; 23929#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 23717#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 23916#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 23917#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 24083#L116-3 assume true; 24084#L116-1 assume !(add_history_type_~var~0 < 3); 24079#L116-4 add_history_type_#res := 1; 23943#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 23944#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 24052#L116-8 assume true; 24092#L116-6 assume !!(add_history_type_~var~0 < 3); 24048#L117-2 assume !(add_history_type_~history_id == 0); 24049#L123-2 assume !(add_history_type_~history_id == 1); 24146#L129-2 assume !(add_history_type_~history_id == 2); 24118#L135-3 assume !(add_history_type_~history_id == 3); 23761#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 24093#L116-8 assume true; 24094#L116-6 assume !(add_history_type_~var~0 < 3); 24089#L116-9 add_history_type_#res := 1; 23975#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 23938#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23939#L116-13 assume true; 24167#L116-11 assume !!(add_history_type_~var~0 < 3); 24043#L117-4 assume !(add_history_type_~history_id == 0); 24044#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 24101#L171-7 assume !(read_history_bool_~history_id == 0); 24010#L181-7 assume read_history_bool_~history_id == 1; 24011#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 23829#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23775#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23754#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 23727#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23728#L116-18 assume true; 24166#L116-16 assume !!(add_history_type_~var~0 < 3); 24029#L117-6 assume !(add_history_type_~history_id == 0); 24030#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 24090#L171-10 assume !(read_history_bool_~history_id == 0); 23998#L181-10 assume read_history_bool_~history_id == 1; 23999#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 23807#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23770#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23746#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 23972#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 23941#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 23856#L554-3 [2018-11-10 09:21:31,378 INFO L795 eck$LassoCheckResult]: Loop: 23856#L554-3 assume true; 23847#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 23848#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 23936#L236-2 assume { :end_inline_write_history_bool } true; 24019#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 23987#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 23933#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 23940#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 24080#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 24034#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 23926#L226-2 assume !(write_history_bool_~history_id == 0); 23927#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 23947#L236-5 assume { :end_inline_write_history_bool } true; 23989#L421 assume ~gate2Failed~0 % 256 != 0; 24212#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 24249#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 24248#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 24247#L226-4 assume !(write_history_bool_~history_id == 0); 24246#L231-4 assume !(write_history_bool_~history_id == 1); 24241#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 24239#L236-8 assume { :end_inline_write_history_bool } true; 24236#L452 assume ~gate3Failed~0 % 256 != 0; 24235#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 24234#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 24232#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 24228#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 24225#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 24178#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 24175#L211-2 assume { :end_inline_write_history_int8 } true; 24172#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 24169#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 24136#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 24086#L171-12 assume read_history_bool_~history_id == 0; 24054#L172-12 assume !(read_history_bool_~historyIndex == 0); 24026#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 23868#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 23750#L307 assume !(check_~tmp___3~0 % 256 == 0); 23751#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 23758#L151-7 assume read_history_int8_~history_id == 3; 23824#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 23826#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 23827#L346 assume !(check_~tmp___10~0 > -2); 24017#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 24018#L151-9 assume read_history_int8_~history_id == 3; 23812#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 23813#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 23815#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 23892#L366-1 check_#res := 1; 23880#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 23881#L579-72 assume !(assert_~arg % 256 == 0); 23922#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 23856#L554-3 [2018-11-10 09:21:31,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1805174397, now seen corresponding path program 2 times [2018-11-10 09:21:31,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:21:31,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,408 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:31,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,408 INFO L82 PathProgramCache]: Analyzing trace with hash -128611194, now seen corresponding path program 1 times [2018-11-10 09:21:31,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:31,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,441 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-10 09:21:31,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:31,442 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:31,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:31,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:31,442 INFO L87 Difference]: Start difference. First operand 555 states and 813 transitions. cyclomatic complexity: 263 Second operand 3 states. [2018-11-10 09:21:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:31,469 INFO L93 Difference]: Finished difference Result 895 states and 1290 transitions. [2018-11-10 09:21:31,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:31,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 895 states and 1290 transitions. [2018-11-10 09:21:31,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 670 [2018-11-10 09:21:31,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 895 states to 895 states and 1290 transitions. [2018-11-10 09:21:31,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 780 [2018-11-10 09:21:31,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 780 [2018-11-10 09:21:31,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 895 states and 1290 transitions. [2018-11-10 09:21:31,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:31,476 INFO L705 BuchiCegarLoop]: Abstraction has 895 states and 1290 transitions. [2018-11-10 09:21:31,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states and 1290 transitions. [2018-11-10 09:21:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 547. [2018-11-10 09:21:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-11-10 09:21:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 795 transitions. [2018-11-10 09:21:31,485 INFO L728 BuchiCegarLoop]: Abstraction has 547 states and 795 transitions. [2018-11-10 09:21:31,485 INFO L608 BuchiCegarLoop]: Abstraction has 547 states and 795 transitions. [2018-11-10 09:21:31,485 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 09:21:31,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 547 states and 795 transitions. [2018-11-10 09:21:31,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 335 [2018-11-10 09:21:31,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:31,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:31,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,487 INFO L793 eck$LassoCheckResult]: Stem: 25419#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 25199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25200#L116-3 assume true; 25525#L116-1 assume !!(add_history_type_~var~0 < 3); 25505#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25376#L171 assume read_history_bool_~history_id == 0; 25377#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 25178#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 25368#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 25369#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 25526#L116-3 assume true; 25527#L116-1 assume !(add_history_type_~var~0 < 3); 25523#L116-4 add_history_type_#res := 1; 25392#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 25393#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25498#L116-8 assume true; 25535#L116-6 assume !!(add_history_type_~var~0 < 3); 25494#L117-2 assume !(add_history_type_~history_id == 0); 25495#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25528#L171-4 assume !(read_history_bool_~history_id == 0); 25429#L181-4 assume read_history_bool_~history_id == 1; 25430#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 25348#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25237#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 25238#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 25536#L116-8 assume true; 25537#L116-6 assume !(add_history_type_~var~0 < 3); 25532#L116-9 add_history_type_#res := 1; 25423#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 25386#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25387#L116-13 assume true; 25604#L116-11 assume !!(add_history_type_~var~0 < 3); 25488#L117-4 assume !(add_history_type_~history_id == 0); 25489#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25543#L171-7 assume !(read_history_bool_~history_id == 0); 25455#L181-7 assume read_history_bool_~history_id == 1; 25456#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 25288#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25229#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25213#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 25185#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25186#L116-18 assume true; 25603#L116-16 assume !!(add_history_type_~var~0 < 3); 25473#L117-6 assume !(add_history_type_~history_id == 0); 25474#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25533#L171-10 assume !(read_history_bool_~history_id == 0); 25443#L181-10 assume read_history_bool_~history_id == 1; 25444#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 25268#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25223#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25207#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 25420#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 25389#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 25315#L554-3 [2018-11-10 09:21:31,487 INFO L795 eck$LassoCheckResult]: Loop: 25315#L554-3 assume true; 25303#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25304#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 25384#L236-2 assume { :end_inline_write_history_bool } true; 25466#L390 assume ~gate1Failed~0 % 256 != 0; 25382#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 25383#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 25390#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25670#L226-2 assume !(write_history_bool_~history_id == 0); 25668#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 25665#L236-5 assume { :end_inline_write_history_bool } true; 25664#L421 assume ~gate2Failed~0 % 256 != 0; 25320#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 25262#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 25263#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25426#L226-4 assume !(write_history_bool_~history_id == 0); 25421#L231-4 assume !(write_history_bool_~history_id == 1); 25422#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 25427#L236-8 assume { :end_inline_write_history_bool } true; 25461#L452 assume ~gate3Failed~0 % 256 != 0; 25502#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 25482#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 25483#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 25501#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 25306#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 25316#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 25589#L211-2 assume { :end_inline_write_history_int8 } true; 25221#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 25222#L294 assume !(~gate1Failed~0 % 256 == 0); 25414#L297 assume !(~gate2Failed~0 % 256 == 0); 25415#L300 assume ~gate3Failed~0 % 256 == 0;check_~tmp~2 := 1; 25575#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25529#L171-12 assume read_history_bool_~history_id == 0; 25500#L172-12 assume !(read_history_bool_~historyIndex == 0); 25470#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 25322#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 25203#L307 assume !(check_~tmp___3~0 % 256 == 0); 25204#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 25211#L151-7 assume read_history_int8_~history_id == 3; 25276#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 25278#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 25283#L346 assume !(check_~tmp___10~0 > -2); 25462#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 25463#L151-9 assume read_history_int8_~history_id == 3; 25264#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 25265#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 25271#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 25344#L366-1 check_#res := 1; 25334#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25335#L579-72 assume !(assert_~arg % 256 == 0); 25370#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 25315#L554-3 [2018-11-10 09:21:31,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 1 times [2018-11-10 09:21:31,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:31,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,535 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:31,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1206762350, now seen corresponding path program 1 times [2018-11-10 09:21:31,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,570 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-10 09:21:31,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,571 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:31,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:31,571 INFO L87 Difference]: Start difference. First operand 547 states and 795 transitions. cyclomatic complexity: 255 Second operand 3 states. [2018-11-10 09:21:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:31,588 INFO L93 Difference]: Finished difference Result 822 states and 1192 transitions. [2018-11-10 09:21:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:31,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 822 states and 1192 transitions. [2018-11-10 09:21:31,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 610 [2018-11-10 09:21:31,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 822 states to 822 states and 1192 transitions. [2018-11-10 09:21:31,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 707 [2018-11-10 09:21:31,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 707 [2018-11-10 09:21:31,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 822 states and 1192 transitions. [2018-11-10 09:21:31,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:31,601 INFO L705 BuchiCegarLoop]: Abstraction has 822 states and 1192 transitions. [2018-11-10 09:21:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states and 1192 transitions. [2018-11-10 09:21:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 622. [2018-11-10 09:21:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 09:21:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 909 transitions. [2018-11-10 09:21:31,608 INFO L728 BuchiCegarLoop]: Abstraction has 622 states and 909 transitions. [2018-11-10 09:21:31,608 INFO L608 BuchiCegarLoop]: Abstraction has 622 states and 909 transitions. [2018-11-10 09:21:31,608 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 09:21:31,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 622 states and 909 transitions. [2018-11-10 09:21:31,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 410 [2018-11-10 09:21:31,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:31,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:31,610 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,611 INFO L793 eck$LassoCheckResult]: Stem: 26796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 26575#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 26576#L116-3 assume true; 26904#L116-1 assume !!(add_history_type_~var~0 < 3); 26883#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26753#L171 assume read_history_bool_~history_id == 0; 26754#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 26551#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 26745#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 26746#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 26905#L116-3 assume true; 26906#L116-1 assume !(add_history_type_~var~0 < 3); 26902#L116-4 add_history_type_#res := 1; 26768#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 26769#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 26876#L116-8 assume true; 26914#L116-6 assume !!(add_history_type_~var~0 < 3); 26872#L117-2 assume !(add_history_type_~history_id == 0); 26873#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26907#L171-4 assume !(read_history_bool_~history_id == 0); 26807#L181-4 assume read_history_bool_~history_id == 1; 26808#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 26723#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 26611#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 26612#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 26915#L116-8 assume true; 26916#L116-6 assume !(add_history_type_~var~0 < 3); 26911#L116-9 add_history_type_#res := 1; 26800#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 26763#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 26764#L116-13 assume true; 26891#L116-11 assume !!(add_history_type_~var~0 < 3); 26866#L117-4 assume !(add_history_type_~history_id == 0); 26867#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26922#L171-7 assume !(read_history_bool_~history_id == 0); 26833#L181-7 assume read_history_bool_~history_id == 1; 26834#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 26662#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 26605#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 26588#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 26561#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 26562#L116-18 assume true; 26986#L116-16 assume !!(add_history_type_~var~0 < 3); 26851#L117-6 assume !(add_history_type_~history_id == 0); 26852#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26912#L171-10 assume !(read_history_bool_~history_id == 0); 26821#L181-10 assume read_history_bool_~history_id == 1; 26822#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 26640#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 26599#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 26580#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 26797#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 26766#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 26687#L554-3 [2018-11-10 09:21:31,611 INFO L795 eck$LassoCheckResult]: Loop: 26687#L554-3 assume true; 26678#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 26679#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 26761#L236-2 assume { :end_inline_write_history_bool } true; 26842#L390 assume ~gate1Failed~0 % 256 != 0; 26759#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 26760#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 26767#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27171#L226-2 assume !(write_history_bool_~history_id == 0); 27169#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 27166#L236-5 assume { :end_inline_write_history_bool } true; 27165#L421 assume ~gate2Failed~0 % 256 != 0; 27160#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 27158#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 27101#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27099#L226-4 assume !(write_history_bool_~history_id == 0); 27098#L231-4 assume !(write_history_bool_~history_id == 1); 27095#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 27094#L236-8 assume { :end_inline_write_history_bool } true; 27093#L452 assume ~gate3Failed~0 % 256 != 0; 27092#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 27091#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 27090#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 27031#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 27027#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 27025#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 27007#L211-2 assume { :end_inline_write_history_int8 } true; 27001#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 26995#L294 assume !(~gate1Failed~0 % 256 == 0); 26989#L297 assume !(~gate2Failed~0 % 256 == 0); 26959#L300 assume !(~gate3Failed~0 % 256 == 0);check_~tmp~2 := 0; 26957#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26908#L171-12 assume read_history_bool_~history_id == 0; 26878#L172-12 assume !(read_history_bool_~historyIndex == 0); 26848#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 26699#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 26584#L307 assume !(check_~tmp___3~0 % 256 == 0); 26585#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 26592#L151-7 assume read_history_int8_~history_id == 3; 26657#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 26659#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 26660#L346 assume !(check_~tmp___10~0 > -2); 26840#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 26841#L151-9 assume read_history_int8_~history_id == 3; 26645#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 26646#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 26648#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 26721#L366-1 check_#res := 1; 26711#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 26712#L579-72 assume !(assert_~arg % 256 == 0); 26747#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 26687#L554-3 [2018-11-10 09:21:31,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 2 times [2018-11-10 09:21:31,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:31,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,643 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:31,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,644 INFO L82 PathProgramCache]: Analyzing trace with hash -784060524, now seen corresponding path program 1 times [2018-11-10 09:21:31,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:31,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,682 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-10 09:21:31,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:31,682 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:31,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:21:31,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:21:31,683 INFO L87 Difference]: Start difference. First operand 622 states and 909 transitions. cyclomatic complexity: 294 Second operand 4 states. [2018-11-10 09:21:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:31,868 INFO L93 Difference]: Finished difference Result 1846 states and 2672 transitions. [2018-11-10 09:21:31,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:21:31,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1846 states and 2672 transitions. [2018-11-10 09:21:31,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 773 [2018-11-10 09:21:31,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1846 states to 1846 states and 2672 transitions. [2018-11-10 09:21:31,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1564 [2018-11-10 09:21:31,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1564 [2018-11-10 09:21:31,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1846 states and 2672 transitions. [2018-11-10 09:21:31,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:31,880 INFO L705 BuchiCegarLoop]: Abstraction has 1846 states and 2672 transitions. [2018-11-10 09:21:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states and 2672 transitions. [2018-11-10 09:21:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 622. [2018-11-10 09:21:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 09:21:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 908 transitions. [2018-11-10 09:21:31,889 INFO L728 BuchiCegarLoop]: Abstraction has 622 states and 908 transitions. [2018-11-10 09:21:31,889 INFO L608 BuchiCegarLoop]: Abstraction has 622 states and 908 transitions. [2018-11-10 09:21:31,889 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 09:21:31,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 622 states and 908 transitions. [2018-11-10 09:21:31,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 410 [2018-11-10 09:21:31,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:31,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:31,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,892 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, 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-10 09:21:31,892 INFO L793 eck$LassoCheckResult]: Stem: 29274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 29054#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29055#L116-3 assume true; 29381#L116-1 assume !!(add_history_type_~var~0 < 3); 29360#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 29231#L171 assume read_history_bool_~history_id == 0; 29232#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 29033#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 29223#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 29224#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 29382#L116-3 assume true; 29383#L116-1 assume !(add_history_type_~var~0 < 3); 29379#L116-4 add_history_type_#res := 1; 29247#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 29248#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29353#L116-8 assume true; 29391#L116-6 assume !!(add_history_type_~var~0 < 3); 29349#L117-2 assume !(add_history_type_~history_id == 0); 29350#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 29384#L171-4 assume !(read_history_bool_~history_id == 0); 29284#L181-4 assume read_history_bool_~history_id == 1; 29285#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 29203#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29090#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 29091#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 29392#L116-8 assume true; 29393#L116-6 assume !(add_history_type_~var~0 < 3); 29388#L116-9 add_history_type_#res := 1; 29278#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 29241#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29242#L116-13 assume true; 29462#L116-11 assume !!(add_history_type_~var~0 < 3); 29343#L117-4 assume !(add_history_type_~history_id == 0); 29344#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 29400#L171-7 assume !(read_history_bool_~history_id == 0); 29310#L181-7 assume read_history_bool_~history_id == 1; 29311#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 29143#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29084#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 29068#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 29040#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29041#L116-18 assume true; 29375#L116-16 assume !!(add_history_type_~var~0 < 3); 29328#L117-6 assume !(add_history_type_~history_id == 0); 29329#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 29389#L171-10 assume !(read_history_bool_~history_id == 0); 29298#L181-10 assume read_history_bool_~history_id == 1; 29299#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 29121#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29078#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 29062#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 29275#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 29244#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 29170#L554-3 [2018-11-10 09:21:31,892 INFO L795 eck$LassoCheckResult]: Loop: 29170#L554-3 assume true; 29158#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29159#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 29239#L236-2 assume { :end_inline_write_history_bool } true; 29319#L390 assume ~gate1Failed~0 % 256 != 0; 29237#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 29238#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 29245#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29596#L226-2 assume !(write_history_bool_~history_id == 0); 29593#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 29590#L236-5 assume { :end_inline_write_history_bool } true; 29580#L421 assume ~gate2Failed~0 % 256 != 0; 29578#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 29574#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 29572#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29570#L226-4 assume !(write_history_bool_~history_id == 0); 29569#L231-4 assume !(write_history_bool_~history_id == 1); 29566#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 29565#L236-8 assume { :end_inline_write_history_bool } true; 29563#L452 assume ~gate3Failed~0 % 256 != 0; 29564#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 29634#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 29633#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 29614#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 29609#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 29604#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 29601#L211-2 assume { :end_inline_write_history_int8 } true; 29599#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 29598#L294 assume !(~gate1Failed~0 % 256 == 0); 29268#L297 assume !(~gate2Failed~0 % 256 == 0); 29269#L300 assume !(~gate3Failed~0 % 256 == 0);check_~tmp~2 := 0; 29435#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 29385#L171-12 assume read_history_bool_~history_id == 0; 29355#L172-12 assume !(read_history_bool_~historyIndex == 0); 29325#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 29176#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 29058#L307 assume !(check_~tmp___3~0 % 256 == 0); 29059#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 29066#L151-7 assume read_history_int8_~history_id == 3; 29131#L152-7 assume !(read_history_int8_~historyIndex == 0); 29132#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 29137#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 29138#L346 assume !(check_~tmp___10~0 > -2); 29317#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 29318#L151-9 assume read_history_int8_~history_id == 3; 29117#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 29118#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 29126#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 29199#L366-1 check_#res := 1; 29189#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 29190#L579-72 assume !(assert_~arg % 256 == 0); 29225#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 29170#L554-3 [2018-11-10 09:21:31,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 3 times [2018-11-10 09:21:31,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:31,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,938 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:31,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash -120980327, now seen corresponding path program 1 times [2018-11-10 09:21:31,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:31,966 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-10 09:21:31,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:31,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:31,966 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:31,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:31,967 INFO L87 Difference]: Start difference. First operand 622 states and 908 transitions. cyclomatic complexity: 293 Second operand 3 states. [2018-11-10 09:21:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:31,976 INFO L93 Difference]: Finished difference Result 623 states and 908 transitions. [2018-11-10 09:21:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:31,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 623 states and 908 transitions. [2018-11-10 09:21:31,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 388 [2018-11-10 09:21:31,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 623 states to 600 states and 873 transitions. [2018-11-10 09:21:31,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 485 [2018-11-10 09:21:31,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 485 [2018-11-10 09:21:31,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 600 states and 873 transitions. [2018-11-10 09:21:31,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:31,981 INFO L705 BuchiCegarLoop]: Abstraction has 600 states and 873 transitions. [2018-11-10 09:21:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 873 transitions. [2018-11-10 09:21:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2018-11-10 09:21:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-10 09:21:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 873 transitions. [2018-11-10 09:21:31,988 INFO L728 BuchiCegarLoop]: Abstraction has 600 states and 873 transitions. [2018-11-10 09:21:31,988 INFO L608 BuchiCegarLoop]: Abstraction has 600 states and 873 transitions. [2018-11-10 09:21:31,988 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 09:21:31,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 600 states and 873 transitions. [2018-11-10 09:21:31,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 388 [2018-11-10 09:21:31,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:31,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:31,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:31,990 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, 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-10 09:21:31,990 INFO L793 eck$LassoCheckResult]: Stem: 30526#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 30306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 30307#L116-3 assume true; 30630#L116-1 assume !!(add_history_type_~var~0 < 3); 30611#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30483#L171 assume read_history_bool_~history_id == 0; 30484#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 30285#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 30475#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 30476#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 30631#L116-3 assume true; 30632#L116-1 assume !(add_history_type_~var~0 < 3); 30628#L116-4 add_history_type_#res := 1; 30499#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 30500#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 30604#L116-8 assume true; 30641#L116-6 assume !!(add_history_type_~var~0 < 3); 30600#L117-2 assume !(add_history_type_~history_id == 0); 30601#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30633#L171-4 assume !(read_history_bool_~history_id == 0); 30536#L181-4 assume read_history_bool_~history_id == 1; 30537#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 30461#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 30342#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 30343#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 30642#L116-8 assume true; 30643#L116-6 assume !(add_history_type_~var~0 < 3); 30638#L116-9 add_history_type_#res := 1; 30530#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 30493#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 30494#L116-13 assume true; 30619#L116-11 assume !!(add_history_type_~var~0 < 3); 30594#L117-4 assume !(add_history_type_~history_id == 0); 30595#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30649#L171-7 assume !(read_history_bool_~history_id == 0); 30562#L181-7 assume read_history_bool_~history_id == 1; 30563#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 30392#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 30333#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 30319#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 30292#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 30293#L116-18 assume true; 30625#L116-16 assume !!(add_history_type_~var~0 < 3); 30580#L117-6 assume !(add_history_type_~history_id == 0); 30581#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30639#L171-10 assume !(read_history_bool_~history_id == 0); 30550#L181-10 assume read_history_bool_~history_id == 1; 30551#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 30370#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 30330#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 30311#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 30527#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 30496#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 30417#L554-3 [2018-11-10 09:21:31,991 INFO L795 eck$LassoCheckResult]: Loop: 30417#L554-3 assume true; 30408#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 30409#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 30491#L236-2 assume { :end_inline_write_history_bool } true; 30571#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 30539#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 30488#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 30495#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 30629#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 30634#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 30783#L226-2 assume !(write_history_bool_~history_id == 0); 30781#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 30775#L236-5 assume { :end_inline_write_history_bool } true; 30772#L421 assume ~gate2Failed~0 % 256 != 0; 30773#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 30841#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 30840#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 30839#L226-4 assume !(write_history_bool_~history_id == 0); 30838#L231-4 assume !(write_history_bool_~history_id == 1); 30835#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 30834#L236-8 assume { :end_inline_write_history_bool } true; 30833#L452 assume ~gate3Failed~0 % 256 != 0; 30608#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 30588#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 30589#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 30607#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 30413#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 30423#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 30697#L211-2 assume { :end_inline_write_history_int8 } true; 30328#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 30329#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 30522#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30635#L171-12 assume read_history_bool_~history_id == 0; 30606#L172-12 assume !(read_history_bool_~historyIndex == 0); 30577#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 30429#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 30315#L307 assume !(check_~tmp___3~0 % 256 == 0); 30316#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 30323#L151-7 assume read_history_int8_~history_id == 3; 30387#L152-7 assume !(read_history_int8_~historyIndex == 0); 30388#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 30389#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 30390#L346 assume !(check_~tmp___10~0 > -2); 30569#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 30570#L151-9 assume read_history_int8_~history_id == 3; 30375#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 30376#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 30378#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 30451#L366-1 check_#res := 1; 30441#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 30442#L579-72 assume !(assert_~arg % 256 == 0); 30477#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 30417#L554-3 [2018-11-10 09:21:31,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 4 times [2018-11-10 09:21:31,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:31,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:31,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:32,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:32,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:32,034 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:32,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:32,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1276887577, now seen corresponding path program 1 times [2018-11-10 09:21:32,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:32,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:32,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:32,604 WARN L179 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 215 [2018-11-10 09:21:34,193 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 186 DAG size of output: 167 [2018-11-10 09:21:34,195 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:34,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:34,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:34,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:34,196 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:34,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:34,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:34,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:34,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration17_Loop [2018-11-10 09:21:34,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:34,196 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:34,213 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-10 09:21:34,215 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-10 09:21:34,217 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-10 09:21:34,221 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-10 09:21:34,232 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-10 09:21:34,234 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-10 09:21:34,238 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-10 09:21:34,240 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-10 09:21:34,244 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-10 09:21:34,247 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-10 09:21:34,249 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-10 09:21:34,250 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-10 09:21:34,251 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-10 09:21:34,252 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-10 09:21:34,254 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-10 09:21:34,255 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-10 09:21:34,256 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-10 09:21:34,256 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-10 09:21:34,257 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-10 09:21:34,260 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-10 09:21:34,261 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-10 09:21:34,262 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-10 09:21:34,262 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-10 09:21:34,263 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-10 09:21:34,264 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-10 09:21:34,265 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-10 09:21:34,266 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-10 09:21:34,267 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-10 09:21:34,267 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-10 09:21:34,269 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-10 09:21:34,270 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-10 09:21:34,271 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-10 09:21:34,272 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-10 09:21:34,273 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-10 09:21:34,275 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-10 09:21:34,279 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-10 09:21:34,280 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-10 09:21:34,285 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-10 09:21:34,294 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-10 09:21:34,302 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-10 09:21:34,303 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-10 09:21:34,304 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-10 09:21:34,305 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-10 09:21:34,308 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-10 09:21:34,309 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-10 09:21:34,312 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-10 09:21:34,318 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-10 09:21:34,320 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-10 09:21:34,323 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-10 09:21:34,324 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-10 09:21:34,327 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-10 09:21:34,328 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-10 09:21:34,329 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-10 09:21:34,330 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-10 09:21:34,332 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-10 09:21:34,333 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-10 09:21:34,334 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-10 09:21:34,335 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-10 09:21:34,336 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-10 09:21:34,337 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-10 09:21:34,338 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-10 09:21:34,339 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-10 09:21:34,340 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-10 09:21:34,341 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-10 09:21:34,346 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-10 09:21:34,347 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-10 09:21:34,348 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-10 09:21:34,349 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-10 09:21:34,350 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-10 09:21:34,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-10 09:21:34,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-10 09:21:34,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-10 09:21:34,463 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-10 09:21:34,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-10 09:21:34,464 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-10 09:21:34,467 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-10 09:21:34,903 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-10 09:21:37,264 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2018-11-10 09:21:37,276 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:37,277 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:37,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:37,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:37,285 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:37,285 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:37,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:37,301 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:37,306 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:37,306 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:37,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:37,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:37,325 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:37,325 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:37,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:37,343 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:37,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:37,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:49,440 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 09:21:49,443 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:49,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:49,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:49,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:49,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:49,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:49,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:49,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:49,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration17_Loop [2018-11-10 09:21:49,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:49,443 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:49,461 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-10 09:21:49,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-10 09:21:49,467 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-10 09:21:49,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-10 09:21:49,470 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-10 09:21:49,472 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-10 09:21:49,475 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-10 09:21:49,479 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-10 09:21:49,482 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-10 09:21:49,582 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-10 09:21:49,583 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-10 09:21:49,584 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-10 09:21:49,585 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-10 09:21:49,586 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-10 09:21:49,593 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-10 09:21:49,594 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-10 09:21:49,595 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-10 09:21:49,597 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-10 09:21:49,598 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-10 09:21:49,599 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-10 09:21:49,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-10 09:21:49,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-10 09:21:49,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-10 09:21:49,603 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-10 09:21:49,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-10 09:21:49,605 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-10 09:21:49,608 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-10 09:21:49,609 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-10 09:21:49,609 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-10 09:21:49,613 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-10 09:21:49,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-10 09:21:49,628 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-10 09:21:49,629 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-10 09:21:49,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-10 09:21:49,636 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-10 09:21:49,639 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-10 09:21:49,640 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-10 09:21:49,644 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-10 09:21:49,645 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-10 09:21:49,646 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-10 09:21:49,647 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-10 09:21:49,648 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-10 09:21:49,649 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-10 09:21:49,651 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-10 09:21:49,652 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-10 09:21:49,653 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-10 09:21:49,654 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-10 09:21:49,657 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-10 09:21:49,659 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-10 09:21:49,661 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-10 09:21:49,662 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-10 09:21:49,664 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-10 09:21:49,665 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-10 09:21:49,667 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-10 09:21:49,669 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-10 09:21:49,670 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-10 09:21:49,671 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-10 09:21:49,672 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-10 09:21:49,673 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-10 09:21:49,673 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-10 09:21:49,674 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-10 09:21:49,675 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-10 09:21:49,676 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-10 09:21:49,677 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-10 09:21:49,678 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-10 09:21:49,678 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-10 09:21:49,679 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-10 09:21:49,680 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-10 09:21:49,681 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-10 09:21:49,682 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-10 09:21:49,684 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-10 09:21:49,685 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-10 09:21:49,686 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-10 09:21:49,688 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-10 09:21:49,689 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-10 09:21:49,847 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-10 09:21:52,225 WARN L179 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2018-11-10 09:21:52,329 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:52,330 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:52,330 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-10 09:21:52,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,332 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-10 09:21:52,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,334 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-10 09:21:52,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,336 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-10 09:21:52,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,337 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-10 09:21:52,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,339 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-10 09:21:52,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,340 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-10 09:21:52,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,342 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-10 09:21:52,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,344 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-10 09:21:52,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,344 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-10 09:21:52,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,361 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 09:21:52,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,482 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:52,568 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 09:21:52,568 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:21:52,568 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:52,568 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:52,569 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:52,569 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g1v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g1v_old~0 + 1*~nomsg~0 Supporting invariants [] [2018-11-10 09:21:52,569 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:52,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:52,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:52,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:52,802 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-10 09:21:52,802 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2018-11-10 09:21:52,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 600 states and 873 transitions. cyclomatic complexity: 280 Second operand 17 states. [2018-11-10 09:21:55,140 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 600 states and 873 transitions. cyclomatic complexity: 280. Second operand 17 states. Result 5981 states and 8180 transitions. Complement of second has 81 states. [2018-11-10 09:21:55,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 41 states 1 stem states 39 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 09:21:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2306 transitions. [2018-11-10 09:21:55,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2306 transitions. Stem has 53 letters. Loop has 52 letters. [2018-11-10 09:21:55,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:55,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2306 transitions. Stem has 105 letters. Loop has 52 letters. [2018-11-10 09:21:55,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:55,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2306 transitions. Stem has 53 letters. Loop has 104 letters. [2018-11-10 09:21:55,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:55,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5981 states and 8180 transitions. [2018-11-10 09:21:55,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1068 [2018-11-10 09:21:55,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5981 states to 4072 states and 5648 transitions. [2018-11-10 09:21:55,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3174 [2018-11-10 09:21:55,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3176 [2018-11-10 09:21:55,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4072 states and 5648 transitions. [2018-11-10 09:21:55,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:55,175 INFO L705 BuchiCegarLoop]: Abstraction has 4072 states and 5648 transitions. [2018-11-10 09:21:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4072 states and 5648 transitions. [2018-11-10 09:21:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4072 to 1302. [2018-11-10 09:21:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2018-11-10 09:21:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1883 transitions. [2018-11-10 09:21:55,200 INFO L728 BuchiCegarLoop]: Abstraction has 1302 states and 1883 transitions. [2018-11-10 09:21:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:55,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:55,201 INFO L87 Difference]: Start difference. First operand 1302 states and 1883 transitions. Second operand 3 states. [2018-11-10 09:21:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:55,244 INFO L93 Difference]: Finished difference Result 2363 states and 3398 transitions. [2018-11-10 09:21:55,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:55,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2363 states and 3398 transitions. [2018-11-10 09:21:55,254 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1276 [2018-11-10 09:21:55,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2363 states to 2363 states and 3398 transitions. [2018-11-10 09:21:55,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1564 [2018-11-10 09:21:55,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1564 [2018-11-10 09:21:55,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2363 states and 3398 transitions. [2018-11-10 09:21:55,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:55,264 INFO L705 BuchiCegarLoop]: Abstraction has 2363 states and 3398 transitions. [2018-11-10 09:21:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states and 3398 transitions. [2018-11-10 09:21:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1266. [2018-11-10 09:21:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-11-10 09:21:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1821 transitions. [2018-11-10 09:21:55,281 INFO L728 BuchiCegarLoop]: Abstraction has 1266 states and 1821 transitions. [2018-11-10 09:21:55,281 INFO L608 BuchiCegarLoop]: Abstraction has 1266 states and 1821 transitions. [2018-11-10 09:21:55,281 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 09:21:55,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1266 states and 1821 transitions. [2018-11-10 09:21:55,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 638 [2018-11-10 09:21:55,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:55,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:55,284 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:55,284 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, 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-10 09:21:55,285 INFO L793 eck$LassoCheckResult]: Stem: 41368#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 41057#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 41058#L116-3 assume true; 41502#L116-1 assume !!(add_history_type_~var~0 < 3); 41470#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41296#L171 assume read_history_bool_~history_id == 0; 41297#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 41024#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 41282#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 41283#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 41503#L116-3 assume true; 41504#L116-1 assume !(add_history_type_~var~0 < 3); 41498#L116-4 add_history_type_#res := 1; 41319#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 41320#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 41457#L116-8 assume true; 41516#L116-6 assume !!(add_history_type_~var~0 < 3); 41455#L117-2 assume !(add_history_type_~history_id == 0); 41456#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41505#L171-4 assume !(read_history_bool_~history_id == 0); 41383#L181-4 assume read_history_bool_~history_id == 1; 41384#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 41265#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 41102#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 41103#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 41517#L116-8 assume true; 41518#L116-6 assume !(add_history_type_~var~0 < 3); 41513#L116-9 add_history_type_#res := 1; 41374#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 41308#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 41309#L116-13 assume true; 41482#L116-11 assume !!(add_history_type_~var~0 < 3); 41450#L117-4 assume !(add_history_type_~history_id == 0); 41451#L123-4 assume !(add_history_type_~history_id == 1); 41563#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41521#L171-8 assume !(read_history_bool_~history_id == 0); 41407#L181-8 assume read_history_bool_~history_id == 1; 41408#L182-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 41148#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 41074#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 41075#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 41037#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 41038#L116-18 assume true; 41637#L116-16 assume !!(add_history_type_~var~0 < 3); 41434#L117-6 assume !(add_history_type_~history_id == 0); 41435#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41514#L171-10 assume !(read_history_bool_~history_id == 0); 41401#L181-10 assume read_history_bool_~history_id == 1; 41402#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 41127#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 41090#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 41064#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 41369#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 41314#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 41315#L554-3 assume true; 41184#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 41185#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 41304#L236-2 assume { :end_inline_write_history_bool } true; 41419#L390 assume ~gate1Failed~0 % 256 != 0; 41302#L391 [2018-11-10 09:21:55,285 INFO L795 eck$LassoCheckResult]: Loop: 41302#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 41303#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 41316#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 41851#L226-2 assume !(write_history_bool_~history_id == 0); 41849#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 41846#L236-5 assume { :end_inline_write_history_bool } true; 41844#L421 assume !(~gate2Failed~0 % 256 != 0);gate2_each_pals_period_~tmp~4 := gate2_each_pals_period_#t~nondet33;havoc gate2_each_pals_period_#t~nondet33;gate2_each_pals_period_~next_state~1 := gate2_each_pals_period_~tmp~4; 41845#L427 assume gate2_each_pals_period_~next_state~1 == 0;gate2_each_pals_period_~tmp___0~4 := 1; 42060#L433-2 assume (if gate2_each_pals_period_~tmp___0~4 == 0 then 0 else 1) % 256 != 0; 42058#L439 assume !(gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite34 := ~g2v_new~0; 42056#L439-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite34 % 256 <= 127 then gate2_each_pals_period_#t~ite34 % 256 else gate2_each_pals_period_#t~ite34 % 256 - 256);havoc gate2_each_pals_period_#t~ite34; 42054#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 42052#L226-4 assume !(write_history_bool_~history_id == 0); 42050#L231-4 assume !(write_history_bool_~history_id == 1); 42043#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 42041#L236-8 assume { :end_inline_write_history_bool } true; 42038#L452 assume ~gate3Failed~0 % 256 != 0; 42034#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 42032#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 42030#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 42022#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 42018#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 42016#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 41853#L211-2 assume { :end_inline_write_history_int8 } true; 41852#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 41589#L294 assume !(~gate1Failed~0 % 256 == 0); 41590#L297 assume ~gate2Failed~0 % 256 == 0;check_~tmp~2 := 1; 41912#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41910#L171-12 assume read_history_bool_~history_id == 0; 41909#L172-12 assume !(read_history_bool_~historyIndex == 0); 41908#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 41784#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 41068#L307 assume !(check_~tmp___3~0 % 256 == 0); 41069#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 41079#L151-7 assume !(read_history_int8_~history_id == 3);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 41550#L579-54 assume !(assert_~arg % 256 == 0); 41553#L574-27 assume { :end_inline_assert } true;read_history_int8_#res := -2; 41469#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 41756#L346 assume !(check_~tmp___10~0 > -2); 41454#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 41755#L151-9 assume read_history_int8_~history_id == 3; 41754#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 41468#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 41753#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 41262#L366-1 check_#res := 1; 41261#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 41284#L579-72 assume !(assert_~arg % 256 == 0); 41285#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 42199#L554-3 assume true; 42198#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 42188#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 42187#L236-2 assume { :end_inline_write_history_bool } true; 42186#L390 assume ~gate1Failed~0 % 256 != 0; 41302#L391 [2018-11-10 09:21:55,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:55,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1360593371, now seen corresponding path program 1 times [2018-11-10 09:21:55,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:55,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:55,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:55,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:55,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:55,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:55,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:55,323 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:55,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash -606705951, now seen corresponding path program 1 times [2018-11-10 09:21:55,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:55,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:55,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:55,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:55,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:55,347 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-10 09:21:55,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:55,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:55,347 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:55,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:55,348 INFO L87 Difference]: Start difference. First operand 1266 states and 1821 transitions. cyclomatic complexity: 564 Second operand 3 states. [2018-11-10 09:21:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:55,404 INFO L93 Difference]: Finished difference Result 1858 states and 2655 transitions. [2018-11-10 09:21:55,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:55,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2655 transitions. [2018-11-10 09:21:55,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 606 [2018-11-10 09:21:55,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2655 transitions. [2018-11-10 09:21:55,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1237 [2018-11-10 09:21:55,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1237 [2018-11-10 09:21:55,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2655 transitions. [2018-11-10 09:21:55,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:55,419 INFO L705 BuchiCegarLoop]: Abstraction has 1858 states and 2655 transitions. [2018-11-10 09:21:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2655 transitions. [2018-11-10 09:21:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1216. [2018-11-10 09:21:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-10 09:21:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1745 transitions. [2018-11-10 09:21:55,432 INFO L728 BuchiCegarLoop]: Abstraction has 1216 states and 1745 transitions. [2018-11-10 09:21:55,432 INFO L608 BuchiCegarLoop]: Abstraction has 1216 states and 1745 transitions. [2018-11-10 09:21:55,432 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 09:21:55,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1216 states and 1745 transitions. [2018-11-10 09:21:55,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 606 [2018-11-10 09:21:55,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:55,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:55,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:55,436 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, 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-10 09:21:55,436 INFO L793 eck$LassoCheckResult]: Stem: 44493#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 44189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44190#L116-3 assume true; 44631#L116-1 assume !!(add_history_type_~var~0 < 3); 44601#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 44426#L171 assume read_history_bool_~history_id == 0; 44427#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 44156#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 44412#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 44413#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 44632#L116-3 assume true; 44633#L116-1 assume !(add_history_type_~var~0 < 3); 44627#L116-4 add_history_type_#res := 1; 44447#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 44448#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44586#L116-8 assume true; 44642#L116-6 assume !!(add_history_type_~var~0 < 3); 44584#L117-2 assume !(add_history_type_~history_id == 0); 44585#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 44634#L171-4 assume !(read_history_bool_~history_id == 0); 44510#L181-4 assume read_history_bool_~history_id == 1; 44511#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 44398#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 44234#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 44235#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 44643#L116-8 assume true; 44644#L116-6 assume !(add_history_type_~var~0 < 3); 44639#L116-9 add_history_type_#res := 1; 44499#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 44438#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44439#L116-13 assume true; 44614#L116-11 assume !!(add_history_type_~var~0 < 3); 44579#L117-4 assume !(add_history_type_~history_id == 0); 44580#L123-4 assume !(add_history_type_~history_id == 1); 44674#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 44647#L171-8 assume !(read_history_bool_~history_id == 0); 44533#L181-8 assume read_history_bool_~history_id == 1; 44534#L182-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 44279#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 44206#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 44207#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 44169#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44170#L116-18 assume true; 44725#L116-16 assume !!(add_history_type_~var~0 < 3); 44563#L117-6 assume !(add_history_type_~history_id == 0); 44564#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 44640#L171-10 assume !(read_history_bool_~history_id == 0); 44527#L181-10 assume read_history_bool_~history_id == 1; 44528#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 44259#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 44222#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 44196#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 44494#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 44444#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 44445#L554-3 assume true; 44994#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 44989#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 44965#L236-2 assume { :end_inline_write_history_bool } true; 44964#L390 assume ~gate1Failed~0 % 256 != 0; 44432#L391 [2018-11-10 09:21:55,436 INFO L795 eck$LassoCheckResult]: Loop: 44432#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 44433#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 44446#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 45110#L226-2 assume !(write_history_bool_~history_id == 0); 45108#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 45102#L236-5 assume { :end_inline_write_history_bool } true; 45099#L421 assume !(~gate2Failed~0 % 256 != 0);gate2_each_pals_period_~tmp~4 := gate2_each_pals_period_#t~nondet33;havoc gate2_each_pals_period_#t~nondet33;gate2_each_pals_period_~next_state~1 := gate2_each_pals_period_~tmp~4; 45097#L427 assume gate2_each_pals_period_~next_state~1 == 0;gate2_each_pals_period_~tmp___0~4 := 1; 45091#L433-2 assume (if gate2_each_pals_period_~tmp___0~4 == 0 then 0 else 1) % 256 != 0; 45089#L439 assume !(gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite34 := ~g2v_new~0; 45087#L439-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite34 % 256 <= 127 then gate2_each_pals_period_#t~ite34 % 256 else gate2_each_pals_period_#t~ite34 % 256 - 256);havoc gate2_each_pals_period_#t~ite34; 45085#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 45083#L226-4 assume !(write_history_bool_~history_id == 0); 45082#L231-4 assume !(write_history_bool_~history_id == 1); 45079#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 45078#L236-8 assume { :end_inline_write_history_bool } true; 45076#L452 assume ~gate3Failed~0 % 256 != 0; 45077#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 45138#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 45137#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 45130#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 45126#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 45124#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 45120#L211-2 assume { :end_inline_write_history_int8 } true; 45118#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 45115#L294 assume !(~gate1Failed~0 % 256 == 0); 44840#L297 assume ~gate2Failed~0 % 256 == 0;check_~tmp~2 := 1; 44836#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 44832#L171-12 assume read_history_bool_~history_id == 0; 44830#L172-12 assume !(read_history_bool_~historyIndex == 0); 44826#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 44821#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 44813#L307 assume !(check_~tmp___3~0 % 256 == 0); 44808#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 44667#L151-7 assume read_history_int8_~history_id == 3; 44282#L152-7 assume !(read_history_int8_~historyIndex == 0); 44283#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 44600#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 44806#L346 assume !(check_~tmp___10~0 > -2); 44583#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 44805#L151-9 assume read_history_int8_~history_id == 3; 44266#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 44267#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 44272#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 44560#L366-1 check_#res := 1; 44406#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 44977#L579-72 assume !(assert_~arg % 256 == 0); 44976#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 44975#L554-3 assume true; 44974#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 44969#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 44968#L236-2 assume { :end_inline_write_history_bool } true; 44967#L390 assume ~gate1Failed~0 % 256 != 0; 44432#L391 [2018-11-10 09:21:55,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1360593371, now seen corresponding path program 2 times [2018-11-10 09:21:55,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:55,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:55,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:55,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:55,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:55,484 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:55,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1597976086, now seen corresponding path program 1 times [2018-11-10 09:21:55,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:55,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:56,095 WARN L179 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 220 [2018-11-10 09:21:59,893 WARN L179 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 206 DAG size of output: 183 [2018-11-10 09:21:59,897 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:59,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:59,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:59,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:59,897 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:59,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:59,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:59,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:59,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration19_Loop [2018-11-10 09:21:59,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:59,898 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:59,901 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:59,968 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 7011 disjunctions. This might take some time... [2018-11-10 09:22:00,148 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 73 disjunctions. [2018-11-10 09:22:00,149 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-10 09:22:00,158 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-10 09:22:00,169 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-10 09:22:00,170 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-10 09:22:00,172 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-10 09:22:00,177 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-10 09:22:00,178 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-10 09:22:00,179 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-10 09:22:00,182 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-10 09:22:00,184 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-10 09:22:00,185 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-10 09:22:00,187 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-10 09:22:00,188 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-10 09:22:00,190 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-10 09:22:00,191 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-10 09:22:00,193 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-10 09:22:00,194 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-10 09:22:00,195 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-10 09:22:00,198 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-10 09:22:00,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-10 09:22:00,203 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-10 09:22:00,205 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-10 09:22:00,206 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-10 09:22:00,207 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-10 09:22:00,207 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-10 09:22:00,208 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-10 09:22:00,209 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-10 09:22:00,210 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-10 09:22:00,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-10 09:22:00,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-10 09:22:00,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-10 09:22:00,234 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-10 09:22:00,236 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-10 09:22:00,237 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-10 09:22:00,239 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-10 09:22:00,240 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-10 09:22:00,241 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-10 09:22:00,245 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-10 09:22:00,246 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-10 09:22:00,247 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-10 09:22:00,248 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-10 09:22:00,250 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-10 09:22:00,376 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2018-11-10 09:22:00,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-10 09:22:00,377 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-10 09:22:00,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-10 09:22:00,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-10 09:22:00,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-10 09:22:00,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-10 09:22:00,381 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-10 09:22:00,382 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-10 09:22:00,383 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-10 09:22:00,387 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-10 09:22:00,389 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-10 09:22:00,390 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-10 09:22:00,390 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-10 09:22:00,391 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-10 09:22:00,392 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-10 09:22:00,393 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-10 09:22:00,394 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-10 09:22:00,395 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-10 09:22:00,395 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-10 09:22:00,396 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-10 09:22:00,397 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-10 09:22:00,398 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-10 09:22:00,400 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-10 09:22:00,400 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-10 09:22:00,401 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-10 09:22:00,402 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-10 09:22:00,403 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-10 09:22:00,404 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-10 09:22:00,404 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-10 09:22:00,405 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-10 09:22:00,406 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-10 09:22:00,407 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-10 09:22:00,408 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-10 09:22:00,557 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-10 09:22:00,740 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 09:22:00,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 09:22:07,714 WARN L179 SmtUtils]: Spent 6.79 s on a formula simplification. DAG size of input: 318 DAG size of output: 146 [2018-11-10 09:22:07,750 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:22:07,750 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:07,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:07,759 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:07,765 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:07,765 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret20=0} Honda state: {ULTIMATE.start_check_#t~ret20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:07,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:07,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:07,801 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:07,801 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:07,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:07,830 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:07,836 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:07,836 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 09:22:07,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:07,862 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:07,866 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:07,866 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:07,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:07,893 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:07,919 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:07,919 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:07,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:07,929 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:07,932 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:07,932 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 09:22:07,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:07,958 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:07,963 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:07,963 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:07,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:07,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:07,995 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:07,995 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,029 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,029 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,061 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,061 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,089 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,093 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,093 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~historyIndex=0} Honda state: {ULTIMATE.start_read_history_int8_~historyIndex=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,125 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,125 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post59=0} Honda state: {ULTIMATE.start_main_#t~post59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 09:22:08,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,142 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,146 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,146 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Honda state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,173 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,173 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,224 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,224 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_11=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,229 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,232 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,233 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,258 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,261 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,261 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_11=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_11=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,297 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:08,297 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_~history_id=3, ULTIMATE.start_write_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_~history_id=3, ULTIMATE.start_write_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:08,313 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:22:08,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:08,467 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:22:08,469 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:22:08,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:22:08,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:22:08,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:22:08,469 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:22:08,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:08,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:22:08,469 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:22:08,469 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration19_Loop [2018-11-10 09:22:08,469 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:22:08,469 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:22:08,473 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:22:08,517 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 7011 disjunctions. This might take some time... [2018-11-10 09:22:08,666 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 73 disjunctions. [2018-11-10 09:22:08,668 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-10 09:22:08,672 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-10 09:22:08,674 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-10 09:22:08,676 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-10 09:22:08,679 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-10 09:22:08,684 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-10 09:22:08,686 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-10 09:22:08,688 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-10 09:22:08,690 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-10 09:22:08,691 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-10 09:22:08,815 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2018-11-10 09:22:08,816 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-10 09:22:08,817 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-10 09:22:08,818 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-10 09:22:08,819 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-10 09:22:08,822 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-10 09:22:08,823 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-10 09:22:08,823 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-10 09:22:08,829 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-10 09:22:08,831 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-10 09:22:08,834 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-10 09:22:08,835 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-10 09:22:08,838 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-10 09:22:08,839 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-10 09:22:08,842 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-10 09:22:08,844 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-10 09:22:08,845 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-10 09:22:08,846 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-10 09:22:08,847 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-10 09:22:08,848 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-10 09:22:08,849 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-10 09:22:08,850 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-10 09:22:08,861 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-10 09:22:08,864 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-10 09:22:08,865 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-10 09:22:08,866 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-10 09:22:08,867 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-10 09:22:08,868 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-10 09:22:08,868 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-10 09:22:08,869 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-10 09:22:08,870 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-10 09:22:08,871 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-10 09:22:08,872 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-10 09:22:08,874 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-10 09:22:08,875 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-10 09:22:08,876 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-10 09:22:08,877 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-10 09:22:08,878 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-10 09:22:08,884 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-10 09:22:08,887 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-10 09:22:08,888 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-10 09:22:08,889 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-10 09:22:08,894 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-10 09:22:08,895 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-10 09:22:08,896 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-10 09:22:08,896 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-10 09:22:08,897 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-10 09:22:08,898 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-10 09:22:08,899 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-10 09:22:08,900 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-10 09:22:08,901 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-10 09:22:08,903 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-10 09:22:08,907 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-10 09:22:08,908 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-10 09:22:08,909 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-10 09:22:08,910 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-10 09:22:08,911 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-10 09:22:08,912 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-10 09:22:08,913 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-10 09:22:08,914 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-10 09:22:08,915 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-10 09:22:08,915 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-10 09:22:08,917 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-10 09:22:08,918 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-10 09:22:08,920 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-10 09:22:08,921 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-10 09:22:09,135 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 09:22:09,263 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-10 09:22:09,346 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 09:22:16,115 WARN L179 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 318 DAG size of output: 146 [2018-11-10 09:22:16,230 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:22:16,230 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:22:16,231 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-10 09:22:16,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,233 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-10 09:22:16,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,235 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-10 09:22:16,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,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-10 09:22:16,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,237 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-10 09:22:16,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,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-10 09:22:16,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,240 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-10 09:22:16,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,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-10 09:22:16,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,243 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-10 09:22:16,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:22:16,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:22:16,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,256 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-10 09:22:16,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,257 INFO L206 nArgumentSynthesizer]: 20 loop disjuncts [2018-11-10 09:22:16,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,282 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-10 09:22:16,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,407 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-10 09:22:16,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,408 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-10 09:22:16,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:22:16,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:22:16,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,411 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-10 09:22:16,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,412 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-10 09:22:16,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,414 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-10 09:22:16,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,416 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-10 09:22:16,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,417 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-10 09:22:16,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,418 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-10 09:22:16,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:22:16,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:22:16,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,420 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-10 09:22:16,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,422 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-10 09:22:16,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:16,424 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-10 09:22:16,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:16,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:16,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:16,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:16,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:16,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:16,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:16,425 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:22:16,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:22:16,426 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:22:16,426 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:22:16,426 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:22:16,427 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:22:16,427 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 09:22:16,427 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:22:16,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:16,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:22:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:16,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:22:16,690 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-10 09:22:16,690 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:22:16,690 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1216 states and 1745 transitions. cyclomatic complexity: 538 Second operand 5 states. [2018-11-10 09:22:16,724 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1216 states and 1745 transitions. cyclomatic complexity: 538. Second operand 5 states. Result 1856 states and 2667 transitions. Complement of second has 6 states. [2018-11-10 09:22:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:22:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:22:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 706 transitions. [2018-11-10 09:22:16,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 706 transitions. Stem has 59 letters. Loop has 53 letters. [2018-11-10 09:22:16,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:16,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 706 transitions. Stem has 112 letters. Loop has 53 letters. [2018-11-10 09:22:16,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:16,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 706 transitions. Stem has 59 letters. Loop has 106 letters. [2018-11-10 09:22:16,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:16,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1856 states and 2667 transitions. [2018-11-10 09:22:16,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 504 [2018-11-10 09:22:16,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1856 states to 1114 states and 1595 transitions. [2018-11-10 09:22:16,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 682 [2018-11-10 09:22:16,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 682 [2018-11-10 09:22:16,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1114 states and 1595 transitions. [2018-11-10 09:22:16,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:22:16,741 INFO L705 BuchiCegarLoop]: Abstraction has 1114 states and 1595 transitions. [2018-11-10 09:22:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states and 1595 transitions. [2018-11-10 09:22:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2018-11-10 09:22:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2018-11-10 09:22:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1595 transitions. [2018-11-10 09:22:16,751 INFO L728 BuchiCegarLoop]: Abstraction has 1114 states and 1595 transitions. [2018-11-10 09:22:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:22:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:22:16,751 INFO L87 Difference]: Start difference. First operand 1114 states and 1595 transitions. Second operand 4 states. [2018-11-10 09:22:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:22:16,856 INFO L93 Difference]: Finished difference Result 3545 states and 5070 transitions. [2018-11-10 09:22:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:22:16,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3545 states and 5070 transitions. [2018-11-10 09:22:16,863 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1706 [2018-11-10 09:22:16,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3545 states to 3545 states and 5070 transitions. [2018-11-10 09:22:16,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2208 [2018-11-10 09:22:16,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2208 [2018-11-10 09:22:16,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3545 states and 5070 transitions. [2018-11-10 09:22:16,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:22:16,873 INFO L705 BuchiCegarLoop]: Abstraction has 3545 states and 5070 transitions. [2018-11-10 09:22:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states and 5070 transitions. [2018-11-10 09:22:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 1088. [2018-11-10 09:22:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2018-11-10 09:22:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1546 transitions. [2018-11-10 09:22:16,888 INFO L728 BuchiCegarLoop]: Abstraction has 1088 states and 1546 transitions. [2018-11-10 09:22:16,888 INFO L608 BuchiCegarLoop]: Abstraction has 1088 states and 1546 transitions. [2018-11-10 09:22:16,888 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 09:22:16,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1088 states and 1546 transitions. [2018-11-10 09:22:16,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 492 [2018-11-10 09:22:16,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:22:16,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:22:16,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:22:16,892 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, 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-10 09:22:16,892 INFO L793 eck$LassoCheckResult]: Stem: 52562#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 52283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 52284#L116-3 assume true; 52701#L116-1 assume !!(add_history_type_~var~0 < 3); 52669#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 52497#L171 assume read_history_bool_~history_id == 0; 52498#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 52253#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 52485#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 52486#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 52702#L116-3 assume true; 52703#L116-1 assume !(add_history_type_~var~0 < 3); 52698#L116-4 add_history_type_#res := 1; 52514#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 52515#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 52656#L116-8 assume true; 52716#L116-6 assume !!(add_history_type_~var~0 < 3); 52654#L117-2 assume !(add_history_type_~history_id == 0); 52655#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 52704#L171-4 assume !(read_history_bool_~history_id == 0); 52577#L181-4 assume read_history_bool_~history_id == 1; 52578#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 52474#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 52333#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 52334#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 52717#L116-8 assume true; 52718#L116-6 assume !(add_history_type_~var~0 < 3); 52713#L116-9 add_history_type_#res := 1; 52568#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 52509#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 52510#L116-13 assume true; 52681#L116-11 assume !!(add_history_type_~var~0 < 3); 52650#L117-4 assume !(add_history_type_~history_id == 0); 52651#L123-4 assume !(add_history_type_~history_id == 1); 52745#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 52725#L171-8 assume !(read_history_bool_~history_id == 0); 52603#L181-8 assume !(read_history_bool_~history_id == 1); 52345#L191-8 assume read_history_bool_~history_id == 2; 52347#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 52605#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 52303#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 52304#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 52263#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 52264#L116-18 assume true; 52815#L116-16 assume !!(add_history_type_~var~0 < 3); 52634#L117-6 assume !(add_history_type_~history_id == 0); 52635#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 52714#L171-10 assume !(read_history_bool_~history_id == 0); 52597#L181-10 assume read_history_bool_~history_id == 1; 52598#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 52362#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 52317#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 52296#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 52563#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 52511#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 52512#L554-3 assume true; 52418#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 53235#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 53234#L236-2 assume { :end_inline_write_history_bool } true; 53233#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 53232#L396 assume !(gate1_each_pals_period_~next_state~0 == 0); 52581#L399 [2018-11-10 09:22:16,892 INFO L795 eck$LassoCheckResult]: Loop: 52581#L399 assume gate1_each_pals_period_~next_state~0 == 1;gate1_each_pals_period_~tmp___0~3 := 1; 52501#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 52506#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 52699#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 52640#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 52493#L226-2 assume !(write_history_bool_~history_id == 0); 52494#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 52520#L236-5 assume { :end_inline_write_history_bool } true; 52583#L421 assume ~gate2Failed~0 % 256 != 0; 52756#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 53226#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 53221#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 53219#L226-4 assume !(write_history_bool_~history_id == 0); 53217#L231-4 assume !(write_history_bool_~history_id == 1); 53209#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 53207#L236-8 assume { :end_inline_write_history_bool } true; 53205#L452 assume ~gate3Failed~0 % 256 != 0; 52662#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 52645#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 52646#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 53290#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 53283#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 53281#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 52790#L211-2 assume { :end_inline_write_history_int8 } true; 52791#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 52762#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 52753#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 53007#L171-12 assume read_history_bool_~history_id == 0; 53004#L172-12 assume !(read_history_bool_~historyIndex == 0); 53003#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 53002#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 52289#L307 assume !(check_~tmp___3~0 % 256 == 0); 52290#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 53000#L151-7 assume read_history_int8_~history_id == 3; 52998#L152-7 assume !(read_history_int8_~historyIndex == 0); 52997#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 52376#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 52377#L346 assume !(check_~tmp___10~0 > -2); 52649#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 52992#L151-9 assume read_history_int8_~history_id == 3; 52988#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 52989#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 53260#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 53244#L366-1 check_#res := 1; 52471#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 53242#L579-72 assume !(assert_~arg % 256 == 0); 53241#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 53240#L554-3 assume true; 52403#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 52404#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 52502#L236-2 assume { :end_inline_write_history_bool } true; 52620#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 52580#L396 assume !(gate1_each_pals_period_~next_state~0 == 0); 52581#L399 [2018-11-10 09:22:16,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash 260785083, now seen corresponding path program 1 times [2018-11-10 09:22:16,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:22:16,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:22:16,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:16,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:22:16,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:22:16,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:22:16,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:22:16,952 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:22:16,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1251444024, now seen corresponding path program 1 times [2018-11-10 09:22:16,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:22:16,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:22:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:16,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:22:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:22:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:22:17,483 WARN L179 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 221 [2018-11-10 09:22:18,970 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 190 DAG size of output: 171 [2018-11-10 09:22:18,972 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:22:18,972 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:22:18,972 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:22:18,972 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:22:18,972 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:22:18,972 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:18,972 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:22:18,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:22:18,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-10 09:22:18,973 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:22:18,973 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:22:18,988 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-10 09:22:18,991 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-10 09:22:18,993 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-10 09:22:18,995 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-10 09:22:18,996 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-10 09:22:18,997 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-10 09:22:18,998 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-10 09:22:18,999 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-10 09:22:19,000 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-10 09:22:19,001 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-10 09:22:19,002 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-10 09:22:19,006 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-10 09:22:19,007 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-10 09:22:19,009 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-10 09:22:19,010 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-10 09:22:19,012 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-10 09:22:19,013 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-10 09:22:19,014 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-10 09:22:19,017 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-10 09:22:19,018 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-10 09:22:19,019 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-10 09:22:19,021 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-10 09:22:19,022 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-10 09:22:19,023 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-10 09:22:19,024 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-10 09:22:19,025 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-10 09:22:19,027 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-10 09:22:19,028 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-10 09:22:19,031 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-10 09:22:19,032 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-10 09:22:19,033 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-10 09:22:19,034 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-10 09:22:19,141 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-11-10 09:22:19,141 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-10 09:22:19,143 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-10 09:22:19,144 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-10 09:22:19,145 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-10 09:22:19,146 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-10 09:22:19,146 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-10 09:22:19,149 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-10 09:22:19,150 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-10 09:22:19,151 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-10 09:22:19,152 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-10 09:22:19,152 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-10 09:22:19,154 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-10 09:22:19,154 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-10 09:22:19,155 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-10 09:22:19,156 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-10 09:22:19,168 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-10 09:22:19,169 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-10 09:22:19,169 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-10 09:22:19,170 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-10 09:22:19,172 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-10 09:22:19,174 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-10 09:22:19,175 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-10 09:22:19,176 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-10 09:22:19,177 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-10 09:22:19,178 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-10 09:22:19,178 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-10 09:22:19,179 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-10 09:22:19,180 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-10 09:22:19,181 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-10 09:22:19,186 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-10 09:22:19,187 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-10 09:22:19,188 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-10 09:22:19,189 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-10 09:22:19,190 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-10 09:22:19,193 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-10 09:22:19,194 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-10 09:22:19,194 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-10 09:22:19,195 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-10 09:22:19,196 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-10 09:22:19,197 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-10 09:22:19,202 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-10 09:22:19,203 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-10 09:22:19,204 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-10 09:22:19,205 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-10 09:22:19,206 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-10 09:22:19,385 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-10 09:22:19,499 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-11-10 09:22:19,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 09:22:24,131 WARN L179 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 191 DAG size of output: 143 [2018-11-10 09:22:24,222 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:22:24,222 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,233 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,249 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,249 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret21=0} Honda state: {ULTIMATE.start_check_#t~ret21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,274 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,277 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,277 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 09:22:24,296 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,296 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,322 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,322 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,331 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,331 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,352 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,352 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___1~2=0} Honda state: {ULTIMATE.start_check_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,381 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,382 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_13=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,401 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,401 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,419 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,419 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,425 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,425 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret18=0} Honda state: {ULTIMATE.start_check_#t~ret18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,466 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,466 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret12=0} Honda state: {ULTIMATE.start_check_#t~ret12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,485 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,485 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,501 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,505 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,505 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,533 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,533 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,577 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,577 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,581 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,597 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,597 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,603 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,603 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_13=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 09:22:24,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,620 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,622 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,623 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,651 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,651 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret14=0} Honda state: {ULTIMATE.start_check_#t~ret14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,670 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,673 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,673 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,697 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,697 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post13=0} Honda state: {ULTIMATE.start_check_#t~post13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,721 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,721 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,741 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,757 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,757 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_13=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_13=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,760 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,762 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,762 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,788 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,788 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp~4=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,804 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,806 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,806 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___0~2=0} Honda state: {ULTIMATE.start_check_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,826 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,827 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post17=0} Honda state: {ULTIMATE.start_check_#t~post17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,843 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,859 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,859 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_13=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,863 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,866 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,866 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___5~0=0} Honda state: {ULTIMATE.start_check_~tmp___5~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,882 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,885 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,885 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,904 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,906 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,906 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret19=0} Honda state: {ULTIMATE.start_check_#t~ret19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,925 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,930 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,931 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___13~0=0} Honda state: {ULTIMATE.start_check_~tmp___13~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:24,949 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:24,950 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret11=0} Honda state: {ULTIMATE.start_check_#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:24,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:24,969 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:25,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:22:25,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:38,035 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 09:22:38,044 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:22:38,044 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:22:38,044 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:22:38,044 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:22:38,044 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:22:38,044 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:38,045 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:22:38,045 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:22:38,045 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-10 09:22:38,045 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:22:38,045 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:22:38,060 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-10 09:22:38,062 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-10 09:22:38,062 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-10 09:22:38,065 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-10 09:22:38,066 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-10 09:22:38,067 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-10 09:22:38,068 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-10 09:22:38,069 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-10 09:22:38,070 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-10 09:22:38,071 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-10 09:22:38,071 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-10 09:22:38,074 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-10 09:22:38,075 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-10 09:22:38,076 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-10 09:22:38,077 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-10 09:22:38,078 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-10 09:22:38,080 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-10 09:22:38,082 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-10 09:22:38,082 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-10 09:22:38,083 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-10 09:22:38,084 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-10 09:22:38,085 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-10 09:22:38,086 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-10 09:22:38,087 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-10 09:22:38,087 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-10 09:22:38,088 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-10 09:22:38,089 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-10 09:22:38,090 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-10 09:22:38,091 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-10 09:22:38,094 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-10 09:22:38,094 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-10 09:22:38,095 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-10 09:22:38,096 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-10 09:22:38,097 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-10 09:22:38,098 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-10 09:22:38,099 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-10 09:22:38,102 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-10 09:22:38,103 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-10 09:22:38,104 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-10 09:22:38,105 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-10 09:22:38,105 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-10 09:22:38,106 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-10 09:22:38,212 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-11-10 09:22:38,212 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-10 09:22:38,213 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-10 09:22:38,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-10 09:22:38,215 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-10 09:22:38,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-10 09:22:38,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-10 09:22:38,217 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-10 09:22:38,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-10 09:22:38,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-10 09:22:38,230 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-10 09:22:38,231 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-10 09:22:38,232 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-10 09:22:38,233 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-10 09:22:38,234 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-10 09:22:38,234 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-10 09:22:38,235 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-10 09:22:38,236 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-10 09:22:38,236 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-10 09:22:38,238 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-10 09:22:38,243 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-10 09:22:38,245 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-10 09:22:38,246 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-10 09:22:38,247 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-10 09:22:38,248 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-10 09:22:38,249 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-10 09:22:38,250 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-10 09:22:38,251 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-10 09:22:38,252 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-10 09:22:38,253 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-10 09:22:38,258 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-10 09:22:38,259 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-10 09:22:38,260 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-10 09:22:38,261 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-10 09:22:38,262 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-10 09:22:38,262 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-10 09:22:38,449 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-10 09:22:38,554 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-11-10 09:22:38,615 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 09:22:43,203 WARN L179 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 191 DAG size of output: 143 [2018-11-10 09:22:43,283 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:22:43,284 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:22:43,284 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-10 09:22:43,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,286 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-10 09:22:43,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,287 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-10 09:22:43,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,289 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-10 09:22:43,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,290 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-10 09:22:43,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,291 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-10 09:22:43,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,292 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-10 09:22:43,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:22:43,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:22:43,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,295 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-10 09:22:43,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,296 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-10 09:22:43,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,298 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-10 09:22:43,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,299 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-10 09:22:43,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,301 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-10 09:22:43,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,302 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-10 09:22:43,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,304 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-10 09:22:43,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,305 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-10 09:22:43,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,307 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-10 09:22:43,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,309 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-10 09:22:43,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:22:43,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:22:43,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,311 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-10 09:22:43,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,312 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-10 09:22:43,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,314 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-10 09:22:43,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,315 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-10 09:22:43,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,316 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-10 09:22:43,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:22:43,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:22:43,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,319 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-10 09:22:43,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,320 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-10 09:22:43,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,322 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-10 09:22:43,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,323 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-10 09:22:43,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,324 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-10 09:22:43,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,326 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-10 09:22:43,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,328 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-10 09:22:43,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,329 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-10 09:22:43,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,331 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-10 09:22:43,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,332 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-10 09:22:43,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,334 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-10 09:22:43,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,335 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-10 09:22:43,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,337 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-10 09:22:43,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:43,338 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-10 09:22:43,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:43,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:43,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:43,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:43,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:43,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:43,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:43,340 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:22:43,340 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:22:43,340 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:22:43,340 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:22:43,341 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:22:43,341 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:22:43,341 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 09:22:43,341 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:22:43,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:43,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:22:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:43,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:22:43,432 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-10 09:22:43,433 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:22:43,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1088 states and 1546 transitions. cyclomatic complexity: 467 Second operand 5 states. [2018-11-10 09:22:43,455 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1088 states and 1546 transitions. cyclomatic complexity: 467. Second operand 5 states. Result 1609 states and 2295 transitions. Complement of second has 6 states. [2018-11-10 09:22:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:22:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:22:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 660 transitions. [2018-11-10 09:22:43,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 660 transitions. Stem has 61 letters. Loop has 53 letters. [2018-11-10 09:22:43,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:43,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 660 transitions. Stem has 114 letters. Loop has 53 letters. [2018-11-10 09:22:43,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:43,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 660 transitions. Stem has 61 letters. Loop has 106 letters. [2018-11-10 09:22:43,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:43,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1609 states and 2295 transitions. [2018-11-10 09:22:43,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 490 [2018-11-10 09:22:43,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1609 states to 1086 states and 1539 transitions. [2018-11-10 09:22:43,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 664 [2018-11-10 09:22:43,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 664 [2018-11-10 09:22:43,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1086 states and 1539 transitions. [2018-11-10 09:22:43,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:22:43,463 INFO L705 BuchiCegarLoop]: Abstraction has 1086 states and 1539 transitions. [2018-11-10 09:22:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states and 1539 transitions. [2018-11-10 09:22:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2018-11-10 09:22:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-11-10 09:22:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1539 transitions. [2018-11-10 09:22:43,471 INFO L728 BuchiCegarLoop]: Abstraction has 1086 states and 1539 transitions. [2018-11-10 09:22:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:22:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:22:43,472 INFO L87 Difference]: Start difference. First operand 1086 states and 1539 transitions. Second operand 4 states. [2018-11-10 09:22:43,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:22:43,497 INFO L93 Difference]: Finished difference Result 2015 states and 2862 transitions. [2018-11-10 09:22:43,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:22:43,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2015 states and 2862 transitions. [2018-11-10 09:22:43,501 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 980 [2018-11-10 09:22:43,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2015 states to 2013 states and 2860 transitions. [2018-11-10 09:22:43,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1258 [2018-11-10 09:22:43,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1258 [2018-11-10 09:22:43,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2013 states and 2860 transitions. [2018-11-10 09:22:43,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:22:43,506 INFO L705 BuchiCegarLoop]: Abstraction has 2013 states and 2860 transitions. [2018-11-10 09:22:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states and 2860 transitions. [2018-11-10 09:22:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1086. [2018-11-10 09:22:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-11-10 09:22:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1538 transitions. [2018-11-10 09:22:43,517 INFO L728 BuchiCegarLoop]: Abstraction has 1086 states and 1538 transitions. [2018-11-10 09:22:43,517 INFO L608 BuchiCegarLoop]: Abstraction has 1086 states and 1538 transitions. [2018-11-10 09:22:43,517 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 09:22:43,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1086 states and 1538 transitions. [2018-11-10 09:22:43,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 490 [2018-11-10 09:22:43,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:22:43,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:22:43,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 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, 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-10 09:22:43,520 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, 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-10 09:22:43,520 INFO L793 eck$LassoCheckResult]: Stem: 58723#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 58449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 58450#L116-3 assume true; 58862#L116-1 assume !!(add_history_type_~var~0 < 3); 58829#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 58660#L171 assume read_history_bool_~history_id == 0; 58661#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 58419#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 58648#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 58649#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 58863#L116-3 assume true; 58864#L116-1 assume !(add_history_type_~var~0 < 3); 58859#L116-4 add_history_type_#res := 1; 58676#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 58677#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 58815#L116-8 assume true; 58876#L116-6 assume !!(add_history_type_~var~0 < 3); 58813#L117-2 assume !(add_history_type_~history_id == 0); 58814#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 58865#L171-4 assume !(read_history_bool_~history_id == 0); 58740#L181-4 assume read_history_bool_~history_id == 1; 58741#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 58637#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 58498#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 58499#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 58877#L116-8 assume true; 58878#L116-6 assume !(add_history_type_~var~0 < 3); 58873#L116-9 add_history_type_#res := 1; 58730#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 58671#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 58672#L116-13 assume true; 58841#L116-11 assume !!(add_history_type_~var~0 < 3); 58809#L117-4 assume !(add_history_type_~history_id == 0); 58810#L123-4 assume !(add_history_type_~history_id == 1); 58912#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 58886#L171-8 assume !(read_history_bool_~history_id == 0); 58765#L181-8 assume !(read_history_bool_~history_id == 1); 58510#L191-8 assume read_history_bool_~history_id == 2; 58512#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 58767#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 58469#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 58470#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 58894#L116-13 assume true; 58969#L116-11 assume !(add_history_type_~var~0 < 3); 58839#L116-14 add_history_type_#res := 1; 58725#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 58429#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 58430#L116-18 assume true; 58852#L116-16 assume !!(add_history_type_~var~0 < 3); 58794#L117-6 assume !(add_history_type_~history_id == 0); 58795#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 58874#L171-10 assume !(read_history_bool_~history_id == 0); 58759#L181-10 assume read_history_bool_~history_id == 1; 58760#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 58527#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 58482#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 58456#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 58724#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 58673#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 58674#L554-3 assume true; 59100#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 59399#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 59398#L236-2 assume { :end_inline_write_history_bool } true; 59397#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 59396#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 59395#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 59394#L408 assume !(gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite30 := ~g1v_new~0; 58860#L408-2 [2018-11-10 09:22:43,520 INFO L795 eck$LassoCheckResult]: Loop: 58860#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 58800#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 58656#L226-2 assume !(write_history_bool_~history_id == 0); 58657#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 58682#L236-5 assume { :end_inline_write_history_bool } true; 58745#L421 assume ~gate2Failed~0 % 256 != 0; 58925#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 59393#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 59391#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 59389#L226-4 assume !(write_history_bool_~history_id == 0); 59387#L231-4 assume !(write_history_bool_~history_id == 1); 59386#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 59381#L236-8 assume { :end_inline_write_history_bool } true; 59379#L452 assume ~gate3Failed~0 % 256 != 0; 59377#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 59373#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 59371#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 59356#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 59324#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 59318#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 59313#L211-2 assume { :end_inline_write_history_int8 } true; 59312#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 59196#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 59194#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 59192#L171-12 assume read_history_bool_~history_id == 0; 59193#L172-12 assume !(read_history_bool_~historyIndex == 0); 58789#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 58750#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 58751#L307 assume !(check_~tmp___3~0 % 256 == 0); 58466#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 58467#L151-7 assume read_history_int8_~history_id == 3; 58536#L152-7 assume !(read_history_int8_~historyIndex == 0); 58537#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 58540#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 58541#L346 assume !(check_~tmp___10~0 > -2); 58773#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 58774#L151-9 assume read_history_int8_~history_id == 3; 58516#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 58517#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 58530#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 58631#L366-1 check_#res := 1; 58616#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 58617#L579-72 assume !(assert_~arg % 256 == 0); 58650#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 58581#L554-3 assume true; 58567#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 58568#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 58663#L236-2 assume { :end_inline_write_history_bool } true; 58777#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 58743#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 58667#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 58668#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 58860#L408-2 [2018-11-10 09:22:43,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash 220950912, now seen corresponding path program 1 times [2018-11-10 09:22:43,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:22:43,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:22:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:43,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:22:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:22:43,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:22:43,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:22:43,612 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:22:43,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1512088039, now seen corresponding path program 2 times [2018-11-10 09:22:43,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:22:43,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:22:43,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:43,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:22:43,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:22:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:22:44,283 WARN L179 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 217 [2018-11-10 09:22:46,900 WARN L179 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 190 DAG size of output: 179 [2018-11-10 09:22:46,902 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:22:46,902 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:22:46,902 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:22:46,902 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:22:46,902 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:22:46,902 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:46,902 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:22:46,902 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:22:46,902 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2018-11-10 09:22:46,903 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:22:46,903 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:22:46,905 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 09:22:47,012 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-10 09:22:47,016 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-10 09:22:47,021 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-10 09:22:47,032 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-10 09:22:47,034 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-10 09:22:47,035 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-10 09:22:47,038 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-10 09:22:47,039 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-10 09:22:47,040 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-10 09:22:47,041 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-10 09:22:47,042 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-10 09:22:47,044 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-10 09:22:47,045 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-10 09:22:47,046 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-10 09:22:47,047 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-10 09:22:47,050 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-10 09:22:47,053 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-10 09:22:47,054 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-10 09:22:47,055 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-10 09:22:47,056 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-10 09:22:47,057 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-10 09:22:47,058 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-10 09:22:47,059 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-10 09:22:47,059 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-10 09:22:47,060 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-10 09:22:47,061 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-10 09:22:47,062 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-10 09:22:47,063 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-10 09:22:47,065 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-10 09:22:47,066 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-10 09:22:47,067 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-10 09:22:47,068 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-10 09:22:47,069 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-10 09:22:47,070 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-10 09:22:47,072 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-10 09:22:47,072 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-10 09:22:47,073 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-10 09:22:47,074 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-10 09:22:47,076 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-10 09:22:47,077 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-10 09:22:47,078 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-10 09:22:47,079 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-10 09:22:47,083 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-10 09:22:47,084 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-10 09:22:47,085 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-10 09:22:47,086 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-10 09:22:47,087 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-10 09:22:47,100 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-10 09:22:47,101 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-10 09:22:47,102 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-10 09:22:47,103 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-10 09:22:47,104 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-10 09:22:47,244 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-10 09:22:47,244 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-10 09:22:47,246 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-10 09:22:47,247 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-10 09:22:47,252 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-10 09:22:47,256 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-10 09:22:47,257 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-10 09:22:47,259 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-10 09:22:47,259 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-10 09:22:47,260 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-10 09:22:47,261 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-10 09:22:47,262 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-10 09:22:47,263 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-10 09:22:47,264 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-10 09:22:47,265 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-10 09:22:47,266 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-10 09:22:47,267 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-10 09:22:47,268 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-10 09:22:47,269 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-10 09:22:47,271 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-10 09:22:47,272 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-10 09:22:47,273 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-10 09:22:47,274 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-10 09:22:47,275 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-10 09:22:47,585 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-10 09:22:47,655 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 09:22:52,934 WARN L179 SmtUtils]: Spent 5.19 s on a formula simplification. DAG size of input: 255 DAG size of output: 143 [2018-11-10 09:22:52,977 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:22:52,977 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:52,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:52,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:52,985 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:52,985 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,005 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,005 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,029 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,029 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___1~2=0} Honda state: {ULTIMATE.start_check_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,049 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,049 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret25=0} Honda state: {ULTIMATE.start_check_#t~ret25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,067 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,068 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,086 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,089 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,089 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,112 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,112 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret21=0} Honda state: {ULTIMATE.start_check_#t~ret21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,131 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,132 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_15=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_15=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,148 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,153 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,153 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,173 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,173 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret16=0} Honda state: {ULTIMATE.start_check_#t~ret16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,192 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,192 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Honda state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,212 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,212 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret12=0} Honda state: {ULTIMATE.start_check_#t~ret12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,230 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,230 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,268 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,268 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_15=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_15=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,275 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:22:53,275 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:22:53,291 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:22:53,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:22:53,438 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:22:53,439 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:22:53,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:22:53,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:22:53,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:22:53,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:22:53,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:22:53,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:22:53,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:22:53,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2018-11-10 09:22:53,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:22:53,440 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:22:53,441 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 09:22:53,547 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-10 09:22:53,553 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-10 09:22:53,554 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-10 09:22:53,557 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-10 09:22:53,559 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-10 09:22:53,560 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-10 09:22:53,565 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-10 09:22:53,566 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-10 09:22:53,567 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-10 09:22:53,568 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-10 09:22:53,568 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-10 09:22:53,569 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-10 09:22:53,570 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-10 09:22:53,571 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-10 09:22:53,572 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-10 09:22:53,575 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-10 09:22:53,578 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-10 09:22:53,579 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-10 09:22:53,580 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-10 09:22:53,581 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-10 09:22:53,582 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-10 09:22:53,583 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-10 09:22:53,584 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-10 09:22:53,587 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-10 09:22:53,590 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-10 09:22:53,591 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-10 09:22:53,592 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-10 09:22:53,593 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-10 09:22:53,594 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-10 09:22:53,595 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-10 09:22:53,596 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-10 09:22:53,597 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-10 09:22:53,598 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-10 09:22:53,598 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-10 09:22:53,599 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-10 09:22:53,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-10 09:22:53,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-10 09:22:53,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-10 09:22:53,603 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-10 09:22:53,603 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-10 09:22:53,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-10 09:22:53,606 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-10 09:22:53,606 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-10 09:22:53,609 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-10 09:22:53,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-10 09:22:53,613 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-10 09:22:53,613 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-10 09:22:53,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-10 09:22:53,627 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-10 09:22:53,628 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-10 09:22:53,629 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-10 09:22:53,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-10 09:22:53,631 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-10 09:22:53,759 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-10 09:22:53,760 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-10 09:22:53,761 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-10 09:22:53,762 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-10 09:22:53,766 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-10 09:22:53,771 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-10 09:22:53,772 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-10 09:22:53,773 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-10 09:22:53,774 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-10 09:22:53,775 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-10 09:22:53,776 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-10 09:22:53,777 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-10 09:22:53,778 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-10 09:22:53,779 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-10 09:22:53,780 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-10 09:22:53,781 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-10 09:22:53,782 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-10 09:22:53,782 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-10 09:22:53,784 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-10 09:22:53,785 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-10 09:22:53,787 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-10 09:22:53,788 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-10 09:22:53,789 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-10 09:22:54,075 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-10 09:22:54,145 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 09:22:59,435 WARN L179 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 255 DAG size of output: 143 [2018-11-10 09:22:59,479 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:22:59,479 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:22:59,479 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-10 09:22:59,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,485 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-10 09:22:59,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,486 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-10 09:22:59,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,487 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-10 09:22:59,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,488 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-10 09:22:59,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,488 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-10 09:22:59,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,490 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-10 09:22:59,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,491 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-10 09:22:59,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:22:59,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:22:59,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,493 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-10 09:22:59,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,495 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-10 09:22:59,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,496 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-10 09:22:59,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,498 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-10 09:22:59,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,499 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-10 09:22:59,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,500 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-10 09:22:59,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:22:59,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:22:59,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,503 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-10 09:22:59,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:22:59,504 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-10 09:22:59,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:22:59,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:22:59,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:22:59,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:22:59,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:22:59,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:22:59,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:22:59,506 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:22:59,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:22:59,507 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:22:59,507 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:22:59,507 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:22:59,507 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:22:59,507 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 09:22:59,507 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:22:59,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:59,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:22:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:59,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:22:59,656 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-10 09:22:59,656 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:22:59,656 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1086 states and 1538 transitions. cyclomatic complexity: 461 Second operand 5 states. [2018-11-10 09:22:59,671 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1086 states and 1538 transitions. cyclomatic complexity: 461. Second operand 5 states. Result 1604 states and 2277 transitions. Complement of second has 6 states. [2018-11-10 09:22:59,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:22:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:22:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 652 transitions. [2018-11-10 09:22:59,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 652 transitions. Stem has 67 letters. Loop has 52 letters. [2018-11-10 09:22:59,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:59,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 652 transitions. Stem has 119 letters. Loop has 52 letters. [2018-11-10 09:22:59,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:59,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 652 transitions. Stem has 67 letters. Loop has 104 letters. [2018-11-10 09:22:59,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:22:59,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1604 states and 2277 transitions. [2018-11-10 09:22:59,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 490 [2018-11-10 09:22:59,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1604 states to 1086 states and 1535 transitions. [2018-11-10 09:22:59,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 664 [2018-11-10 09:22:59,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 664 [2018-11-10 09:22:59,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1086 states and 1535 transitions. [2018-11-10 09:22:59,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:22:59,678 INFO L705 BuchiCegarLoop]: Abstraction has 1086 states and 1535 transitions. [2018-11-10 09:22:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states and 1535 transitions. [2018-11-10 09:22:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2018-11-10 09:22:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-11-10 09:22:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1535 transitions. [2018-11-10 09:22:59,686 INFO L728 BuchiCegarLoop]: Abstraction has 1086 states and 1535 transitions. [2018-11-10 09:22:59,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:22:59,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:22:59,686 INFO L87 Difference]: Start difference. First operand 1086 states and 1535 transitions. Second operand 3 states. [2018-11-10 09:22:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:22:59,709 INFO L93 Difference]: Finished difference Result 1032 states and 1453 transitions. [2018-11-10 09:22:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:22:59,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1032 states and 1453 transitions. [2018-11-10 09:22:59,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 490 [2018-11-10 09:22:59,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1032 states to 1032 states and 1453 transitions. [2018-11-10 09:22:59,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 641 [2018-11-10 09:22:59,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 641 [2018-11-10 09:22:59,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1032 states and 1453 transitions. [2018-11-10 09:22:59,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:22:59,714 INFO L705 BuchiCegarLoop]: Abstraction has 1032 states and 1453 transitions. [2018-11-10 09:22:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states and 1453 transitions. [2018-11-10 09:22:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2018-11-10 09:22:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-10 09:22:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1453 transitions. [2018-11-10 09:22:59,722 INFO L728 BuchiCegarLoop]: Abstraction has 1032 states and 1453 transitions. [2018-11-10 09:22:59,722 INFO L608 BuchiCegarLoop]: Abstraction has 1032 states and 1453 transitions. [2018-11-10 09:22:59,722 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 09:22:59,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1032 states and 1453 transitions. [2018-11-10 09:22:59,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 490 [2018-11-10 09:22:59,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:22:59,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:22:59,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:22:59,724 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, 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-10 09:22:59,724 INFO L793 eck$LassoCheckResult]: Stem: 63890#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 63631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 63632#L116-3 assume true; 64021#L116-1 assume !!(add_history_type_~var~0 < 3); 63990#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 63825#L171 assume read_history_bool_~history_id == 0; 63826#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 63604#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 63813#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 63814#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 64022#L116-3 assume true; 64023#L116-1 assume !(add_history_type_~var~0 < 3); 64018#L116-4 add_history_type_#res := 1; 63841#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 63842#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 63974#L116-8 assume true; 64030#L116-6 assume !!(add_history_type_~var~0 < 3); 63972#L117-2 assume !(add_history_type_~history_id == 0); 63973#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 64024#L171-4 assume !(read_history_bool_~history_id == 0); 63907#L181-4 assume read_history_bool_~history_id == 1; 63908#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 63799#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 63668#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 63669#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 64031#L116-8 assume true; 64032#L116-6 assume !(add_history_type_~var~0 < 3); 64029#L116-9 add_history_type_#res := 1; 63898#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 63833#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 63834#L116-13 assume true; 64121#L116-11 assume !!(add_history_type_~var~0 < 3); 63968#L117-4 assume !(add_history_type_~history_id == 0); 63969#L123-4 assume !(add_history_type_~history_id == 1); 64061#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 64039#L171-8 assume !(read_history_bool_~history_id == 0); 63921#L181-8 assume !(read_history_bool_~history_id == 1); 63678#L191-8 assume read_history_bool_~history_id == 2; 63680#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 63923#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 63643#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 63644#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 64002#L116-13 assume true; 64003#L116-11 assume !(add_history_type_~var~0 < 3); 64000#L116-14 add_history_type_#res := 1; 63893#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 63617#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 63618#L116-18 assume true; 64013#L116-16 assume !!(add_history_type_~var~0 < 3); 63954#L117-6 assume !(add_history_type_~history_id == 0); 63955#L123-6 assume !(add_history_type_~history_id == 1); 64053#L129-6 assume !(add_history_type_~history_id == 2); 63789#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 63790#L151-3 assume read_history_int8_~history_id == 3; 63800#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 63802#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 63809#L137-3 assume !(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0);add_history_type_#res := 0; 63891#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 63892#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 63839#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 63840#L554-3 assume true; 64288#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 64435#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 64433#L236-2 assume { :end_inline_write_history_bool } true; 64432#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 64430#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 64428#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 64426#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 64424#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 64423#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 64422#L226-2 assume !(write_history_bool_~history_id == 0); 64420#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 64417#L236-5 assume { :end_inline_write_history_bool } true; 64415#L421 assume ~gate2Failed~0 % 256 != 0; 64416#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 64579#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 64578#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 64577#L226-4 assume !(write_history_bool_~history_id == 0); 64576#L231-4 assume !(write_history_bool_~history_id == 1); 64573#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 64572#L236-8 assume { :end_inline_write_history_bool } true; 64571#L452 assume ~gate3Failed~0 % 256 != 0; 63981#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 63964#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 63965#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 63978#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 63878#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 64104#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 64097#L211-2 [2018-11-10 09:22:59,724 INFO L795 eck$LassoCheckResult]: Loop: 64097#L211-2 assume { :end_inline_write_history_int8 } true; 64098#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 64331#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 64329#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 64327#L171-12 assume read_history_bool_~history_id == 0; 64326#L172-12 assume !(read_history_bool_~historyIndex == 0); 64325#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 63918#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 63919#L307 assume !(check_~tmp___3~0 % 256 == 0); 63647#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 63648#L151-7 assume read_history_int8_~history_id == 3; 63700#L152-7 assume !(read_history_int8_~historyIndex == 0); 63701#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 63704#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 63705#L346 assume !(check_~tmp___10~0 > -2); 63930#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 63931#L151-9 assume read_history_int8_~history_id == 3; 63688#L152-9 assume !(read_history_int8_~historyIndex == 0); 63690#L155-9 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 63986#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 64274#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 63795#L366-1 check_#res := 1; 63779#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 63780#L579-72 assume !(assert_~arg % 256 == 0); 63815#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 63741#L554-3 assume true; 63731#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 63732#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 63828#L236-2 assume { :end_inline_write_history_bool } true; 63939#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 63910#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 63835#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 63836#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 64019#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 63959#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 63821#L226-2 assume !(write_history_bool_~history_id == 0); 63822#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 63846#L236-5 assume { :end_inline_write_history_bool } true; 63913#L421 assume ~gate2Failed~0 % 256 != 0; 64071#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 64502#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 64501#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 64500#L226-4 assume !(write_history_bool_~history_id == 0); 64499#L231-4 assume !(write_history_bool_~history_id == 1); 64496#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 64495#L236-8 assume { :end_inline_write_history_bool } true; 64493#L452 assume ~gate3Failed~0 % 256 != 0; 64494#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 64620#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 64618#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 64616#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 64608#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 64605#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 64097#L211-2 [2018-11-10 09:22:59,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash -267446180, now seen corresponding path program 1 times [2018-11-10 09:22:59,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:22:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:22:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:59,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:22:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:22:59,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:22:59,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:22:59,843 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:22:59,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:59,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1285762218, now seen corresponding path program 1 times [2018-11-10 09:22:59,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:22:59,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:22:59,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:59,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:22:59,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:59,879 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-10 09:22:59,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:22:59,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:22:59,899 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:22:59,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:22:59,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:22:59,900 INFO L87 Difference]: Start difference. First operand 1032 states and 1453 transitions. cyclomatic complexity: 428 Second operand 3 states. [2018-11-10 09:22:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:22:59,933 INFO L93 Difference]: Finished difference Result 1011 states and 1382 transitions. [2018-11-10 09:22:59,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:22:59,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1011 states and 1382 transitions. [2018-11-10 09:22:59,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 474 [2018-11-10 09:22:59,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1011 states to 1011 states and 1382 transitions. [2018-11-10 09:22:59,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 627 [2018-11-10 09:22:59,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 627 [2018-11-10 09:22:59,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1011 states and 1382 transitions. [2018-11-10 09:22:59,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:22:59,940 INFO L705 BuchiCegarLoop]: Abstraction has 1011 states and 1382 transitions. [2018-11-10 09:22:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states and 1382 transitions. [2018-11-10 09:22:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1004. [2018-11-10 09:22:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2018-11-10 09:22:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1375 transitions. [2018-11-10 09:22:59,961 INFO L728 BuchiCegarLoop]: Abstraction has 1004 states and 1375 transitions. [2018-11-10 09:22:59,961 INFO L608 BuchiCegarLoop]: Abstraction has 1004 states and 1375 transitions. [2018-11-10 09:22:59,961 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 09:22:59,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1004 states and 1375 transitions. [2018-11-10 09:22:59,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 473 [2018-11-10 09:22:59,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:22:59,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:22:59,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:22:59,964 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, 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-10 09:22:59,965 INFO L793 eck$LassoCheckResult]: Stem: 65922#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 65682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 65683#L116-3 assume true; 66051#L116-1 assume !!(add_history_type_~var~0 < 3); 66019#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 65861#L171 assume read_history_bool_~history_id == 0; 65862#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 65655#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 65849#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 65850#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 66052#L116-3 assume true; 66053#L116-1 assume !(add_history_type_~var~0 < 3); 66048#L116-4 add_history_type_#res := 1; 65876#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 65877#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 66004#L116-8 assume true; 66063#L116-6 assume !!(add_history_type_~var~0 < 3); 66002#L117-2 assume !(add_history_type_~history_id == 0); 66003#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 66054#L171-4 assume !(read_history_bool_~history_id == 0); 65940#L181-4 assume read_history_bool_~history_id == 1; 65941#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 65837#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 65719#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 65720#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 66064#L116-8 assume true; 66065#L116-6 assume !(add_history_type_~var~0 < 3); 66062#L116-9 add_history_type_#res := 1; 65930#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 65868#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 65869#L116-13 assume true; 66031#L116-11 assume !!(add_history_type_~var~0 < 3); 65997#L117-4 assume !(add_history_type_~history_id == 0); 65998#L123-4 assume !(add_history_type_~history_id == 1); 66099#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 66073#L171-8 assume !(read_history_bool_~history_id == 0); 65953#L181-8 assume !(read_history_bool_~history_id == 1); 65729#L191-8 assume read_history_bool_~history_id == 2; 65731#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 65955#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 65694#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 65695#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 66081#L116-13 assume true; 66036#L116-11 assume !(add_history_type_~var~0 < 3); 66029#L116-14 add_history_type_#res := 1; 65925#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 65668#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 65669#L116-18 assume true; 66041#L116-16 assume !!(add_history_type_~var~0 < 3); 65983#L117-6 assume !(add_history_type_~history_id == 0); 65984#L123-6 assume !(add_history_type_~history_id == 1); 66091#L129-6 assume !(add_history_type_~history_id == 2); 65827#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 65828#L151-3 assume read_history_int8_~history_id == 3; 65838#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 65839#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 65845#L137-3 assume !(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0);add_history_type_#res := 0; 65923#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 65924#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 65874#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 65875#L554-3 assume true; 65774#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 65775#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 65864#L236-2 assume { :end_inline_write_history_bool } true; 65970#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 65943#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 65870#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 65871#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 66049#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 65988#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 65857#L226-2 assume !(write_history_bool_~history_id == 0); 65858#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 65881#L236-5 assume { :end_inline_write_history_bool } true; 65945#L421 assume ~gate2Failed~0 % 256 != 0; 65804#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 65735#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 65736#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 65932#L226-4 assume !(write_history_bool_~history_id == 0); 65926#L231-4 assume !(write_history_bool_~history_id == 1); 65927#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 65935#L236-8 assume { :end_inline_write_history_bool } true; 65959#L452 assume ~gate3Failed~0 % 256 != 0; 66634#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 66633#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 66632#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 66631#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 66609#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 66529#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 66525#L211-2 [2018-11-10 09:22:59,965 INFO L795 eck$LassoCheckResult]: Loop: 66525#L211-2 assume { :end_inline_write_history_int8 } true; 66523#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 66349#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 66346#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 66345#L171-12 assume read_history_bool_~history_id == 0; 66006#L172-12 assume !(read_history_bool_~historyIndex == 0); 66007#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 66331#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 65688#L307 assume !(check_~tmp___3~0 % 256 == 0); 65689#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 66089#L151-7 assume read_history_int8_~history_id == 3; 66090#L152-7 assume !(read_history_int8_~historyIndex == 0); 66017#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 66018#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 65981#L346 assume !(check_~tmp___10~0 > -2); 65962#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 65963#L151-9 assume read_history_int8_~history_id == 3; 65739#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 65740#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 66085#L366 assume check_~tmp___11~0 != ~nomsg~0;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 66086#L151-10 assume read_history_int8_~history_id == 3; 66504#L152-10 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 66503#L163-10 check_#t~ret24 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 66502#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 65834#L366-1 check_#res := 1; 65833#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 66508#L579-72 assume !(assert_~arg % 256 == 0); 66507#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 66506#L554-3 assume true; 66505#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 66497#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 66496#L236-2 assume { :end_inline_write_history_bool } true; 66495#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 66493#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 66491#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 66489#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 66487#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 66485#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 66483#L226-2 assume !(write_history_bool_~history_id == 0); 66479#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 66475#L236-5 assume { :end_inline_write_history_bool } true; 66472#L421 assume ~gate2Failed~0 % 256 != 0; 66473#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 66592#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 66590#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 66588#L226-4 assume !(write_history_bool_~history_id == 0); 66586#L231-4 assume !(write_history_bool_~history_id == 1); 66582#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 66581#L236-8 assume { :end_inline_write_history_bool } true; 66572#L452 assume ~gate3Failed~0 % 256 != 0; 66571#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 66570#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 66569#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 66568#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 66539#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 66532#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 66525#L211-2 [2018-11-10 09:22:59,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:59,982 INFO L82 PathProgramCache]: Analyzing trace with hash -267446180, now seen corresponding path program 2 times [2018-11-10 09:22:59,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:22:59,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:22:59,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:59,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:22:59,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:23:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:23:00,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:23:00,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:23:00,118 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:23:00,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:23:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1653013139, now seen corresponding path program 1 times [2018-11-10 09:23:00,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:23:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:23:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:23:00,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:23:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:23:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:23:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:23:00,749 WARN L179 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 229 [2018-11-10 09:23:01,721 WARN L179 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 166 [2018-11-10 09:23:01,723 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:23:01,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:23:01,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:23:01,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:23:01,723 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:23:01,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:23:01,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:23:01,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:23:01,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration23_Loop [2018-11-10 09:23:01,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:23:01,723 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:23:01,728 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-10 09:23:01,731 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-10 09:23:01,740 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-10 09:23:01,741 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-10 09:23:01,742 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-10 09:23:01,744 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-10 09:23:01,745 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-10 09:23:01,748 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-10 09:23:01,748 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-10 09:23:01,749 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-10 09:23:01,750 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-10 09:23:01,751 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-10 09:23:01,752 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-10 09:23:01,753 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-10 09:23:01,753 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-10 09:23:01,756 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-10 09:23:01,757 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-10 09:23:01,758 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-10 09:23:01,759 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-10 09:23:01,760 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-10 09:23:01,760 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-10 09:23:01,761 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-10 09:23:01,762 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-10 09:23:01,763 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-10 09:23:01,764 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-10 09:23:01,781 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-10 09:23:01,782 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-10 09:23:01,783 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-10 09:23:01,914 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-10 09:23:01,915 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-10 09:23:01,919 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-10 09:23:01,922 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-10 09:23:01,925 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-10 09:23:01,928 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-10 09:23:01,931 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-10 09:23:01,932 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-10 09:23:01,933 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-10 09:23:01,934 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-10 09:23:01,935 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-10 09:23:01,938 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-10 09:23:01,939 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-10 09:23:01,942 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-10 09:23:01,943 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-10 09:23:01,951 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-10 09:23:01,952 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-10 09:23:01,957 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-10 09:23:01,959 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-10 09:23:01,960 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-10 09:23:01,961 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-10 09:23:01,965 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-10 09:23:01,966 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-10 09:23:01,967 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-10 09:23:01,970 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-10 09:23:01,971 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-10 09:23:01,972 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-10 09:23:01,973 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-10 09:23:01,974 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-10 09:23:01,975 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-10 09:23:01,976 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-10 09:23:01,977 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-10 09:23:01,978 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-10 09:23:01,984 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-10 09:23:01,985 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-10 09:23:01,986 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-10 09:23:01,987 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-10 09:23:01,989 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-10 09:23:01,991 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-10 09:23:01,992 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-10 09:23:01,993 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-10 09:23:01,995 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-10 09:23:01,996 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-10 09:23:01,997 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-10 09:23:01,998 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-10 09:23:02,000 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-10 09:23:02,001 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-10 09:23:02,244 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-10 09:23:02,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 09:23:03,917 WARN L179 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 130 DAG size of output: 120 [2018-11-10 09:23:03,983 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:23:03,983 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:23:03,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:23:03,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:23:03,992 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:23:03,992 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~historyIndex=0, ULTIMATE.start_read_history_int8_~historyIndex=0} Honda state: {ULTIMATE.start_read_history_int8_#in~historyIndex=0, ULTIMATE.start_read_history_int8_~historyIndex=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:23:04,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:23:04,009 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:23:04,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:23:04,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:23:16,115 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 09:23:16,119 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:23:16,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:23:16,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:23:16,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:23:16,119 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:23:16,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:23:16,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:23:16,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:23:16,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration23_Loop [2018-11-10 09:23:16,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:23:16,119 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:23:16,123 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-10 09:23:16,132 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-10 09:23:16,135 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-10 09:23:16,136 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-10 09:23:16,138 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-10 09:23:16,139 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-10 09:23:16,140 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-10 09:23:16,141 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-10 09:23:16,142 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-10 09:23:16,143 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-10 09:23:16,143 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-10 09:23:16,144 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-10 09:23:16,151 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-10 09:23:16,151 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-10 09:23:16,152 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-10 09:23:16,155 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-10 09:23:16,155 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-10 09:23:16,158 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-10 09:23:16,159 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-10 09:23:16,159 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-10 09:23:16,161 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-10 09:23:16,161 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-10 09:23:16,273 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-10 09:23:16,273 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-10 09:23:16,274 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-10 09:23:16,275 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-10 09:23:16,275 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-10 09:23:16,277 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-10 09:23:16,277 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-10 09:23:16,278 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-10 09:23:16,279 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-10 09:23:16,280 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-10 09:23:16,280 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-10 09:23:16,282 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-10 09:23:16,283 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-10 09:23:16,283 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-10 09:23:16,284 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-10 09:23:16,285 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-10 09:23:16,286 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-10 09:23:16,287 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-10 09:23:16,288 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-10 09:23:16,297 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-10 09:23:16,298 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-10 09:23:16,301 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-10 09:23:16,304 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-10 09:23:16,305 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-10 09:23:16,306 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-10 09:23:16,308 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-10 09:23:16,309 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-10 09:23:16,310 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-10 09:23:16,311 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-10 09:23:16,312 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-10 09:23:16,313 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-10 09:23:16,313 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-10 09:23:16,314 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-10 09:23:16,315 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-10 09:23:16,321 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-10 09:23:16,323 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-10 09:23:16,324 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-10 09:23:16,325 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-10 09:23:16,326 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-10 09:23:16,327 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-10 09:23:16,334 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-10 09:23:16,335 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-10 09:23:16,336 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-10 09:23:16,337 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-10 09:23:16,339 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-10 09:23:16,341 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-10 09:23:16,344 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-10 09:23:16,345 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-10 09:23:16,347 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-10 09:23:16,348 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-10 09:23:16,349 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-10 09:23:16,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-10 09:23:16,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-10 09:23:16,638 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-10 09:23:16,712 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 09:23:18,327 WARN L179 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 130 DAG size of output: 120 [2018-11-10 09:23:18,395 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:23:18,395 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:23:18,396 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-10 09:23:18,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:23:18,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:23:18,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:23:18,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:23:18,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:23:18,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:23:18,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:23:18,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:23:18,399 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-10 09:23:18,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:23:18,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:23:18,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:23:18,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:23:18,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:23:18,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:23:18,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:23:18,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:23:18,401 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-10 09:23:18,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:23:18,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:23:18,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:23:18,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:23:18,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:23:18,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:23:18,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:23:18,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:23:18,402 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-10 09:23:18,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:23:18,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:23:18,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:23:18,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:23:18,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:23:18,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:23:18,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:23:18,404 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:23:18,404 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:23:18,404 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:23:18,404 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:23:18,405 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:23:18,405 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:23:18,405 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 09:23:18,405 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:23:18,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:23:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:23:18,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:23:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:23:18,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:23:18,523 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-10 09:23:18,523 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:23:18,523 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1004 states and 1375 transitions. cyclomatic complexity: 378 Second operand 5 states. [2018-11-10 09:23:18,554 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1004 states and 1375 transitions. cyclomatic complexity: 378. Second operand 5 states. Result 2361 states and 3266 transitions. Complement of second has 6 states. [2018-11-10 09:23:18,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:23:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:23:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2018-11-10 09:23:18,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 565 transitions. Stem has 88 letters. Loop has 56 letters. [2018-11-10 09:23:18,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:23:18,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 565 transitions. Stem has 144 letters. Loop has 56 letters. [2018-11-10 09:23:18,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:23:18,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 565 transitions. Stem has 88 letters. Loop has 112 letters. [2018-11-10 09:23:18,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:23:18,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2361 states and 3266 transitions. [2018-11-10 09:23:18,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2018-11-10 09:23:18,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2361 states to 453 states and 613 transitions. [2018-11-10 09:23:18,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 396 [2018-11-10 09:23:18,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2018-11-10 09:23:18,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 453 states and 613 transitions. [2018-11-10 09:23:18,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:23:18,564 INFO L705 BuchiCegarLoop]: Abstraction has 453 states and 613 transitions. [2018-11-10 09:23:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states and 613 transitions. [2018-11-10 09:23:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 356. [2018-11-10 09:23:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 09:23:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 470 transitions. [2018-11-10 09:23:18,566 INFO L728 BuchiCegarLoop]: Abstraction has 356 states and 470 transitions. [2018-11-10 09:23:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:23:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:23:18,567 INFO L87 Difference]: Start difference. First operand 356 states and 470 transitions. Second operand 4 states. [2018-11-10 09:23:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:23:18,601 INFO L93 Difference]: Finished difference Result 358 states and 471 transitions. [2018-11-10 09:23:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:23:18,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 358 states and 471 transitions. [2018-11-10 09:23:18,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2018-11-10 09:23:18,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 358 states to 356 states and 469 transitions. [2018-11-10 09:23:18,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2018-11-10 09:23:18,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 299 [2018-11-10 09:23:18,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 356 states and 469 transitions. [2018-11-10 09:23:18,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:23:18,603 INFO L705 BuchiCegarLoop]: Abstraction has 356 states and 469 transitions. [2018-11-10 09:23:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states and 469 transitions. [2018-11-10 09:23:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 09:23:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 09:23:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 469 transitions. [2018-11-10 09:23:18,610 INFO L728 BuchiCegarLoop]: Abstraction has 356 states and 469 transitions. [2018-11-10 09:23:18,610 INFO L608 BuchiCegarLoop]: Abstraction has 356 states and 469 transitions. [2018-11-10 09:23:18,610 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-10 09:23:18,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 356 states and 469 transitions. [2018-11-10 09:23:18,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2018-11-10 09:23:18,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:23:18,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:23:18,611 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:23:18,611 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, 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-10 09:23:18,612 INFO L793 eck$LassoCheckResult]: Stem: 70358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 70210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 70211#L116-3 assume true; 70436#L116-1 assume !!(add_history_type_~var~0 < 3); 70417#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 70320#L171 assume read_history_bool_~history_id == 0; 70321#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 70195#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 70313#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 70314#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 70437#L116-3 assume true; 70438#L116-1 assume !(add_history_type_~var~0 < 3); 70434#L116-4 add_history_type_#res := 1; 70331#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 70332#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 70410#L116-8 assume true; 70442#L116-6 assume !!(add_history_type_~var~0 < 3); 70408#L117-2 assume !(add_history_type_~history_id == 0); 70409#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 70439#L171-4 assume !(read_history_bool_~history_id == 0); 70369#L181-4 assume read_history_bool_~history_id == 1; 70370#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 70305#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 70234#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 70235#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 70443#L116-8 assume true; 70444#L116-6 assume !(add_history_type_~var~0 < 3); 70441#L116-9 add_history_type_#res := 1; 70364#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 70325#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 70326#L116-13 assume true; 70425#L116-11 assume !!(add_history_type_~var~0 < 3); 70404#L117-4 assume !(add_history_type_~history_id == 0); 70406#L123-4 assume !(add_history_type_~history_id == 1); 70460#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 70446#L171-8 assume !(read_history_bool_~history_id == 0); 70377#L181-8 assume !(read_history_bool_~history_id == 1); 70241#L191-8 assume read_history_bool_~history_id == 2; 70243#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 70379#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 70217#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 70218#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 70451#L116-13 assume true; 70535#L116-11 assume !(add_history_type_~var~0 < 3); 70423#L116-14 add_history_type_#res := 1; 70361#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 70202#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 70203#L116-18 assume true; 70476#L116-16 assume !!(add_history_type_~var~0 < 3); 70395#L117-6 assume !(add_history_type_~history_id == 0); 70396#L123-6 assume !(add_history_type_~history_id == 1); 70456#L129-6 assume !(add_history_type_~history_id == 2); 70296#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 70297#L151-3 assume read_history_int8_~history_id == 3; 70306#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 70307#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 70310#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 70292#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 70293#L116-18 assume true; 70431#L116-16 assume !(add_history_type_~var~0 < 3); 70430#L116-19 add_history_type_#res := 1; 70359#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 70360#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 70329#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 70276#L554-3 [2018-11-10 09:23:18,612 INFO L795 eck$LassoCheckResult]: Loop: 70276#L554-3 assume true; 70269#L554-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 70270#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 70323#L236-2 assume { :end_inline_write_history_bool } true; 70386#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 70372#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 70327#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 70328#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 70435#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 70400#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 70318#L226-2 assume !(write_history_bool_~history_id == 0); 70319#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 70337#L236-5 assume { :end_inline_write_history_bool } true; 70373#L421 assume ~gate2Failed~0 % 256 != 0; 70285#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 70247#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 70248#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 70366#L226-4 assume !(write_history_bool_~history_id == 0); 70362#L231-4 assume !(write_history_bool_~history_id == 1); 70363#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 70367#L236-8 assume { :end_inline_write_history_bool } true; 70383#L452 assume ~gate3Failed~0 % 256 != 0; 70414#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 70402#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 70403#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 70413#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 70272#L510-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 70280#L211 assume !(write_history_int8_~history_id == 3);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 70469#L579-40 assume !(assert_~arg % 256 == 0); 70470#L574-20 assume { :end_inline_assert } true; 70473#L211-2 assume { :end_inline_write_history_int8 } true; 70226#L516 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 70227#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 70356#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 70440#L171-12 assume read_history_bool_~history_id == 0; 70412#L172-12 assume !(read_history_bool_~historyIndex == 0); 70392#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 70376#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 70214#L307 assume !(check_~tmp___3~0 % 256 == 0); 70215#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 70221#L151-7 assume read_history_int8_~history_id == 3; 70255#L152-7 assume !(read_history_int8_~historyIndex == 0); 70256#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 70257#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 70258#L346 assume !(check_~tmp___10~0 > -2); 70384#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 70385#L151-9 assume read_history_int8_~history_id == 3; 70249#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 70250#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 70251#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 70301#L366-1 check_#res := 1; 70289#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 70290#L579-72 assume !(assert_~arg % 256 == 0); 70315#L574-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 70276#L554-3 [2018-11-10 09:23:18,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:23:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash -748130023, now seen corresponding path program 1 times [2018-11-10 09:23:18,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:23:18,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:23:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:23:18,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:23:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:23:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:23:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:23:18,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:23:18,668 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b1a8345-69e4-41fa-a5f2-b8f76bf01da6/bin-2019/uautomizer/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:23:18,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:23:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:23:18,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:23:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:23:18,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:23:18,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 09:23:18,766 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:23:18,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:23:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash 983712683, now seen corresponding path program 1 times [2018-11-10 09:23:18,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:23:18,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:23:18,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:23:18,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:23:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:23:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:23:18,799 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-10 09:23:18,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:23:18,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:23:18,800 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:23:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:23:18,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:23:18,800 INFO L87 Difference]: Start difference. First operand 356 states and 469 transitions. cyclomatic complexity: 118 Second operand 3 states. [2018-11-10 09:23:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:23:18,801 INFO L93 Difference]: Finished difference Result 219 states and 293 transitions. [2018-11-10 09:23:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:23:18,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 293 transitions. [2018-11-10 09:23:18,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:23:18,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 0 states and 0 transitions. [2018-11-10 09:23:18,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 09:23:18,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 09:23:18,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 09:23:18,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:23:18,802 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:23:18,802 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:23:18,803 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:23:18,803 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-10 09:23:18,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:23:18,803 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:23:18,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 09:23:18,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:23:18 BoogieIcfgContainer [2018-11-10 09:23:18,810 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:23:18,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:23:18,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:23:18,811 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:23:18,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:21:26" (3/4) ... [2018-11-10 09:23:18,815 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 09:23:18,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:23:18,816 INFO L168 Benchmark]: Toolchain (without parser) took 113900.92 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 838.3 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 703.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:23:18,816 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:23:18,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.28 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 940.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:23:18,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:23:18,819 INFO L168 Benchmark]: Boogie Preprocessor took 49.40 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-10 09:23:18,819 INFO L168 Benchmark]: RCFGBuilder took 1095.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.8 MB in the end (delta: 138.4 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:23:18,819 INFO L168 Benchmark]: BuchiAutomizer took 112413.34 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 698.9 MB). Free memory was 989.8 MB in the beginning and 1.1 GB in the end (delta: -105.0 MB). Peak memory consumption was 593.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:23:18,820 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:23:18,821 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.28 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 940.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.40 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. * RCFGBuilder took 1095.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.8 MB in the end (delta: 138.4 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 112413.34 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 698.9 MB). Free memory was 989.8 MB in the beginning and 1.1 GB in the end (delta: -105.0 MB). Peak memory consumption was 593.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. 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 33 terminating modules (24 trivial, 9 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * var + 5 and consists of 5 locations. One deterministic module has affine ranking function -2 * var + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * var + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * var + 3 and consists of 4 locations. One deterministic module has affine ranking function -1 * votedValue_History_0 + -1 * g1v_\old + nomsg and consists of 41 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. 24 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 112.3s and 25 iterations. TraceHistogramMax:2. Analysis of lassos took 106.4s. Construction of modules took 1.8s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 32. Automata minimization 0.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 13878 StatesRemovedByMinimization, 25 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1266 states and ocurred in iteration 17. Nontrivial modules had stage [9, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21702 SDtfs, 18473 SDslu, 30104 SDs, 0 SdLazy, 3283 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI15 SILT8 lasso0 LassoPreprocessingBenchmarks: Lassos: inital777 mio100 ax184 hnf110 lsp19 ukn81 mio100 lsp100 div139 bol100 ite100 ukn100 eq177 hnf82 smp100 dnf4266 smp14 tf105 neg99 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 154ms VariablesStem: 0 VariablesLoop: 35 DisjunctsStem: 1 DisjunctsLoop: 20 SupportingInvariants: 0 MotzkinApplications: 40 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 94 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 38.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...