./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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 dc59d56a03b0e275b4f62d2522e0dff35f3e7a25 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:13:34,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:13:34,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:13:34,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:13:34,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:13:34,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:13:34,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:13:34,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:13:34,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:13:34,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:13:34,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:13:34,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:13:34,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:13:34,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:13:34,429 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:13:34,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:13:34,430 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:13:34,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:13:34,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:13:34,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:13:34,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:13:34,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:13:34,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:13:34,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:13:34,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:13:34,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:13:34,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:13:34,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:13:34,440 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:13:34,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:13:34,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:13:34,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:13:34,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:13:34,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:13:34,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:13:34,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:13:34,444 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:13:34,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:13:34,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:13:34,457 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:13:34,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:13:34,457 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:13:34,457 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:13:34,457 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:13:34,457 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:13:34,457 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:13:34,458 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:13:34,458 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:13:34,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:13:34,458 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:13:34,458 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:13:34,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:13:34,458 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:13:34,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:13:34,459 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:13:34,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:13:34,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:13:34,459 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:13:34,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:13:34,459 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:13:34,459 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:13:34,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:13:34,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:13:34,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:13:34,460 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:13:34,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:13:34,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:13:34,461 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:13:34,461 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:13:34,461 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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 -> dc59d56a03b0e275b4f62d2522e0dff35f3e7a25 [2018-11-28 13:13:34,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:13:34,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:13:34,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:13:34,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:13:34,495 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:13:34,496 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 13:13:34,533 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/data/01ced985c/e0a98f679426494f9827a12652b05811/FLAGa6e9c2f23 [2018-11-28 13:13:34,949 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:13:34,950 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 13:13:34,955 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/data/01ced985c/e0a98f679426494f9827a12652b05811/FLAGa6e9c2f23 [2018-11-28 13:13:34,963 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/data/01ced985c/e0a98f679426494f9827a12652b05811 [2018-11-28 13:13:34,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:13:34,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:13:34,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:13:34,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:13:34,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:13:34,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:13:34" (1/1) ... [2018-11-28 13:13:34,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eb1ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:34, skipping insertion in model container [2018-11-28 13:13:34,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:13:34" (1/1) ... [2018-11-28 13:13:34,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:13:35,000 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:13:35,150 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:13:35,157 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:13:35,232 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:13:35,247 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:13:35,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35 WrapperNode [2018-11-28 13:13:35,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:13:35,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:13:35,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:13:35,248 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:13:35,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:13:35,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:13:35,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:13:35,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:13:35,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... [2018-11-28 13:13:35,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:13:35,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:13:35,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:13:35,359 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:13:35,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:13:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:13:36,488 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:13:36,488 INFO L280 CfgBuilder]: Removed 173 assue(true) statements. [2018-11-28 13:13:36,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:13:36 BoogieIcfgContainer [2018-11-28 13:13:36,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:13:36,489 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:13:36,489 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:13:36,492 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:13:36,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:13:36,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:13:34" (1/3) ... [2018-11-28 13:13:36,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f33c0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:13:36, skipping insertion in model container [2018-11-28 13:13:36,494 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:13:36,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:35" (2/3) ... [2018-11-28 13:13:36,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f33c0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:13:36, skipping insertion in model container [2018-11-28 13:13:36,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:13:36,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:13:36" (3/3) ... [2018-11-28 13:13:36,497 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 13:13:36,533 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:13:36,534 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:13:36,534 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:13:36,534 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:13:36,534 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:13:36,534 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:13:36,534 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:13:36,534 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:13:36,534 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:13:36,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states. [2018-11-28 13:13:36,583 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 458 [2018-11-28 13:13:36,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:36,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:36,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:13:36,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:13:36,591 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:13:36,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states. [2018-11-28 13:13:36,600 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 458 [2018-11-28 13:13:36,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:36,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:36,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:13:36,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:13:36,606 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRYtrue ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 233#L-1true 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;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;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; 403#L116-2true [2018-11-28 13:13:36,606 INFO L796 eck$LassoCheckResult]: Loop: 403#L116-2true assume !!(add_history_type_~var~0 < 3); 375#L117true assume !(0 == add_history_type_~history_id); 226#L123true assume !(1 == add_history_type_~history_id); 467#L129true assume !(2 == add_history_type_~history_id); 201#L135true assume !(3 == add_history_type_~history_id); 199#L135-2true add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 403#L116-2true [2018-11-28 13:13:36,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:36,610 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 13:13:36,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:36,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:36,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:36,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:36,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:36,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:36,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1278004263, now seen corresponding path program 1 times [2018-11-28 13:13:36,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:36,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:36,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:36,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:36,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:36,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:36,728 INFO L82 PathProgramCache]: Analyzing trace with hash 358053481, now seen corresponding path program 1 times [2018-11-28 13:13:36,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:36,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:36,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:36,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:36,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:36,849 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:36,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:36,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:36,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:36,850 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:13:36,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:36,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:36,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:36,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-28 13:13:36,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:36,852 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:36,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-28 13:13:36,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-28 13:13:36,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-28 13:13:36,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:36,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-28 13:13:36,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-28 13:13:36,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-28 13:13:36,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-28 13:13:36,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:36,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-28 13:13:36,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-28 13:13:37,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:37,045 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:37,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,067 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,067 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:37,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,082 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,085 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,085 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,105 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,125 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,159 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,160 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,180 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,180 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:37,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,183 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,208 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,213 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,214 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,229 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,232 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=7} Honda state: {ULTIMATE.start_add_history_type_~history_id=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,250 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,252 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:37,252 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:37,268 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:37,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:13:37,285 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:37,301 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:13:37,303 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:37,303 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:37,303 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:37,303 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:37,303 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:13:37,303 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:37,303 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:37,304 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:37,304 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-28 13:13:37,304 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:37,304 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:37,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-28 13:13:37,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-28 13:13:37,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-28 13:13:37,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-28 13:13:37,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:37,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-28 13:13:37,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-28 13:13:37,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:37,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:37,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:37,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:37,545 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:37,549 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:13:37,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:37,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:37,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:37,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:37,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:37,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:37,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:37,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:37,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:37,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:37,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:37,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:37,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:37,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:37,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:37,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:37,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:37,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:37,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:37,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:37,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,632 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:13:37,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,633 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:13:37,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:37,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:37,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:37,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:37,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:37,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:37,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:37,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:37,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:37,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:37,638 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:13:37,640 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:13:37,640 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:13:37,642 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:13:37,642 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:13:37,642 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:13:37,643 INFO L520 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-28 13:13:37,644 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:13:37,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:37,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:37,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:37,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:13:37,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 477 states. Second operand 3 states. [2018-11-28 13:13:37,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 477 states.. Second operand 3 states. Result 1971 states and 3291 transitions. Complement of second has 8 states. [2018-11-28 13:13:37,898 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-28 13:13:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:13:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1723 transitions. [2018-11-28 13:13:37,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1723 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 13:13:37,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:37,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1723 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 13:13:37,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:37,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1723 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 13:13:37,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:37,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1971 states and 3291 transitions. [2018-11-28 13:13:37,921 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 828 [2018-11-28 13:13:37,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1971 states to 950 states and 1590 transitions. [2018-11-28 13:13:37,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2018-11-28 13:13:37,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 898 [2018-11-28 13:13:37,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 950 states and 1590 transitions. [2018-11-28 13:13:37,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:37,937 INFO L705 BuchiCegarLoop]: Abstraction has 950 states and 1590 transitions. [2018-11-28 13:13:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states and 1590 transitions. [2018-11-28 13:13:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 734. [2018-11-28 13:13:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-28 13:13:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1237 transitions. [2018-11-28 13:13:37,989 INFO L728 BuchiCegarLoop]: Abstraction has 734 states and 1237 transitions. [2018-11-28 13:13:37,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:37,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:37,993 INFO L87 Difference]: Start difference. First operand 734 states and 1237 transitions. Second operand 3 states. [2018-11-28 13:13:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:38,096 INFO L93 Difference]: Finished difference Result 915 states and 1472 transitions. [2018-11-28 13:13:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:38,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 915 states and 1472 transitions. [2018-11-28 13:13:38,103 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 804 [2018-11-28 13:13:38,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 915 states to 861 states and 1418 transitions. [2018-11-28 13:13:38,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 845 [2018-11-28 13:13:38,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 845 [2018-11-28 13:13:38,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1418 transitions. [2018-11-28 13:13:38,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:38,108 INFO L705 BuchiCegarLoop]: Abstraction has 861 states and 1418 transitions. [2018-11-28 13:13:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1418 transitions. [2018-11-28 13:13:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 424. [2018-11-28 13:13:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-28 13:13:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 706 transitions. [2018-11-28 13:13:38,117 INFO L728 BuchiCegarLoop]: Abstraction has 424 states and 706 transitions. [2018-11-28 13:13:38,117 INFO L608 BuchiCegarLoop]: Abstraction has 424 states and 706 transitions. [2018-11-28 13:13:38,117 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:13:38,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 424 states and 706 transitions. [2018-11-28 13:13:38,119 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 378 [2018-11-28 13:13:38,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:38,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:38,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:13:38,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:13:38,120 INFO L794 eck$LassoCheckResult]: Stem: 4517#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 4463#L-1 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;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;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; 4464#L116-2 assume !(add_history_type_~var~0 < 3); 4564#L116-3 add_history_type_#res := 1; 4514#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 4387#L255 assume !(0 == init_~tmp~1);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; 4388#L116-6 [2018-11-28 13:13:38,120 INFO L796 eck$LassoCheckResult]: Loop: 4388#L116-6 assume !!(add_history_type_~var~0 < 3); 4569#L117-2 assume !(0 == add_history_type_~history_id); 4457#L123-2 assume !(1 == add_history_type_~history_id); 4459#L129-2 assume !(2 == add_history_type_~history_id); 4431#L135-3 assume !(3 == add_history_type_~history_id); 4199#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 4388#L116-6 [2018-11-28 13:13:38,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash 889868154, now seen corresponding path program 1 times [2018-11-28 13:13:38,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:38,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:38,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:38,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:38,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:38,157 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:38,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash 261434407, now seen corresponding path program 1 times [2018-11-28 13:13:38,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:38,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:38,202 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:38,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:38,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:38,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:38,202 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:13:38,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:38,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:38,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:38,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-28 13:13:38,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:38,203 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:38,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-28 13:13:38,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-28 13:13:38,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-28 13:13:38,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-28 13:13:38,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13: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-28 13:13: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-28 13:13: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-28 13:13:38,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-28 13:13:38,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-28 13:13:38,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,333 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:38,333 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:38,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:38,349 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:38,349 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:38,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:38,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:38,380 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,383 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:38,384 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:38,386 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:38,386 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:38,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:38,415 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:38,416 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:38,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:38,433 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:38,433 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:38,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:38,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:38,440 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:38,455 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:38,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:38,458 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:38,473 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:38,490 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:13:38,490 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:38,516 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:13:38,518 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:38,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:38,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:38,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:38,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:13:38,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:38,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:38,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:38,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-28 13:13:38,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:38,519 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:38,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:38,639 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:38,639 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:13:38,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:38,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:38,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:38,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:38,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:38,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:38,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:38,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:38,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:38,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:38,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:38,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:38,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:38,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:38,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:38,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:38,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:38,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:38,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:38,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:38,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:38,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:38,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:38,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:38,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:38,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:38,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:38,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:38,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:38,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:38,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:38,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:38,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:38,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:38,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:38,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:38,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:38,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:38,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:38,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:38,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:38,663 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:13:38,665 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:13:38,665 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:13:38,665 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:13:38,665 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:13:38,665 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:13:38,665 INFO L520 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-28 13:13:38,666 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:13:38,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:38,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:38,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:38,705 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:13:38,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 424 states and 706 transitions. cyclomatic complexity: 290 Second operand 3 states. [2018-11-28 13:13:38,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 424 states and 706 transitions. cyclomatic complexity: 290. Second operand 3 states. Result 1555 states and 2561 transitions. Complement of second has 7 states. [2018-11-28 13:13:38,773 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-28 13:13:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:13:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1179 transitions. [2018-11-28 13:13:38,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1179 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 13:13:38,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:38,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1179 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-28 13:13:38,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:38,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1179 transitions. Stem has 6 letters. Loop has 12 letters. [2018-11-28 13:13:38,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:38,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1555 states and 2561 transitions. [2018-11-28 13:13:38,786 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 962 [2018-11-28 13:13:38,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1555 states to 1120 states and 1844 transitions. [2018-11-28 13:13:38,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1046 [2018-11-28 13:13:38,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1049 [2018-11-28 13:13:38,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1120 states and 1844 transitions. [2018-11-28 13:13:38,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:38,793 INFO L705 BuchiCegarLoop]: Abstraction has 1120 states and 1844 transitions. [2018-11-28 13:13:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states and 1844 transitions. [2018-11-28 13:13:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 476. [2018-11-28 13:13:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-11-28 13:13:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 791 transitions. [2018-11-28 13:13:38,804 INFO L728 BuchiCegarLoop]: Abstraction has 476 states and 791 transitions. [2018-11-28 13:13:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:38,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:38,805 INFO L87 Difference]: Start difference. First operand 476 states and 791 transitions. Second operand 3 states. [2018-11-28 13:13:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:38,884 INFO L93 Difference]: Finished difference Result 935 states and 1549 transitions. [2018-11-28 13:13:38,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:38,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 935 states and 1549 transitions. [2018-11-28 13:13:38,890 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 536 [2018-11-28 13:13:38,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 935 states to 935 states and 1549 transitions. [2018-11-28 13:13:38,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 797 [2018-11-28 13:13:38,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 797 [2018-11-28 13:13:38,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 935 states and 1549 transitions. [2018-11-28 13:13:38,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:38,895 INFO L705 BuchiCegarLoop]: Abstraction has 935 states and 1549 transitions. [2018-11-28 13:13:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states and 1549 transitions. [2018-11-28 13:13:38,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 478. [2018-11-28 13:13:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-11-28 13:13:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 791 transitions. [2018-11-28 13:13:38,904 INFO L728 BuchiCegarLoop]: Abstraction has 478 states and 791 transitions. [2018-11-28 13:13:38,904 INFO L608 BuchiCegarLoop]: Abstraction has 478 states and 791 transitions. [2018-11-28 13:13:38,904 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:13:38,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 791 transitions. [2018-11-28 13:13:38,906 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 323 [2018-11-28 13:13:38,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:38,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:38,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:38,907 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] [2018-11-28 13:13:38,907 INFO L794 eck$LassoCheckResult]: Stem: 8013#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 7954#L-1 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;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;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; 7955#L116-2 assume !!(add_history_type_~var~0 < 3); 8052#L117 assume 0 == add_history_type_~history_id;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; 7720#L171 assume 0 == read_history_bool_~history_id; 7721#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 7727#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 7846#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8009#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 7862#L255 assume 0 == init_~tmp~1;init_#res := 0; 7740#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 7742#L550-2 [2018-11-28 13:13:38,908 INFO L796 eck$LassoCheckResult]: Loop: 7742#L550-2 assume !!(main_~i2~0 < 10);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;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; 7736#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7711#L570-16 assume 0 != ~gate1Failed~0 % 256; 7734#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 7735#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; 7743#L409 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;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; 7718#L226-2 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7694#L570-17 assume 0 != ~gate2Failed~0 % 256; 7697#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 7680#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; 7681#L440 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;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; 8015#L226-4 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7699#L570-18 assume 0 != ~gate3Failed~0 % 256; 7868#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 7860#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; 7861#L471 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; 7864#L486 assume ~VALUE1~0 == ~VALUE2~0; 7866#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 7683#L570-19 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; 7937#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 7685#L570-20 ~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;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; 7993#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 7930#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 7931#L171-12 assume 0 == read_history_bool_~history_id; 8047#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 7771#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 7812#L307 assume !(0 == check_~tmp___3~0 % 256); 7897#L307-1 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; 7963#L151-7 assume 3 == read_history_int8_~history_id; 7978#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 7880#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 7856#L346 assume !(check_~tmp___10~0 > -2); 7836#L346-1 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; 7837#L151-9 assume 3 == read_history_int8_~history_id; 7973#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 7876#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 7919#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 7855#L366-1 check_#res := 1; 7700#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 7701#L575-72 assume !(0 == assert_~arg % 256); 7840#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 7742#L550-2 [2018-11-28 13:13:38,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1494216267, now seen corresponding path program 1 times [2018-11-28 13:13:38,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:38,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:38,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:38,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:38,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:38,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:13:38,942 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:38,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:38,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1417533931, now seen corresponding path program 1 times [2018-11-28 13:13:38,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:38,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:38,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:38,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:38,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:38,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:38,972 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:38,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:38,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:38,972 INFO L87 Difference]: Start difference. First operand 478 states and 791 transitions. cyclomatic complexity: 321 Second operand 3 states. [2018-11-28 13:13:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:38,988 INFO L93 Difference]: Finished difference Result 479 states and 791 transitions. [2018-11-28 13:13:38,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:38,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 479 states and 791 transitions. [2018-11-28 13:13:38,991 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 323 [2018-11-28 13:13:38,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 479 states to 478 states and 787 transitions. [2018-11-28 13:13:38,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 407 [2018-11-28 13:13:38,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2018-11-28 13:13:38,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 478 states and 787 transitions. [2018-11-28 13:13:38,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:38,995 INFO L705 BuchiCegarLoop]: Abstraction has 478 states and 787 transitions. [2018-11-28 13:13:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states and 787 transitions. [2018-11-28 13:13:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2018-11-28 13:13:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-11-28 13:13:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 787 transitions. [2018-11-28 13:13:39,002 INFO L728 BuchiCegarLoop]: Abstraction has 478 states and 787 transitions. [2018-11-28 13:13:39,002 INFO L608 BuchiCegarLoop]: Abstraction has 478 states and 787 transitions. [2018-11-28 13:13:39,002 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:13:39,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 787 transitions. [2018-11-28 13:13:39,004 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 323 [2018-11-28 13:13:39,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:39,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:39,004 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] [2018-11-28 13:13:39,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:13:39,005 INFO L794 eck$LassoCheckResult]: Stem: 8977#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 8919#L-1 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;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;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; 8920#L116-2 assume !!(add_history_type_~var~0 < 3); 9016#L117 assume 0 == add_history_type_~history_id;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; 8684#L171 assume 0 == read_history_bool_~history_id; 8685#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8691#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8810#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8975#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 8826#L255 assume !(0 == init_~tmp~1);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; 8827#L116-6 assume !!(add_history_type_~var~0 < 3); 9036#L117-2 assume 0 == add_history_type_~history_id;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; 9005#L171-3 assume 0 == read_history_bool_~history_id; 9008#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8767#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8774#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8620#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 8702#L259 assume !(0 == init_~tmp___0~1);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; 8703#L116-10 assume !!(add_history_type_~var~0 < 3); 9031#L117-4 [2018-11-28 13:13:39,005 INFO L796 eck$LassoCheckResult]: Loop: 9031#L117-4 assume !(0 == add_history_type_~history_id); 8906#L123-4 assume !(1 == add_history_type_~history_id); 8908#L129-4 assume !(2 == add_history_type_~history_id); 8871#L135-6 assume !(3 == add_history_type_~history_id); 8604#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 9039#L116-10 assume !!(add_history_type_~var~0 < 3); 9031#L117-4 [2018-11-28 13:13:39,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 576829260, now seen corresponding path program 1 times [2018-11-28 13:13:39,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:39,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:39,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:39,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:13:39,040 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:39,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:39,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1197341531, now seen corresponding path program 1 times [2018-11-28 13:13:39,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:39,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:39,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:39,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:39,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:39,109 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:39,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:39,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:39,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:39,109 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:13:39,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:39,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:39,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:39,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-28 13:13:39,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:39,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:39,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,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-28 13:13:39,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,229 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:39,230 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:39,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:39,234 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:39,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:13:39,250 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:39,298 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:13:39,299 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:39,299 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:39,299 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:39,299 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:39,299 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:13:39,300 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:39,300 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:39,300 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:39,300 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-28 13:13:39,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:39,300 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,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-28 13:13:39,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-28 13:13:39,413 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:39,413 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:13:39,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-28 13:13:39,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:39,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:39,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:39,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:39,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:39,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:39,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:39,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-28 13:13:39,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:39,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:39,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:39,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:39,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:39,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:39,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:39,420 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:13:39,422 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:13:39,422 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:13:39,422 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:13:39,422 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:13:39,422 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:13:39,422 INFO L520 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-28 13:13:39,423 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:13:39,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:39,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:39,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:39,497 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:13:39,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 787 transitions. cyclomatic complexity: 317 Second operand 4 states. [2018-11-28 13:13:39,538 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 787 transitions. cyclomatic complexity: 317. Second operand 4 states. Result 539 states and 889 transitions. Complement of second has 7 states. [2018-11-28 13:13:39,539 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-28 13:13:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:13:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2018-11-28 13:13:39,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-28 13:13:39,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:39,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 25 letters. Loop has 6 letters. [2018-11-28 13:13:39,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:39,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 19 letters. Loop has 12 letters. [2018-11-28 13:13:39,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:39,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 889 transitions. [2018-11-28 13:13:39,544 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 268 [2018-11-28 13:13:39,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 534 states and 880 transitions. [2018-11-28 13:13:39,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2018-11-28 13:13:39,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2018-11-28 13:13:39,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 534 states and 880 transitions. [2018-11-28 13:13:39,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:39,546 INFO L705 BuchiCegarLoop]: Abstraction has 534 states and 880 transitions. [2018-11-28 13:13:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states and 880 transitions. [2018-11-28 13:13:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 530. [2018-11-28 13:13:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-11-28 13:13:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 876 transitions. [2018-11-28 13:13:39,552 INFO L728 BuchiCegarLoop]: Abstraction has 530 states and 876 transitions. [2018-11-28 13:13:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:13:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:13:39,553 INFO L87 Difference]: Start difference. First operand 530 states and 876 transitions. Second operand 4 states. [2018-11-28 13:13:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:39,657 INFO L93 Difference]: Finished difference Result 752 states and 1233 transitions. [2018-11-28 13:13:39,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:13:39,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 752 states and 1233 transitions. [2018-11-28 13:13:39,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 481 [2018-11-28 13:13:39,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 752 states to 736 states and 1207 transitions. [2018-11-28 13:13:39,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2018-11-28 13:13:39,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 610 [2018-11-28 13:13:39,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 736 states and 1207 transitions. [2018-11-28 13:13:39,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:39,666 INFO L705 BuchiCegarLoop]: Abstraction has 736 states and 1207 transitions. [2018-11-28 13:13:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states and 1207 transitions. [2018-11-28 13:13:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 516. [2018-11-28 13:13:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-28 13:13:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 851 transitions. [2018-11-28 13:13:39,673 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 851 transitions. [2018-11-28 13:13:39,673 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 851 transitions. [2018-11-28 13:13:39,673 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:13:39,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 851 transitions. [2018-11-28 13:13:39,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 268 [2018-11-28 13:13:39,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:39,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:39,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:39,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:13:39,677 INFO L794 eck$LassoCheckResult]: Stem: 11407#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 11345#L-1 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;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;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; 11346#L116-2 assume !!(add_history_type_~var~0 < 3); 11454#L117 assume 0 == add_history_type_~history_id;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; 11094#L171 assume 0 == read_history_bool_~history_id; 11095#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11098#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11228#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 11282#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 11283#L116-2 assume !(add_history_type_~var~0 < 3); 11467#L116-3 add_history_type_#res := 1; 11405#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 11243#L255 assume !(0 == init_~tmp~1);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; 11244#L116-6 assume !!(add_history_type_~var~0 < 3); 11473#L117-2 assume 0 == add_history_type_~history_id;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; 11442#L171-3 assume 0 == read_history_bool_~history_id; 11445#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11177#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11181#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11022#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 11106#L259 assume !(0 == init_~tmp___0~1);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; 11107#L116-10 assume !!(add_history_type_~var~0 < 3); 11433#L117-4 assume 0 == add_history_type_~history_id;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; 11435#L171-6 assume 0 == read_history_bool_~history_id; 11431#L172-6 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11146#L203-6 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11150#L119-2 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11009#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 11343#L263 assume !(0 == init_~tmp___1~1);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; 11344#L116-14 assume !!(add_history_type_~var~0 < 3); 11461#L117-6 [2018-11-28 13:13:39,677 INFO L796 eck$LassoCheckResult]: Loop: 11461#L117-6 assume !(0 == add_history_type_~history_id); 11327#L123-6 assume !(1 == add_history_type_~history_id); 11329#L129-6 assume !(2 == add_history_type_~history_id); 11080#L135-9 assume !(3 == add_history_type_~history_id); 11001#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 11475#L116-14 assume !!(add_history_type_~var~0 < 3); 11461#L117-6 [2018-11-28 13:13:39,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2009806385, now seen corresponding path program 1 times [2018-11-28 13:13:39,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:39,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:39,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:39,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:39,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:13:39,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:39,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:13:39,733 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:39,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:39,733 INFO L82 PathProgramCache]: Analyzing trace with hash 180771675, now seen corresponding path program 1 times [2018-11-28 13:13:39,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:39,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:39,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:39,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:39,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:39,770 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:39,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:39,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:39,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:39,770 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:13:39,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:39,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:39,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:39,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-28 13:13:39,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:39,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,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-28 13:13:39,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:39,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-28 13:13:39,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:39,912 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:39,914 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:39,915 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:39,917 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:39,917 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:39,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:39,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:39,956 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:39,956 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:39,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:39,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:39,961 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:39,961 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:39,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:39,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:40,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:40,001 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:40,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:40,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:40,009 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:40,009 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:40,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:40,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:40,058 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:40,058 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:40,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:40,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:40,064 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:40,064 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=7} Honda state: {ULTIMATE.start_add_history_type_~history_id=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:40,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:40,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:40,082 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:40,083 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:40,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:40,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:40,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:40,103 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:40,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:40,118 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:40,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:13:40,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:40,187 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:13:40,188 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:40,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:40,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:40,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:40,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:13:40,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:40,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:40,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:40,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-28 13:13:40,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:40,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:40,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-28 13:13:40,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-28 13:13:40,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:40,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-28 13:13:40,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:40,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-28 13:13:40,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-28 13:13:40,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-28 13:13:40,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-28 13:13:40,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-28 13:13:40,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-28 13:13:40,320 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:40,320 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:13:40,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-28 13:13:40,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:40,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:40,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:40,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:40,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-28 13:13:40,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:40,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:40,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:40,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:40,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:40,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-28 13:13:40,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:40,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:40,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:40,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:40,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:40,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:40,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,334 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:13:40,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,334 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:13:40,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:40,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:40,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-28 13:13:40,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:40,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:40,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:40,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:40,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:40,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:40,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:40,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:40,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:40,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-28 13:13:40,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:40,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:40,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:40,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:40,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:40,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:40,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:40,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:40,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:40,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:40,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:40,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:40,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:40,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:40,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:40,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:40,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:40,356 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:13:40,365 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:13:40,365 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:13:40,366 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:13:40,366 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:13:40,366 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:13:40,366 INFO L520 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-28 13:13:40,366 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:13:40,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:40,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:40,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:40,445 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:13:40,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 516 states and 851 transitions. cyclomatic complexity: 343 Second operand 4 states. [2018-11-28 13:13:40,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 516 states and 851 transitions. cyclomatic complexity: 343. Second operand 4 states. Result 1219 states and 2005 transitions. Complement of second has 6 states. [2018-11-28 13:13:40,483 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-28 13:13:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:13:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1016 transitions. [2018-11-28 13:13:40,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1016 transitions. Stem has 30 letters. Loop has 6 letters. [2018-11-28 13:13:40,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:40,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1016 transitions. Stem has 36 letters. Loop has 6 letters. [2018-11-28 13:13:40,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:40,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1016 transitions. Stem has 30 letters. Loop has 12 letters. [2018-11-28 13:13:40,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:40,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1219 states and 2005 transitions. [2018-11-28 13:13:40,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2018-11-28 13:13:40,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1219 states to 786 states and 1294 transitions. [2018-11-28 13:13:40,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 603 [2018-11-28 13:13:40,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 605 [2018-11-28 13:13:40,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 1294 transitions. [2018-11-28 13:13:40,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:40,496 INFO L705 BuchiCegarLoop]: Abstraction has 786 states and 1294 transitions. [2018-11-28 13:13:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 1294 transitions. [2018-11-28 13:13:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 568. [2018-11-28 13:13:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-11-28 13:13:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 940 transitions. [2018-11-28 13:13:40,504 INFO L728 BuchiCegarLoop]: Abstraction has 568 states and 940 transitions. [2018-11-28 13:13:40,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:13:40,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:13:40,504 INFO L87 Difference]: Start difference. First operand 568 states and 940 transitions. Second operand 5 states. [2018-11-28 13:13:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:40,613 INFO L93 Difference]: Finished difference Result 700 states and 1138 transitions. [2018-11-28 13:13:40,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:13:40,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 1138 transitions. [2018-11-28 13:13:40,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 426 [2018-11-28 13:13:40,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 700 states and 1138 transitions. [2018-11-28 13:13:40,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 567 [2018-11-28 13:13:40,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 567 [2018-11-28 13:13:40,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 700 states and 1138 transitions. [2018-11-28 13:13:40,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:40,620 INFO L705 BuchiCegarLoop]: Abstraction has 700 states and 1138 transitions. [2018-11-28 13:13:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states and 1138 transitions. [2018-11-28 13:13:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 480. [2018-11-28 13:13:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-28 13:13:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 782 transitions. [2018-11-28 13:13:40,626 INFO L728 BuchiCegarLoop]: Abstraction has 480 states and 782 transitions. [2018-11-28 13:13:40,627 INFO L608 BuchiCegarLoop]: Abstraction has 480 states and 782 transitions. [2018-11-28 13:13:40,627 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:13:40,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 782 transitions. [2018-11-28 13:13:40,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 213 [2018-11-28 13:13:40,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:40,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:40,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:40,629 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] [2018-11-28 13:13:40,630 INFO L794 eck$LassoCheckResult]: Stem: 14424#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 14134#L-1 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;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;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; 14135#L116-2 assume !!(add_history_type_~var~0 < 3); 14527#L117 assume 0 == add_history_type_~history_id;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; 14383#L171 assume 0 == read_history_bool_~history_id; 14384#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14105#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 14366#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 14367#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 14547#L116-2 assume !(add_history_type_~var~0 < 3); 14544#L116-3 add_history_type_#res := 1; 14397#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 14398#L255 assume !(0 == init_~tmp~1);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; 14515#L116-6 assume !!(add_history_type_~var~0 < 3); 14511#L117-2 assume !(0 == add_history_type_~history_id); 14512#L123-2 assume 1 == add_history_type_~history_id;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; 14545#L171-4 assume 0 == read_history_bool_~history_id; 14509#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14153#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14199#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14166#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 14392#L259 assume !(0 == init_~tmp___0~1);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; 14393#L116-10 assume !!(add_history_type_~var~0 < 3); 14503#L117-4 assume !(0 == add_history_type_~history_id); 14504#L123-4 assume 1 == add_history_type_~history_id;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; 14559#L171-7 assume 0 == read_history_bool_~history_id; 14498#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14265#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14190#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14157#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 14116#L263 assume !(0 == init_~tmp___1~1);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; 14117#L116-14 assume !!(add_history_type_~var~0 < 3); 14494#L117-6 assume !(0 == add_history_type_~history_id); 14496#L123-6 assume 1 == add_history_type_~history_id;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; 14553#L171-10 assume 0 == read_history_bool_~history_id; 14520#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14240#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14178#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14145#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 14425#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 14395#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 14206#L550-2 [2018-11-28 13:13:40,630 INFO L796 eck$LassoCheckResult]: Loop: 14206#L550-2 assume !!(main_~i2~0 < 10);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;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; 14390#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14331#L570-16 assume 0 != ~gate1Failed~0 % 256; 14333#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 14389#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; 14396#L409 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;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; 14381#L226-2 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14283#L570-17 assume 0 != ~gate2Failed~0 % 256; 14285#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 14243#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; 14211#L440 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;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; 14436#L226-4 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14287#L570-18 assume 0 != ~gate3Failed~0 % 256; 14289#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 14501#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; 14502#L471 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; 14522#L486 assume ~VALUE1~0 == ~VALUE2~0; 14524#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 14183#L570-19 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; 14292#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 14262#L570-20 ~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;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; 14299#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 14419#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 14548#L171-12 assume 0 == read_history_bool_~history_id; 14517#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14301#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 14149#L307 assume !(0 == check_~tmp___3~0 % 256); 14150#L307-1 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; 14161#L151-7 assume 3 == read_history_int8_~history_id; 14257#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14258#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 14263#L346 assume !(check_~tmp___10~0 > -2); 14471#L346-1 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; 14472#L151-9 assume 3 == read_history_int8_~history_id; 14245#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14236#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 14248#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 14338#L366-1 check_#res := 1; 14312#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 14313#L575-72 assume !(0 == assert_~arg % 256); 14205#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 14206#L550-2 [2018-11-28 13:13:40,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 317959147, now seen corresponding path program 1 times [2018-11-28 13:13:40,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:40,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:13:40,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:40,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:13:40,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:40,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1417533931, now seen corresponding path program 2 times [2018-11-28 13:13:40,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:40,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:40,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:40,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:40,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:40,692 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:40,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:40,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:40,692 INFO L87 Difference]: Start difference. First operand 480 states and 782 transitions. cyclomatic complexity: 307 Second operand 3 states. [2018-11-28 13:13:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:40,714 INFO L93 Difference]: Finished difference Result 491 states and 796 transitions. [2018-11-28 13:13:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:40,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 491 states and 796 transitions. [2018-11-28 13:13:40,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 223 [2018-11-28 13:13:40,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 491 states to 491 states and 796 transitions. [2018-11-28 13:13:40,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2018-11-28 13:13:40,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2018-11-28 13:13:40,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 491 states and 796 transitions. [2018-11-28 13:13:40,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:40,720 INFO L705 BuchiCegarLoop]: Abstraction has 491 states and 796 transitions. [2018-11-28 13:13:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states and 796 transitions. [2018-11-28 13:13:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 480. [2018-11-28 13:13:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-28 13:13:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 780 transitions. [2018-11-28 13:13:40,728 INFO L728 BuchiCegarLoop]: Abstraction has 480 states and 780 transitions. [2018-11-28 13:13:40,728 INFO L608 BuchiCegarLoop]: Abstraction has 480 states and 780 transitions. [2018-11-28 13:13:40,728 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:13:40,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 780 transitions. [2018-11-28 13:13:40,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 213 [2018-11-28 13:13:40,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:40,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:40,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:40,731 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] [2018-11-28 13:13:40,731 INFO L794 eck$LassoCheckResult]: Stem: 15404#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 15114#L-1 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;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;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; 15115#L116-2 assume !!(add_history_type_~var~0 < 3); 15507#L117 assume 0 == add_history_type_~history_id;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; 15363#L171 assume 0 == read_history_bool_~history_id; 15364#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15085#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 15346#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 15347#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 15527#L116-2 assume !(add_history_type_~var~0 < 3); 15524#L116-3 add_history_type_#res := 1; 15377#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 15378#L255 assume !(0 == init_~tmp~1);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; 15495#L116-6 assume !!(add_history_type_~var~0 < 3); 15491#L117-2 assume !(0 == add_history_type_~history_id); 15492#L123-2 assume 1 == add_history_type_~history_id;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; 15525#L171-4 assume 0 == read_history_bool_~history_id; 15489#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15133#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15179#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15146#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 15372#L259 assume !(0 == init_~tmp___0~1);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; 15373#L116-10 assume !!(add_history_type_~var~0 < 3); 15483#L117-4 assume !(0 == add_history_type_~history_id); 15484#L123-4 assume 1 == add_history_type_~history_id;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; 15538#L171-7 assume 0 == read_history_bool_~history_id; 15478#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15245#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15170#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15137#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 15096#L263 assume !(0 == init_~tmp___1~1);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; 15097#L116-14 assume !!(add_history_type_~var~0 < 3); 15474#L117-6 assume !(0 == add_history_type_~history_id); 15475#L123-6 assume 1 == add_history_type_~history_id;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; 15532#L171-10 assume 0 == read_history_bool_~history_id; 15500#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15220#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15158#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15125#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 15405#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 15375#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 15186#L550-2 [2018-11-28 13:13:40,731 INFO L796 eck$LassoCheckResult]: Loop: 15186#L550-2 assume !!(main_~i2~0 < 10);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;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; 15370#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15311#L570-16 assume 0 != ~gate1Failed~0 % 256; 15313#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 15369#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; 15376#L409 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;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; 15361#L226-2 assume !(0 == write_history_bool_~history_id); 15362#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 15263#L570-17 assume 0 != ~gate2Failed~0 % 256; 15265#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 15223#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; 15191#L440 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;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; 15416#L226-4 assume !(0 == write_history_bool_~history_id); 15406#L231-4 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 15267#L570-18 assume 0 != ~gate3Failed~0 % 256; 15269#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 15481#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; 15482#L471 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; 15502#L486 assume ~VALUE1~0 == ~VALUE2~0; 15504#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 15163#L570-19 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; 15272#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 15242#L570-20 ~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;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; 15279#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 15399#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 15528#L171-12 assume 0 == read_history_bool_~history_id; 15497#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15281#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 15129#L307 assume !(0 == check_~tmp___3~0 % 256); 15130#L307-1 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; 15141#L151-7 assume 3 == read_history_int8_~history_id; 15237#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15238#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 15243#L346 assume !(check_~tmp___10~0 > -2); 15451#L346-1 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; 15452#L151-9 assume 3 == read_history_int8_~history_id; 15225#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15216#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 15228#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 15318#L366-1 check_#res := 1; 15292#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 15293#L575-72 assume !(0 == assert_~arg % 256); 15185#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 15186#L550-2 [2018-11-28 13:13:40,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 317959147, now seen corresponding path program 2 times [2018-11-28 13:13:40,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:40,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:40,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:13:40,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:40,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:13:40,767 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:40,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:40,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1312957580, now seen corresponding path program 1 times [2018-11-28 13:13:40,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:40,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:40,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:40,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:40,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:40,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:40,787 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:13:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:13:40,788 INFO L87 Difference]: Start difference. First operand 480 states and 780 transitions. cyclomatic complexity: 305 Second operand 5 states. [2018-11-28 13:13:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:41,114 INFO L93 Difference]: Finished difference Result 986 states and 1523 transitions. [2018-11-28 13:13:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:13:41,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 986 states and 1523 transitions. [2018-11-28 13:13:41,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 632 [2018-11-28 13:13:41,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 986 states to 986 states and 1523 transitions. [2018-11-28 13:13:41,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 821 [2018-11-28 13:13:41,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 821 [2018-11-28 13:13:41,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 986 states and 1523 transitions. [2018-11-28 13:13:41,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:41,124 INFO L705 BuchiCegarLoop]: Abstraction has 986 states and 1523 transitions. [2018-11-28 13:13:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states and 1523 transitions. [2018-11-28 13:13:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 448. [2018-11-28 13:13:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-11-28 13:13:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 700 transitions. [2018-11-28 13:13:41,135 INFO L728 BuchiCegarLoop]: Abstraction has 448 states and 700 transitions. [2018-11-28 13:13:41,135 INFO L608 BuchiCegarLoop]: Abstraction has 448 states and 700 transitions. [2018-11-28 13:13:41,135 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:13:41,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 448 states and 700 transitions. [2018-11-28 13:13:41,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 205 [2018-11-28 13:13:41,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:41,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:41,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:41,137 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] [2018-11-28 13:13:41,137 INFO L794 eck$LassoCheckResult]: Stem: 16884#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 16598#L-1 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;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;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; 16599#L116-2 assume !!(add_history_type_~var~0 < 3); 16962#L117 assume 0 == add_history_type_~history_id;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; 16843#L171 assume 0 == read_history_bool_~history_id; 16844#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 16572#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 16826#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 16827#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 16979#L116-2 assume !(add_history_type_~var~0 < 3); 16976#L116-3 add_history_type_#res := 1; 16858#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 16859#L255 assume !(0 == init_~tmp~1);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; 16957#L116-6 assume !!(add_history_type_~var~0 < 3); 16953#L117-2 assume !(0 == add_history_type_~history_id); 16954#L123-2 assume 1 == add_history_type_~history_id;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; 16977#L171-4 assume !(0 == read_history_bool_~history_id); 16897#L181-4 assume 1 == read_history_bool_~history_id; 16898#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16804#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16657#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16622#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 16852#L259 assume !(0 == init_~tmp___0~1);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; 16853#L116-10 assume !!(add_history_type_~var~0 < 3); 16949#L117-4 assume !(0 == add_history_type_~history_id); 16950#L123-4 assume 1 == add_history_type_~history_id;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; 16991#L171-7 assume !(0 == read_history_bool_~history_id); 16923#L181-7 assume 1 == read_history_bool_~history_id; 16924#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16725#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16648#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16613#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 16580#L263 assume !(0 == init_~tmp___1~1);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; 16581#L116-14 assume !!(add_history_type_~var~0 < 3); 16942#L117-6 assume !(0 == add_history_type_~history_id); 16943#L123-6 assume 1 == add_history_type_~history_id;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; 16985#L171-10 assume !(0 == read_history_bool_~history_id); 16911#L181-10 assume 1 == read_history_bool_~history_id; 16912#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16696#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16636#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16605#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 16885#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 16855#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 16662#L550-2 [2018-11-28 13:13:41,138 INFO L796 eck$LassoCheckResult]: Loop: 16662#L550-2 assume !!(main_~i2~0 < 10);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;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; 16850#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 16789#L570-16 assume 0 != ~gate1Failed~0 % 256; 16791#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 16849#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; 16856#L409 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;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; 16841#L226-2 assume !(0 == write_history_bool_~history_id); 16842#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16742#L570-17 assume 0 != ~gate2Failed~0 % 256; 16744#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 16699#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; 16667#L440 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;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; 16896#L226-4 assume !(0 == write_history_bool_~history_id); 16886#L231-4 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16745#L570-18 assume 0 != ~gate3Failed~0 % 256; 16747#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 16947#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; 16948#L471 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; 16959#L486 assume ~VALUE1~0 == ~VALUE2~0; 16961#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 16639#L570-19 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; 16752#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 16718#L570-20 ~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;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; 16759#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 16879#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 16980#L171-12 assume 0 == read_history_bool_~history_id; 16958#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 16761#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 16609#L307 assume !(0 == check_~tmp___3~0 % 256); 16610#L307-1 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; 16617#L151-7 assume 3 == read_history_int8_~history_id; 16714#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 16715#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 16719#L346 assume !(check_~tmp___10~0 > -2); 16931#L346-1 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; 16932#L151-9 assume 3 == read_history_int8_~history_id; 16701#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 16692#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 16704#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 16794#L366-1 check_#res := 1; 16770#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 16771#L575-72 assume !(0 == assert_~arg % 256); 16661#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 16662#L550-2 [2018-11-28 13:13:41,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 1 times [2018-11-28 13:13:41,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:41,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:13:41,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:13:41,179 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:41,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1312957580, now seen corresponding path program 2 times [2018-11-28 13:13:41,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:41,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:41,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,194 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:41,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:41,194 INFO L87 Difference]: Start difference. First operand 448 states and 700 transitions. cyclomatic complexity: 257 Second operand 3 states. [2018-11-28 13:13:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:41,227 INFO L93 Difference]: Finished difference Result 469 states and 730 transitions. [2018-11-28 13:13:41,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:41,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 469 states and 730 transitions. [2018-11-28 13:13:41,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 225 [2018-11-28 13:13:41,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 469 states to 469 states and 730 transitions. [2018-11-28 13:13:41,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 348 [2018-11-28 13:13:41,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 348 [2018-11-28 13:13:41,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 469 states and 730 transitions. [2018-11-28 13:13:41,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:41,232 INFO L705 BuchiCegarLoop]: Abstraction has 469 states and 730 transitions. [2018-11-28 13:13:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states and 730 transitions. [2018-11-28 13:13:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 448. [2018-11-28 13:13:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-11-28 13:13:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 699 transitions. [2018-11-28 13:13:41,237 INFO L728 BuchiCegarLoop]: Abstraction has 448 states and 699 transitions. [2018-11-28 13:13:41,237 INFO L608 BuchiCegarLoop]: Abstraction has 448 states and 699 transitions. [2018-11-28 13:13:41,237 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 13:13:41,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 448 states and 699 transitions. [2018-11-28 13:13:41,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 205 [2018-11-28 13:13:41,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:41,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:41,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:41,239 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] [2018-11-28 13:13:41,240 INFO L794 eck$LassoCheckResult]: Stem: 17809#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 17523#L-1 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;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;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; 17524#L116-2 assume !!(add_history_type_~var~0 < 3); 17887#L117 assume 0 == add_history_type_~history_id;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; 17768#L171 assume 0 == read_history_bool_~history_id; 17769#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17497#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 17751#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 17752#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 17904#L116-2 assume !(add_history_type_~var~0 < 3); 17901#L116-3 add_history_type_#res := 1; 17783#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 17784#L255 assume !(0 == init_~tmp~1);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; 17882#L116-6 assume !!(add_history_type_~var~0 < 3); 17878#L117-2 assume !(0 == add_history_type_~history_id); 17879#L123-2 assume 1 == add_history_type_~history_id;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; 17902#L171-4 assume !(0 == read_history_bool_~history_id); 17822#L181-4 assume 1 == read_history_bool_~history_id; 17823#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17729#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17582#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17547#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 17777#L259 assume !(0 == init_~tmp___0~1);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; 17778#L116-10 assume !!(add_history_type_~var~0 < 3); 17874#L117-4 assume !(0 == add_history_type_~history_id); 17875#L123-4 assume 1 == add_history_type_~history_id;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; 17915#L171-7 assume !(0 == read_history_bool_~history_id); 17848#L181-7 assume 1 == read_history_bool_~history_id; 17849#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17650#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17573#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17538#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 17505#L263 assume !(0 == init_~tmp___1~1);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; 17506#L116-14 assume !!(add_history_type_~var~0 < 3); 17867#L117-6 assume !(0 == add_history_type_~history_id); 17869#L123-6 assume 1 == add_history_type_~history_id;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; 17909#L171-10 assume !(0 == read_history_bool_~history_id); 17836#L181-10 assume 1 == read_history_bool_~history_id; 17837#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17621#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17561#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17530#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 17810#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 17780#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 17587#L550-2 [2018-11-28 13:13:41,240 INFO L796 eck$LassoCheckResult]: Loop: 17587#L550-2 assume !!(main_~i2~0 < 10);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;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; 17775#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 17714#L570-16 assume 0 != ~gate1Failed~0 % 256; 17716#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 17774#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; 17781#L409 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;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; 17766#L226-2 assume !(0 == write_history_bool_~history_id); 17767#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17667#L570-17 assume 0 != ~gate2Failed~0 % 256; 17669#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 17624#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; 17592#L440 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;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; 17821#L226-4 assume !(0 == write_history_bool_~history_id); 17811#L231-4 assume !(1 == write_history_bool_~history_id); 17812#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 17670#L570-18 assume 0 != ~gate3Failed~0 % 256; 17672#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 17872#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; 17873#L471 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; 17884#L486 assume ~VALUE1~0 == ~VALUE2~0; 17886#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 17564#L570-19 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; 17677#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 17643#L570-20 ~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;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; 17684#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 17804#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 17905#L171-12 assume 0 == read_history_bool_~history_id; 17883#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17686#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 17534#L307 assume !(0 == check_~tmp___3~0 % 256); 17535#L307-1 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; 17542#L151-7 assume 3 == read_history_int8_~history_id; 17639#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17640#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 17644#L346 assume !(check_~tmp___10~0 > -2); 17856#L346-1 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; 17857#L151-9 assume 3 == read_history_int8_~history_id; 17626#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17617#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 17629#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 17719#L366-1 check_#res := 1; 17695#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17696#L575-72 assume !(0 == assert_~arg % 256); 17586#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 17587#L550-2 [2018-11-28 13:13:41,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 2 times [2018-11-28 13:13:41,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:13:41,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:13:41,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:41,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash 456187534, now seen corresponding path program 1 times [2018-11-28 13:13:41,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:41,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,299 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:41,299 INFO L87 Difference]: Start difference. First operand 448 states and 699 transitions. cyclomatic complexity: 256 Second operand 3 states. [2018-11-28 13:13:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:41,312 INFO L93 Difference]: Finished difference Result 638 states and 999 transitions. [2018-11-28 13:13:41,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:41,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 638 states and 999 transitions. [2018-11-28 13:13:41,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-28 13:13:41,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 638 states to 638 states and 999 transitions. [2018-11-28 13:13:41,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 517 [2018-11-28 13:13:41,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 517 [2018-11-28 13:13:41,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 638 states and 999 transitions. [2018-11-28 13:13:41,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:41,318 INFO L705 BuchiCegarLoop]: Abstraction has 638 states and 999 transitions. [2018-11-28 13:13:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states and 999 transitions. [2018-11-28 13:13:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 490. [2018-11-28 13:13:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-11-28 13:13:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 762 transitions. [2018-11-28 13:13:41,324 INFO L728 BuchiCegarLoop]: Abstraction has 490 states and 762 transitions. [2018-11-28 13:13:41,324 INFO L608 BuchiCegarLoop]: Abstraction has 490 states and 762 transitions. [2018-11-28 13:13:41,324 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 13:13:41,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 490 states and 762 transitions. [2018-11-28 13:13:41,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2018-11-28 13:13:41,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:41,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:41,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:41,326 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-28 13:13:41,326 INFO L794 eck$LassoCheckResult]: Stem: 18908#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 18617#L-1 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;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;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; 18618#L116-2 assume !!(add_history_type_~var~0 < 3); 18988#L117 assume 0 == add_history_type_~history_id;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; 18866#L171 assume 0 == read_history_bool_~history_id; 18867#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18591#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 18849#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 18850#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 19005#L116-2 assume !(add_history_type_~var~0 < 3); 19002#L116-3 add_history_type_#res := 1; 18881#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 18882#L255 assume !(0 == init_~tmp~1);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; 18982#L116-6 assume !!(add_history_type_~var~0 < 3); 18978#L117-2 assume !(0 == add_history_type_~history_id); 18979#L123-2 assume 1 == add_history_type_~history_id;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; 19003#L171-4 assume !(0 == read_history_bool_~history_id); 18922#L181-4 assume 1 == read_history_bool_~history_id; 18923#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18827#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18676#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18641#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 18875#L259 assume !(0 == init_~tmp___0~1);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; 18876#L116-10 assume !!(add_history_type_~var~0 < 3); 18974#L117-4 assume !(0 == add_history_type_~history_id); 18975#L123-4 assume 1 == add_history_type_~history_id;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; 19019#L171-7 assume !(0 == read_history_bool_~history_id); 18948#L181-7 assume 1 == read_history_bool_~history_id; 18949#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18744#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18667#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18632#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 18599#L263 assume !(0 == init_~tmp___1~1);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; 18600#L116-14 assume !!(add_history_type_~var~0 < 3); 18967#L117-6 assume !(0 == add_history_type_~history_id); 18969#L123-6 assume 1 == add_history_type_~history_id;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; 19013#L171-10 assume !(0 == read_history_bool_~history_id); 18936#L181-10 assume 1 == read_history_bool_~history_id; 18937#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18715#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18655#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18624#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 18909#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 18878#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 18681#L550-2 [2018-11-28 13:13:41,326 INFO L796 eck$LassoCheckResult]: Loop: 18681#L550-2 assume !!(main_~i2~0 < 10);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;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; 18873#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 18812#L570-16 assume 0 != ~gate1Failed~0 % 256; 18814#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 18872#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; 18879#L409 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;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; 18864#L226-2 assume !(0 == write_history_bool_~history_id); 18865#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 18761#L570-17 assume 0 != ~gate2Failed~0 % 256; 18763#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 18779#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; 18920#L440 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;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; 18921#L226-4 assume !(0 == write_history_bool_~history_id); 19065#L231-4 assume !(1 == write_history_bool_~history_id); 19064#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 18764#L570-18 assume 0 != ~gate3Failed~0 % 256; 18766#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 18987#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; 19058#L471 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; 19057#L486 assume ~VALUE1~0 == ~VALUE2~0; 19042#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 18658#L570-19 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; 18772#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 18737#L570-20 ~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;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; 18780#L294 assume !(0 == ~gate1Failed~0 % 256); 18902#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 18903#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 19008#L171-12 assume 0 == read_history_bool_~history_id; 18983#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18782#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 18628#L307 assume !(0 == check_~tmp___3~0 % 256); 18629#L307-1 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; 18636#L151-7 assume 3 == read_history_int8_~history_id; 18733#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18734#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 18738#L346 assume !(check_~tmp___10~0 > -2); 18956#L346-1 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; 18957#L151-9 assume 3 == read_history_int8_~history_id; 18720#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18711#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 18723#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 18817#L366-1 check_#res := 1; 18792#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 18793#L575-72 assume !(0 == assert_~arg % 256); 18680#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 18681#L550-2 [2018-11-28 13:13:41,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 3 times [2018-11-28 13:13:41,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:13:41,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:13:41,372 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:41,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1361249562, now seen corresponding path program 1 times [2018-11-28 13:13:41,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:41,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,395 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:41,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:13:41,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:13:41,396 INFO L87 Difference]: Start difference. First operand 490 states and 762 transitions. cyclomatic complexity: 277 Second operand 4 states. [2018-11-28 13:13:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:41,423 INFO L93 Difference]: Finished difference Result 744 states and 1157 transitions. [2018-11-28 13:13:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:13:41,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 744 states and 1157 transitions. [2018-11-28 13:13:41,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 494 [2018-11-28 13:13:41,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 744 states to 709 states and 1104 transitions. [2018-11-28 13:13:41,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 588 [2018-11-28 13:13:41,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 588 [2018-11-28 13:13:41,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 709 states and 1104 transitions. [2018-11-28 13:13:41,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:41,430 INFO L705 BuchiCegarLoop]: Abstraction has 709 states and 1104 transitions. [2018-11-28 13:13:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states and 1104 transitions. [2018-11-28 13:13:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 457. [2018-11-28 13:13:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-11-28 13:13:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 710 transitions. [2018-11-28 13:13:41,438 INFO L728 BuchiCegarLoop]: Abstraction has 457 states and 710 transitions. [2018-11-28 13:13:41,438 INFO L608 BuchiCegarLoop]: Abstraction has 457 states and 710 transitions. [2018-11-28 13:13:41,438 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 13:13:41,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 457 states and 710 transitions. [2018-11-28 13:13:41,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2018-11-28 13:13:41,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:41,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:41,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:41,441 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-28 13:13:41,442 INFO L794 eck$LassoCheckResult]: Stem: 20128#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 19861#L-1 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;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;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; 19862#L116-2 assume !!(add_history_type_~var~0 < 3); 20199#L117 assume 0 == add_history_type_~history_id;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; 20087#L171 assume 0 == read_history_bool_~history_id; 20088#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 19835#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 20073#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 20074#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 20214#L116-2 assume !(add_history_type_~var~0 < 3); 20212#L116-3 add_history_type_#res := 1; 20102#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 20103#L255 assume !(0 == init_~tmp~1);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; 20194#L116-6 assume !!(add_history_type_~var~0 < 3); 20192#L117-2 assume !(0 == add_history_type_~history_id); 20193#L123-2 assume !(1 == add_history_type_~history_id); 20246#L129-2 assume !(2 == add_history_type_~history_id); 20236#L135-3 assume !(3 == add_history_type_~history_id); 19885#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 20226#L116-6 assume !(add_history_type_~var~0 < 3); 20223#L116-7 add_history_type_#res := 1; 20132#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 20096#L259 assume !(0 == init_~tmp___0~1);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; 20097#L116-10 assume !!(add_history_type_~var~0 < 3); 20188#L117-4 assume !(0 == add_history_type_~history_id); 20190#L123-4 assume 1 == add_history_type_~history_id;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; 20227#L171-7 assume !(0 == read_history_bool_~history_id); 20162#L181-7 assume 1 == read_history_bool_~history_id; 20163#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19979#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19903#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19877#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 19843#L263 assume !(0 == init_~tmp___1~1);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; 19844#L116-14 assume !!(add_history_type_~var~0 < 3); 20181#L117-6 assume !(0 == add_history_type_~history_id); 20183#L123-6 assume 1 == add_history_type_~history_id;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; 20221#L171-10 assume !(0 == read_history_bool_~history_id); 20150#L181-10 assume 1 == read_history_bool_~history_id; 20151#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19953#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19894#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19871#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 20129#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 20099#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 19916#L550-2 [2018-11-28 13:13:41,442 INFO L796 eck$LassoCheckResult]: Loop: 19916#L550-2 assume !!(main_~i2~0 < 10);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;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; 20094#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 20041#L570-16 assume 0 != ~gate1Failed~0 % 256; 20043#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 20093#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; 20100#L409 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;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; 20085#L226-2 assume !(0 == write_history_bool_~history_id); 20086#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 19994#L570-17 assume 0 != ~gate2Failed~0 % 256; 19996#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 19956#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; 19921#L440 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;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; 20138#L226-4 assume !(0 == write_history_bool_~history_id); 20130#L231-4 assume !(1 == write_history_bool_~history_id); 20131#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 19998#L570-18 assume 0 != ~gate3Failed~0 % 256; 20000#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 20186#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; 20187#L471 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; 20196#L486 assume ~VALUE1~0 == ~VALUE2~0; 20198#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 19897#L570-19 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; 20002#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 19972#L570-20 ~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;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; 20009#L294 assume !(0 == ~gate1Failed~0 % 256); 20122#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 20123#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 20216#L171-12 assume 0 == read_history_bool_~history_id; 20195#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 20011#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 19867#L307 assume !(0 == check_~tmp___3~0 % 256); 19868#L307-1 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; 19875#L151-7 assume 3 == read_history_int8_~history_id; 19963#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 19964#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 19973#L346 assume !(check_~tmp___10~0 > -2); 20169#L346-1 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; 20170#L151-9 assume 3 == read_history_int8_~history_id; 19950#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 19946#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 19958#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 20046#L366-1 check_#res := 1; 20022#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 20023#L575-72 assume !(0 == assert_~arg % 256); 19915#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 19916#L550-2 [2018-11-28 13:13:41,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2106629905, now seen corresponding path program 1 times [2018-11-28 13:13:41,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:13:41,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:41,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1361249562, now seen corresponding path program 2 times [2018-11-28 13:13:41,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:41,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,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-28 13:13:41,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,487 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:41,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:41,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:41,488 INFO L87 Difference]: Start difference. First operand 457 states and 710 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-11-28 13:13:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:41,522 INFO L93 Difference]: Finished difference Result 705 states and 1090 transitions. [2018-11-28 13:13:41,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:41,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 705 states and 1090 transitions. [2018-11-28 13:13:41,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 494 [2018-11-28 13:13:41,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 705 states to 705 states and 1090 transitions. [2018-11-28 13:13:41,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 596 [2018-11-28 13:13:41,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 596 [2018-11-28 13:13:41,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 1090 transitions. [2018-11-28 13:13:41,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:41,531 INFO L705 BuchiCegarLoop]: Abstraction has 705 states and 1090 transitions. [2018-11-28 13:13:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 1090 transitions. [2018-11-28 13:13:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 447. [2018-11-28 13:13:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-11-28 13:13:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 690 transitions. [2018-11-28 13:13:41,538 INFO L728 BuchiCegarLoop]: Abstraction has 447 states and 690 transitions. [2018-11-28 13:13:41,538 INFO L608 BuchiCegarLoop]: Abstraction has 447 states and 690 transitions. [2018-11-28 13:13:41,538 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 13:13:41,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 690 transitions. [2018-11-28 13:13:41,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2018-11-28 13:13:41,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:41,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:41,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:41,542 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-28 13:13:41,542 INFO L794 eck$LassoCheckResult]: Stem: 21287#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 21030#L-1 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;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;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; 21031#L116-2 assume !!(add_history_type_~var~0 < 3); 21359#L117 assume 0 == add_history_type_~history_id;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; 21246#L171 assume 0 == read_history_bool_~history_id; 21247#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21004#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 21235#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 21236#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 21373#L116-2 assume !(add_history_type_~var~0 < 3); 21371#L116-3 add_history_type_#res := 1; 21261#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 21262#L255 assume !(0 == init_~tmp~1);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; 21354#L116-6 assume !!(add_history_type_~var~0 < 3); 21352#L117-2 assume !(0 == add_history_type_~history_id); 21353#L123-2 assume 1 == add_history_type_~history_id;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; 21372#L171-4 assume !(0 == read_history_bool_~history_id); 21295#L181-4 assume 1 == read_history_bool_~history_id; 21296#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21219#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21080#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 21081#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 21385#L116-6 assume !(add_history_type_~var~0 < 3); 21382#L116-7 add_history_type_#res := 1; 21291#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 21256#L259 assume !(0 == init_~tmp___0~1);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; 21257#L116-10 assume !!(add_history_type_~var~0 < 3); 21346#L117-4 assume !(0 == add_history_type_~history_id); 21348#L123-4 assume 1 == add_history_type_~history_id;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; 21386#L171-7 assume !(0 == read_history_bool_~history_id); 21318#L181-7 assume 1 == read_history_bool_~history_id; 21319#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21146#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21068#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 21046#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 21012#L263 assume !(0 == init_~tmp___1~1);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; 21013#L116-14 assume !!(add_history_type_~var~0 < 3); 21337#L117-6 assume !(0 == add_history_type_~history_id); 21339#L123-6 assume 1 == add_history_type_~history_id;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; 21380#L171-10 assume !(0 == read_history_bool_~history_id); 21306#L181-10 assume 1 == read_history_bool_~history_id; 21307#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21121#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21058#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 21037#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 21288#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 21258#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 21083#L550-2 [2018-11-28 13:13:41,543 INFO L796 eck$LassoCheckResult]: Loop: 21083#L550-2 assume !!(main_~i2~0 < 10);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;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; 21253#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 21206#L570-16 assume 0 != ~gate1Failed~0 % 256; 21208#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 21252#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; 21259#L409 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;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; 21244#L226-2 assume !(0 == write_history_bool_~history_id); 21245#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 21158#L570-17 assume 0 != ~gate2Failed~0 % 256; 21160#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 21116#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; 21088#L440 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;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; 21294#L226-4 assume !(0 == write_history_bool_~history_id); 21289#L231-4 assume !(1 == write_history_bool_~history_id); 21290#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 21162#L570-18 assume 0 != ~gate3Failed~0 % 256; 21164#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 21344#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; 21345#L471 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; 21356#L486 assume ~VALUE1~0 == ~VALUE2~0; 21358#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 21062#L570-19 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; 21167#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 21139#L570-20 ~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;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; 21174#L294 assume !(0 == ~gate1Failed~0 % 256); 21281#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 21282#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 21375#L171-12 assume 0 == read_history_bool_~history_id; 21355#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21176#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 21041#L307 assume !(0 == check_~tmp___3~0 % 256); 21042#L307-1 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; 21044#L151-7 assume 3 == read_history_int8_~history_id; 21130#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 21131#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 21140#L346 assume !(check_~tmp___10~0 > -2); 21325#L346-1 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; 21326#L151-9 assume 3 == read_history_int8_~history_id; 21118#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 21113#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 21125#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 21211#L366-1 check_#res := 1; 21187#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 21188#L575-72 assume !(0 == assert_~arg % 256); 21082#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 21083#L550-2 [2018-11-28 13:13:41,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 1 times [2018-11-28 13:13:41,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,579 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-28 13:13:41,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,580 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:41,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1361249562, now seen corresponding path program 3 times [2018-11-28 13:13:41,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:41,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,611 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:41,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:41,612 INFO L87 Difference]: Start difference. First operand 447 states and 690 transitions. cyclomatic complexity: 250 Second operand 3 states. [2018-11-28 13:13:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:41,637 INFO L93 Difference]: Finished difference Result 667 states and 1036 transitions. [2018-11-28 13:13:41,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:41,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 667 states and 1036 transitions. [2018-11-28 13:13:41,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 467 [2018-11-28 13:13:41,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 667 states to 667 states and 1036 transitions. [2018-11-28 13:13:41,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 558 [2018-11-28 13:13:41,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2018-11-28 13:13:41,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 1036 transitions. [2018-11-28 13:13:41,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:41,644 INFO L705 BuchiCegarLoop]: Abstraction has 667 states and 1036 transitions. [2018-11-28 13:13:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 1036 transitions. [2018-11-28 13:13:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 504. [2018-11-28 13:13:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-28 13:13:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 776 transitions. [2018-11-28 13:13:41,672 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 776 transitions. [2018-11-28 13:13:41,672 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 776 transitions. [2018-11-28 13:13:41,672 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 13:13:41,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 776 transitions. [2018-11-28 13:13:41,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 13:13:41,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:41,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:41,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:41,674 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] [2018-11-28 13:13:41,674 INFO L794 eck$LassoCheckResult]: Stem: 22409#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 22151#L-1 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;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;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; 22152#L116-2 assume !!(add_history_type_~var~0 < 3); 22482#L117 assume 0 == add_history_type_~history_id;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; 22369#L171 assume 0 == read_history_bool_~history_id; 22370#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22125#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 22358#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 22359#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 22497#L116-2 assume !(add_history_type_~var~0 < 3); 22495#L116-3 add_history_type_#res := 1; 22384#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 22385#L255 assume !(0 == init_~tmp~1);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; 22477#L116-6 assume !!(add_history_type_~var~0 < 3); 22475#L117-2 assume !(0 == add_history_type_~history_id); 22476#L123-2 assume 1 == add_history_type_~history_id;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; 22496#L171-4 assume !(0 == read_history_bool_~history_id); 22417#L181-4 assume 1 == read_history_bool_~history_id; 22418#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22346#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22201#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 22202#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 22508#L116-6 assume !(add_history_type_~var~0 < 3); 22505#L116-7 add_history_type_#res := 1; 22413#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 22379#L259 assume !(0 == init_~tmp___0~1);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; 22380#L116-10 assume !!(add_history_type_~var~0 < 3); 22469#L117-4 assume !(0 == add_history_type_~history_id); 22471#L123-4 assume 1 == add_history_type_~history_id;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; 22509#L171-7 assume !(0 == read_history_bool_~history_id); 22440#L181-7 assume 1 == read_history_bool_~history_id; 22441#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22264#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22184#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22166#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 22133#L263 assume !(0 == init_~tmp___1~1);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; 22134#L116-14 assume !!(add_history_type_~var~0 < 3); 22459#L117-6 assume !(0 == add_history_type_~history_id); 22461#L123-6 assume 1 == add_history_type_~history_id;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; 22503#L171-10 assume !(0 == read_history_bool_~history_id); 22428#L181-10 assume 1 == read_history_bool_~history_id; 22429#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22238#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22177#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22158#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 22410#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 22381#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 22204#L550-2 [2018-11-28 13:13:41,675 INFO L796 eck$LassoCheckResult]: Loop: 22204#L550-2 assume !!(main_~i2~0 < 10);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;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; 22376#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 22329#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 22330#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 22374#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 22378#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; 22494#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; 22498#L409 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;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; 22367#L226-2 assume !(0 == write_history_bool_~history_id); 22368#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 22280#L570-17 assume 0 != ~gate2Failed~0 % 256; 22282#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 22241#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; 22242#L440 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;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; 22416#L226-4 assume !(0 == write_history_bool_~history_id); 22411#L231-4 assume !(1 == write_history_bool_~history_id); 22412#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 22284#L570-18 assume 0 != ~gate3Failed~0 % 256; 22286#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 22467#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; 22468#L471 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; 22610#L486 assume ~VALUE1~0 == ~VALUE2~0; 22604#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 22603#L570-19 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; 22529#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 22261#L570-20 ~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;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; 22535#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 22526#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 22499#L171-12 assume 0 == read_history_bool_~history_id; 22478#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22299#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 22162#L307 assume !(0 == check_~tmp___3~0 % 256); 22163#L307-1 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; 22170#L151-7 assume 3 == read_history_int8_~history_id; 22256#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22257#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 22262#L346 assume !(check_~tmp___10~0 > -2); 22447#L346-1 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; 22448#L151-9 assume 3 == read_history_int8_~history_id; 22244#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22234#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 22247#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 22334#L366-1 check_#res := 1; 22310#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 22311#L575-72 assume !(0 == assert_~arg % 256); 22203#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 22204#L550-2 [2018-11-28 13:13:41,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,675 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 2 times [2018-11-28 13:13:41,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:41,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,706 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-28 13:13:41,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,707 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:41,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2090910731, now seen corresponding path program 1 times [2018-11-28 13:13:41,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:41,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:41,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,730 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:41,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:41,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:41,730 INFO L87 Difference]: Start difference. First operand 504 states and 776 transitions. cyclomatic complexity: 279 Second operand 3 states. [2018-11-28 13:13:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:41,805 INFO L93 Difference]: Finished difference Result 767 states and 1131 transitions. [2018-11-28 13:13:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:41,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 767 states and 1131 transitions. [2018-11-28 13:13:41,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 13:13:41,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 767 states to 767 states and 1131 transitions. [2018-11-28 13:13:41,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 605 [2018-11-28 13:13:41,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 605 [2018-11-28 13:13:41,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 767 states and 1131 transitions. [2018-11-28 13:13:41,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:41,811 INFO L705 BuchiCegarLoop]: Abstraction has 767 states and 1131 transitions. [2018-11-28 13:13:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 1131 transitions. [2018-11-28 13:13:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 504. [2018-11-28 13:13:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-28 13:13:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 748 transitions. [2018-11-28 13:13:41,818 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 748 transitions. [2018-11-28 13:13:41,818 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 748 transitions. [2018-11-28 13:13:41,818 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 13:13:41,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 748 transitions. [2018-11-28 13:13:41,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 13:13:41,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:41,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:41,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:41,820 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-28 13:13:41,820 INFO L794 eck$LassoCheckResult]: Stem: 23687#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 23429#L-1 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;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;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; 23430#L116-2 assume !!(add_history_type_~var~0 < 3); 23760#L117 assume 0 == add_history_type_~history_id;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; 23647#L171 assume 0 == read_history_bool_~history_id; 23648#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 23400#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 23636#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 23637#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 23775#L116-2 assume !(add_history_type_~var~0 < 3); 23773#L116-3 add_history_type_#res := 1; 23661#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 23662#L255 assume !(0 == init_~tmp~1);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; 23755#L116-6 assume !!(add_history_type_~var~0 < 3); 23753#L117-2 assume !(0 == add_history_type_~history_id); 23754#L123-2 assume 1 == add_history_type_~history_id;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; 23774#L171-4 assume !(0 == read_history_bool_~history_id); 23695#L181-4 assume 1 == read_history_bool_~history_id; 23696#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23618#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23475#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 23476#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 23785#L116-6 assume !(add_history_type_~var~0 < 3); 23782#L116-7 add_history_type_#res := 1; 23691#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 23656#L259 assume !(0 == init_~tmp___0~1);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; 23657#L116-10 assume !!(add_history_type_~var~0 < 3); 23747#L117-4 assume !(0 == add_history_type_~history_id); 23749#L123-4 assume 1 == add_history_type_~history_id;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; 23786#L171-7 assume !(0 == read_history_bool_~history_id); 23718#L181-7 assume 1 == read_history_bool_~history_id; 23719#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23542#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23465#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23444#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 23411#L263 assume !(0 == init_~tmp___1~1);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; 23412#L116-14 assume !!(add_history_type_~var~0 < 3); 23737#L117-6 assume !(0 == add_history_type_~history_id); 23739#L123-6 assume 1 == add_history_type_~history_id;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; 23780#L171-10 assume !(0 == read_history_bool_~history_id); 23706#L181-10 assume 1 == read_history_bool_~history_id; 23707#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23516#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23455#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23436#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 23688#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 23659#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 23482#L550-2 [2018-11-28 13:13:41,820 INFO L796 eck$LassoCheckResult]: Loop: 23482#L550-2 assume !!(main_~i2~0 < 10);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;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; 23654#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 23607#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 23608#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 23652#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 23658#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; 23772#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; 23743#L409 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;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; 23645#L226-2 assume !(0 == write_history_bool_~history_id); 23646#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 23558#L570-17 assume 0 != ~gate2Failed~0 % 256; 23560#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 23888#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; 23885#L440 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;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; 23882#L226-4 assume !(0 == write_history_bool_~history_id); 23880#L231-4 assume !(1 == write_history_bool_~history_id); 23877#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 23873#L570-18 assume 0 != ~gate3Failed~0 % 256; 23871#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 23869#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; 23867#L471 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; 23866#L486 assume ~VALUE1~0 == ~VALUE2~0; 23857#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 23856#L570-19 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; 23855#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 23850#L570-20 ~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;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; 23807#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 23802#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 23776#L171-12 assume 0 == read_history_bool_~history_id; 23756#L172-12 assume !(0 == read_history_bool_~historyIndex); 23734#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 23577#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 23440#L307 assume !(0 == check_~tmp___3~0 % 256); 23441#L307-1 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; 23448#L151-7 assume 3 == read_history_int8_~history_id; 23534#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 23535#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 23540#L346 assume !(check_~tmp___10~0 > -2); 23725#L346-1 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; 23726#L151-9 assume 3 == read_history_int8_~history_id; 23522#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 23512#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 23525#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 23612#L366-1 check_#res := 1; 23588#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 23589#L575-72 assume !(0 == assert_~arg % 256); 23481#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 23482#L550-2 [2018-11-28 13:13:41,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 3 times [2018-11-28 13:13:41,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:41,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,850 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-28 13:13:41,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:41,851 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:41,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash 723701399, now seen corresponding path program 1 times [2018-11-28 13:13:41,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:41,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:41,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:41,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:13:41,881 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:13:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:13:41,881 INFO L87 Difference]: Start difference. First operand 504 states and 748 transitions. cyclomatic complexity: 251 Second operand 4 states. [2018-11-28 13:13:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:42,038 INFO L93 Difference]: Finished difference Result 1384 states and 2038 transitions. [2018-11-28 13:13:42,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:13:42,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1384 states and 2038 transitions. [2018-11-28 13:13:42,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 561 [2018-11-28 13:13:42,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1384 states to 1384 states and 2038 transitions. [2018-11-28 13:13:42,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1122 [2018-11-28 13:13:42,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1122 [2018-11-28 13:13:42,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1384 states and 2038 transitions. [2018-11-28 13:13:42,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:42,048 INFO L705 BuchiCegarLoop]: Abstraction has 1384 states and 2038 transitions. [2018-11-28 13:13:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states and 2038 transitions. [2018-11-28 13:13:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 504. [2018-11-28 13:13:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-28 13:13:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 747 transitions. [2018-11-28 13:13:42,056 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 747 transitions. [2018-11-28 13:13:42,056 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 747 transitions. [2018-11-28 13:13:42,056 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 13:13:42,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 747 transitions. [2018-11-28 13:13:42,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 13:13:42,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:42,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:42,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:42,058 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-28 13:13:42,058 INFO L794 eck$LassoCheckResult]: Stem: 25585#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 25328#L-1 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;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;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; 25329#L116-2 assume !!(add_history_type_~var~0 < 3); 25659#L117 assume 0 == add_history_type_~history_id;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; 25545#L171 assume 0 == read_history_bool_~history_id; 25546#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 25302#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 25534#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 25535#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 25673#L116-2 assume !(add_history_type_~var~0 < 3); 25671#L116-3 add_history_type_#res := 1; 25560#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 25561#L255 assume !(0 == init_~tmp~1);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; 25652#L116-6 assume !!(add_history_type_~var~0 < 3); 25650#L117-2 assume !(0 == add_history_type_~history_id); 25651#L123-2 assume 1 == add_history_type_~history_id;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; 25672#L171-4 assume !(0 == read_history_bool_~history_id); 25593#L181-4 assume 1 == read_history_bool_~history_id; 25594#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25518#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25378#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 25379#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 25685#L116-6 assume !(add_history_type_~var~0 < 3); 25682#L116-7 add_history_type_#res := 1; 25589#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 25554#L259 assume !(0 == init_~tmp___0~1);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; 25555#L116-10 assume !!(add_history_type_~var~0 < 3); 25644#L117-4 assume !(0 == add_history_type_~history_id); 25646#L123-4 assume 1 == add_history_type_~history_id;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; 25686#L171-7 assume !(0 == read_history_bool_~history_id); 25616#L181-7 assume 1 == read_history_bool_~history_id; 25617#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25445#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25366#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25344#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 25310#L263 assume !(0 == init_~tmp___1~1);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; 25311#L116-14 assume !!(add_history_type_~var~0 < 3); 25635#L117-6 assume !(0 == add_history_type_~history_id); 25637#L123-6 assume 1 == add_history_type_~history_id;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; 25680#L171-10 assume !(0 == read_history_bool_~history_id); 25604#L181-10 assume 1 == read_history_bool_~history_id; 25605#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25420#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25356#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25338#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 25586#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 25557#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 25381#L550-2 [2018-11-28 13:13:42,059 INFO L796 eck$LassoCheckResult]: Loop: 25381#L550-2 assume !!(main_~i2~0 < 10);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;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; 25552#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 25505#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 25506#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 25550#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 25556#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; 25670#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; 25674#L409 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;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; 25759#L226-2 assume !(0 == write_history_bool_~history_id); 25757#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 25754#L570-17 assume 0 != ~gate2Failed~0 % 256; 25755#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 25787#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; 25786#L440 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;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; 25785#L226-4 assume !(0 == write_history_bool_~history_id); 25784#L231-4 assume !(1 == write_history_bool_~history_id); 25783#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 25781#L570-18 assume 0 != ~gate3Failed~0 % 256; 25657#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 25658#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; 25773#L471 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; 25770#L486 assume ~VALUE1~0 == ~VALUE2~0; 25764#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 25763#L570-19 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; 25762#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 25760#L570-20 ~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;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; 25709#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 25703#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 25675#L171-12 assume 0 == read_history_bool_~history_id; 25653#L172-12 assume !(0 == read_history_bool_~historyIndex); 25632#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 25475#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 25334#L307 assume !(0 == check_~tmp___3~0 % 256); 25335#L307-1 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; 25342#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 25330#L575-54 assume !(0 == assert_~arg % 256); 25331#L570-27 read_history_int8_#res := -2; 25438#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 25439#L346 assume !(check_~tmp___10~0 > -2); 25623#L346-1 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; 25624#L151-9 assume 3 == read_history_int8_~history_id; 25417#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 25411#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 25424#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 25510#L366-1 check_#res := 1; 25486#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25487#L575-72 assume !(0 == assert_~arg % 256); 25380#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 25381#L550-2 [2018-11-28 13:13:42,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:42,059 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 4 times [2018-11-28 13:13:42,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:42,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:42,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:42,105 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-28 13:13:42,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:42,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:42,106 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:42,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash -531336648, now seen corresponding path program 1 times [2018-11-28 13:13:42,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:42,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:42,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:42,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:42,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:13:42,130 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:13:42,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:13:42,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:13:42,130 INFO L87 Difference]: Start difference. First operand 504 states and 747 transitions. cyclomatic complexity: 250 Second operand 3 states. [2018-11-28 13:13:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:42,151 INFO L93 Difference]: Finished difference Result 778 states and 1137 transitions. [2018-11-28 13:13:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:13:42,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 778 states and 1137 transitions. [2018-11-28 13:13:42,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 608 [2018-11-28 13:13:42,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 778 states to 778 states and 1137 transitions. [2018-11-28 13:13:42,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 687 [2018-11-28 13:13:42,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 687 [2018-11-28 13:13:42,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 778 states and 1137 transitions. [2018-11-28 13:13:42,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:42,157 INFO L705 BuchiCegarLoop]: Abstraction has 778 states and 1137 transitions. [2018-11-28 13:13:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states and 1137 transitions. [2018-11-28 13:13:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 468. [2018-11-28 13:13:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-11-28 13:13:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 685 transitions. [2018-11-28 13:13:42,164 INFO L728 BuchiCegarLoop]: Abstraction has 468 states and 685 transitions. [2018-11-28 13:13:42,164 INFO L608 BuchiCegarLoop]: Abstraction has 468 states and 685 transitions. [2018-11-28 13:13:42,164 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 13:13:42,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 468 states and 685 transitions. [2018-11-28 13:13:42,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 13:13:42,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:42,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:42,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:42,166 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-28 13:13:42,167 INFO L794 eck$LassoCheckResult]: Stem: 26850#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 26617#L-1 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;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;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; 26618#L116-2 assume !!(add_history_type_~var~0 < 3); 26916#L117 assume 0 == add_history_type_~history_id;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; 26810#L171 assume 0 == read_history_bool_~history_id; 26811#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 26588#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 26801#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 26802#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 26930#L116-2 assume !(add_history_type_~var~0 < 3); 26928#L116-3 add_history_type_#res := 1; 26824#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 26825#L255 assume !(0 == init_~tmp~1);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; 26911#L116-6 assume !!(add_history_type_~var~0 < 3); 26909#L117-2 assume !(0 == add_history_type_~history_id); 26910#L123-2 assume 1 == add_history_type_~history_id;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; 26929#L171-4 assume !(0 == read_history_bool_~history_id); 26858#L181-4 assume 1 == read_history_bool_~history_id; 26859#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 26791#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 26660#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 26661#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 26941#L116-6 assume !(add_history_type_~var~0 < 3); 26938#L116-7 add_history_type_#res := 1; 26854#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 26819#L259 assume !(0 == init_~tmp___0~1);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; 26820#L116-10 assume !!(add_history_type_~var~0 < 3); 26905#L117-4 assume !(0 == add_history_type_~history_id); 26907#L123-4 assume !(1 == add_history_type_~history_id); 26949#L129-4 assume 2 == add_history_type_~history_id;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; 26939#L171-8 assume !(0 == read_history_bool_~history_id); 26876#L181-8 assume 1 == read_history_bool_~history_id; 26877#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 26710#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 26631#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 26632#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 26599#L263 assume !(0 == init_~tmp___1~1);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; 26600#L116-14 assume !!(add_history_type_~var~0 < 3); 26895#L117-6 assume !(0 == add_history_type_~history_id); 26897#L123-6 assume 1 == add_history_type_~history_id;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; 26936#L171-10 assume !(0 == read_history_bool_~history_id); 26870#L181-10 assume 1 == read_history_bool_~history_id; 26871#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 26695#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 26643#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 26624#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 26851#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 26822#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 26667#L550-2 [2018-11-28 13:13:42,167 INFO L796 eck$LassoCheckResult]: Loop: 26667#L550-2 assume !!(main_~i2~0 < 10);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;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; 26817#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 26784#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 26785#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 26815#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 26821#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; 26927#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; 26901#L409 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;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; 26808#L226-2 assume !(0 == write_history_bool_~history_id); 26809#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 26733#L570-17 assume 0 != ~gate2Failed~0 % 256; 26735#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 27054#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; 27053#L440 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;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; 27052#L226-4 assume !(0 == write_history_bool_~history_id); 27049#L231-4 assume !(1 == write_history_bool_~history_id); 26862#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 26756#L570-18 assume 0 != ~gate3Failed~0 % 256; 27044#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 27043#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; 27041#L471 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; 27040#L486 assume ~VALUE1~0 == ~VALUE2~0; 27033#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 27032#L570-19 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; 27031#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 27029#L570-20 ~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;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; 26962#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 26951#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 26931#L171-12 assume 0 == read_history_bool_~history_id; 26912#L172-12 assume !(0 == read_history_bool_~historyIndex); 26892#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 26752#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 26628#L307 assume !(0 == check_~tmp___3~0 % 256); 26629#L307-1 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; 26636#L151-7 assume 3 == read_history_int8_~history_id; 26713#L152-7 assume !(0 == read_history_int8_~historyIndex); 26714#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 26718#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 26719#L346 assume !(check_~tmp___10~0 > -2); 26883#L346-1 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; 26884#L151-9 assume 3 == read_history_int8_~history_id; 26701#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 26691#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 26704#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 26789#L366-1 check_#res := 1; 26764#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 26765#L575-72 assume !(0 == assert_~arg % 256); 26666#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 26667#L550-2 [2018-11-28 13:13:42,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash 237363222, now seen corresponding path program 1 times [2018-11-28 13:13:42,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:42,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:42,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:42,196 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-28 13:13:42,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:42,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:13:42,197 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:42,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash -625000989, now seen corresponding path program 1 times [2018-11-28 13:13:42,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:42,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:42,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:42,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:42,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:42,738 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 220 [2018-11-28 13:13:44,296 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 187 DAG size of output: 168 [2018-11-28 13:13:44,299 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:44,299 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:44,299 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:44,299 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:44,299 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:13:44,299 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:44,299 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:44,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:44,300 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration16_Loop [2018-11-28 13:13:44,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:44,300 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,483 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-28 13:13:44,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,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-28 13:13:44,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,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-28 13:13:44,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-28 13:13:44,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,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-28 13:13:44,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,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-28 13:13:44,861 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-28 13:13:47,303 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-28 13:13:47,402 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:47,402 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:47,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:47,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:47,425 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:47,425 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:47,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:47,446 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:47,449 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:47,449 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:47,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:47,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:47,467 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:13:47,467 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:47,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:13:47,491 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:13:47,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:13:47,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:13:59,585 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 13:13:59,590 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:59,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:59,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:59,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:59,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:13:59,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:59,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:59,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:59,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration16_Loop [2018-11-28 13:13:59,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:59,591 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:59,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-28 13:13:59,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,737 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-28 13:13:59,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,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-28 13:13:59,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:59,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-28 13:13:59,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-28 13:13:59,988 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-28 13:14:02,459 WARN L180 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-28 13:14:02,563 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:14:02,563 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:14:02,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:02,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:02,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:02,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:02,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:02,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:02,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:02,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:02,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:02,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:02,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:02,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:02,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:02,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:02,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:02,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:02,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:02,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:02,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:02,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:02,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:02,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:02,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:02,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:02,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:02,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:02,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:02,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:02,578 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-28 13:14:02,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:02,594 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 13:14:02,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:02,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:14:02,962 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:14:02,962 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:14:02,962 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:14:02,963 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:14:02,963 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:14:02,963 INFO L520 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-28 13:14:02,963 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:14:03,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:03,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:03,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:14:03,297 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates [2018-11-28 13:14:03,297 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 468 states and 685 transitions. cyclomatic complexity: 224 Second operand 16 states. [2018-11-28 13:14:04,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 468 states and 685 transitions. cyclomatic complexity: 224. Second operand 16 states. Result 3863 states and 5506 transitions. Complement of second has 37 states. [2018-11-28 13:14:04,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-28 13:14:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 13:14:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1570 transitions. [2018-11-28 13:14:04,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1570 transitions. Stem has 48 letters. Loop has 48 letters. [2018-11-28 13:14:04,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:04,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1570 transitions. Stem has 96 letters. Loop has 48 letters. [2018-11-28 13:14:04,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:04,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1570 transitions. Stem has 48 letters. Loop has 96 letters. [2018-11-28 13:14:04,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:04,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3863 states and 5506 transitions. [2018-11-28 13:14:04,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 13:14:04,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3863 states to 2340 states and 3362 transitions. [2018-11-28 13:14:04,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2073 [2018-11-28 13:14:04,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2075 [2018-11-28 13:14:04,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2340 states and 3362 transitions. [2018-11-28 13:14:04,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:04,147 INFO L705 BuchiCegarLoop]: Abstraction has 2340 states and 3362 transitions. [2018-11-28 13:14:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states and 3362 transitions. [2018-11-28 13:14:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 788. [2018-11-28 13:14:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-11-28 13:14:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1143 transitions. [2018-11-28 13:14:04,159 INFO L728 BuchiCegarLoop]: Abstraction has 788 states and 1143 transitions. [2018-11-28 13:14:04,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:14:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:14:04,159 INFO L87 Difference]: Start difference. First operand 788 states and 1143 transitions. Second operand 4 states. [2018-11-28 13:14:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:04,263 INFO L93 Difference]: Finished difference Result 2222 states and 3219 transitions. [2018-11-28 13:14:04,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:14:04,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2222 states and 3219 transitions. [2018-11-28 13:14:04,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1012 [2018-11-28 13:14:04,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2222 states to 2222 states and 3219 transitions. [2018-11-28 13:14:04,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1612 [2018-11-28 13:14:04,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1612 [2018-11-28 13:14:04,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2222 states and 3219 transitions. [2018-11-28 13:14:04,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:04,276 INFO L705 BuchiCegarLoop]: Abstraction has 2222 states and 3219 transitions. [2018-11-28 13:14:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states and 3219 transitions. [2018-11-28 13:14:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 762. [2018-11-28 13:14:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-28 13:14:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1094 transitions. [2018-11-28 13:14:04,291 INFO L728 BuchiCegarLoop]: Abstraction has 762 states and 1094 transitions. [2018-11-28 13:14:04,291 INFO L608 BuchiCegarLoop]: Abstraction has 762 states and 1094 transitions. [2018-11-28 13:14:04,291 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 13:14:04,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 762 states and 1094 transitions. [2018-11-28 13:14:04,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 296 [2018-11-28 13:14:04,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:14:04,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:14:04,294 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:04,294 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-28 13:14:04,294 INFO L794 eck$LassoCheckResult]: Stem: 34678#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 34351#L-1 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;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;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; 34352#L116-2 assume !!(add_history_type_~var~0 < 3); 34759#L117 assume 0 == add_history_type_~history_id;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; 34620#L171 assume 0 == read_history_bool_~history_id; 34621#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 34316#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 34606#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 34607#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 34783#L116-2 assume !(add_history_type_~var~0 < 3); 34781#L116-3 add_history_type_#res := 1; 34639#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 34640#L255 assume !(0 == init_~tmp~1);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; 34747#L116-6 assume !!(add_history_type_~var~0 < 3); 34745#L117-2 assume !(0 == add_history_type_~history_id); 34746#L123-2 assume 1 == add_history_type_~history_id;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; 34782#L171-4 assume !(0 == read_history_bool_~history_id); 34688#L181-4 assume 1 == read_history_bool_~history_id; 34689#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 34597#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 34415#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 34416#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 34795#L116-6 assume !(add_history_type_~var~0 < 3); 34792#L116-7 add_history_type_#res := 1; 34684#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 34633#L259 assume !(0 == init_~tmp___0~1);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; 34634#L116-10 assume !!(add_history_type_~var~0 < 3); 34741#L117-4 assume !(0 == add_history_type_~history_id); 34743#L123-4 assume !(1 == add_history_type_~history_id); 34817#L129-4 assume 2 == add_history_type_~history_id;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; 34793#L171-8 assume !(0 == read_history_bool_~history_id); 34704#L181-8 assume !(1 == read_history_bool_~history_id); 34440#L191-8 assume 2 == read_history_bool_~history_id; 34441#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 34609#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 34372#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 34373#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 34327#L263 assume !(0 == init_~tmp___1~1);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; 34328#L116-14 assume !!(add_history_type_~var~0 < 3); 34728#L117-6 assume !(0 == add_history_type_~history_id); 34730#L123-6 assume 1 == add_history_type_~history_id;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; 34790#L171-10 assume !(0 == read_history_bool_~history_id); 34698#L181-10 assume 1 == read_history_bool_~history_id; 34699#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 34468#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 34387#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 34366#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 34679#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 34636#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 34637#L550-2 assume !!(main_~i2~0 < 10);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;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; 34842#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 35039#L570-16 assume 0 != ~gate1Failed~0 % 256; 34586#L391 [2018-11-28 13:14:04,295 INFO L796 eck$LassoCheckResult]: Loop: 34586#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 34625#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; 34635#L409 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;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; 34616#L226-2 assume !(0 == write_history_bool_~history_id); 34617#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 34521#L570-17 assume 0 != ~gate2Failed~0 % 256; 34523#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 35069#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; 35068#L440 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;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; 35067#L226-4 assume !(0 == write_history_bool_~history_id); 35066#L231-4 assume !(1 == write_history_bool_~history_id); 35063#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 35059#L570-18 assume 0 != ~gate3Failed~0 % 256; 35057#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 35056#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; 34799#L471 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; 34750#L486 assume ~VALUE1~0 == ~VALUE2~0; 34752#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 34391#L570-19 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; 34535#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 34488#L570-20 ~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;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; 34546#L294 assume !(0 == ~gate1Failed~0 % 256); 34828#L297 assume !(0 == ~gate2Failed~0 % 256); 34905#L300 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2 := 1; 34822#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 34785#L171-12 assume 0 == read_history_bool_~history_id; 34748#L172-12 assume !(0 == read_history_bool_~historyIndex); 34723#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 34556#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 34693#L307 assume !(0 == check_~tmp___3~0 % 256); 34878#L307-1 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; 34877#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 34353#L575-54 assume !(0 == assert_~arg % 256); 34354#L570-27 read_history_int8_#res := -2; 34489#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 34490#L346 assume !(check_~tmp___10~0 > -2); 34727#L346-1 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; 34871#L151-9 assume 3 == read_history_int8_~history_id; 34870#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 34450#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 34869#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 34593#L366-1 check_#res := 1; 34560#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 34561#L575-72 assume !(0 == assert_~arg % 256); 34417#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 34418#L550-2 assume !!(main_~i2~0 < 10);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;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; 34626#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 34584#L570-16 assume 0 != ~gate1Failed~0 % 256; 34586#L391 [2018-11-28 13:14:04,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 1 times [2018-11-28 13:14:04,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:04,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:04,342 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-28 13:14:04,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:04,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:14:04,343 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:14:04,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1234325878, now seen corresponding path program 1 times [2018-11-28 13:14:04,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:04,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:04,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:04,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:14:04,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:04,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:14:04,361 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:14:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:14:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:14:04,361 INFO L87 Difference]: Start difference. First operand 762 states and 1094 transitions. cyclomatic complexity: 340 Second operand 3 states. [2018-11-28 13:14:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:04,393 INFO L93 Difference]: Finished difference Result 1265 states and 1817 transitions. [2018-11-28 13:14:04,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:14:04,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1265 states and 1817 transitions. [2018-11-28 13:14:04,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 540 [2018-11-28 13:14:04,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1265 states to 1265 states and 1817 transitions. [2018-11-28 13:14:04,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 894 [2018-11-28 13:14:04,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 894 [2018-11-28 13:14:04,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1265 states and 1817 transitions. [2018-11-28 13:14:04,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:04,404 INFO L705 BuchiCegarLoop]: Abstraction has 1265 states and 1817 transitions. [2018-11-28 13:14:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states and 1817 transitions. [2018-11-28 13:14:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 879. [2018-11-28 13:14:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-28 13:14:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1276 transitions. [2018-11-28 13:14:04,415 INFO L728 BuchiCegarLoop]: Abstraction has 879 states and 1276 transitions. [2018-11-28 13:14:04,416 INFO L608 BuchiCegarLoop]: Abstraction has 879 states and 1276 transitions. [2018-11-28 13:14:04,416 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 13:14:04,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 879 states and 1276 transitions. [2018-11-28 13:14:04,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 355 [2018-11-28 13:14:04,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:14:04,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:14:04,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:04,418 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-28 13:14:04,419 INFO L794 eck$LassoCheckResult]: Stem: 36704#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 36386#L-1 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;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;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; 36387#L116-2 assume !!(add_history_type_~var~0 < 3); 36783#L117 assume 0 == add_history_type_~history_id;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; 36647#L171 assume 0 == read_history_bool_~history_id; 36648#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 36348#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 36633#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 36634#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 36807#L116-2 assume !(add_history_type_~var~0 < 3); 36805#L116-3 add_history_type_#res := 1; 36666#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 36667#L255 assume !(0 == init_~tmp~1);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; 36774#L116-6 assume !!(add_history_type_~var~0 < 3); 36772#L117-2 assume !(0 == add_history_type_~history_id); 36773#L123-2 assume 1 == add_history_type_~history_id;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; 36806#L171-4 assume !(0 == read_history_bool_~history_id); 36715#L181-4 assume 1 == read_history_bool_~history_id; 36716#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 36622#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 36443#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 36444#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 36822#L116-6 assume !(add_history_type_~var~0 < 3); 36819#L116-7 add_history_type_#res := 1; 36710#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 36657#L259 assume !(0 == init_~tmp___0~1);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; 36658#L116-10 assume !!(add_history_type_~var~0 < 3); 36767#L117-4 assume !(0 == add_history_type_~history_id); 36769#L123-4 assume !(1 == add_history_type_~history_id); 36838#L129-4 assume 2 == add_history_type_~history_id;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; 36820#L171-8 assume !(0 == read_history_bool_~history_id); 36730#L181-8 assume !(1 == read_history_bool_~history_id); 36473#L191-8 assume 2 == read_history_bool_~history_id; 36474#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 36636#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 36405#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 36406#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 36362#L263 assume !(0 == init_~tmp___1~1);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; 36363#L116-14 assume !!(add_history_type_~var~0 < 3); 36754#L117-6 assume !(0 == add_history_type_~history_id); 36756#L123-6 assume 1 == add_history_type_~history_id;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; 36817#L171-10 assume !(0 == read_history_bool_~history_id); 36724#L181-10 assume 1 == read_history_bool_~history_id; 36725#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 36488#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 36419#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 36395#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 36705#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 36663#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 36664#L550-2 assume !!(main_~i2~0 < 10);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;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; 36653#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 36609#L570-16 assume 0 != ~gate1Failed~0 % 256; 36611#L391 [2018-11-28 13:14:04,419 INFO L796 eck$LassoCheckResult]: Loop: 36611#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 36652#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; 36665#L409 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;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; 37212#L226-2 assume !(0 == write_history_bool_~history_id); 37210#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 37203#L570-17 assume 0 != ~gate2Failed~0 % 256; 37201#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 37179#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; 37178#L440 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;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; 37177#L226-4 assume !(0 == write_history_bool_~history_id); 37176#L231-4 assume !(1 == write_history_bool_~history_id); 37175#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 37108#L570-18 assume 0 != ~gate3Failed~0 % 256; 37109#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 37189#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; 37188#L471 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; 37187#L486 assume ~VALUE1~0 == ~VALUE2~0; 36844#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 36425#L570-19 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; 36561#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 36519#L570-20 ~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;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; 36572#L294 assume !(0 == ~gate1Failed~0 % 256); 36696#L297 assume !(0 == ~gate2Failed~0 % 256); 36697#L300 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2 := 0; 36841#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 36810#L171-12 assume 0 == read_history_bool_~history_id; 36775#L172-12 assume !(0 == read_history_bool_~historyIndex); 36749#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 36581#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 36399#L307 assume !(0 == check_~tmp___3~0 % 256); 36400#L307-1 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; 36410#L151-7 assume 3 == read_history_int8_~history_id; 36512#L152-7 assume !(0 == read_history_int8_~historyIndex); 36513#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 36520#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 36521#L346 assume !(check_~tmp___10~0 > -2); 36771#L346-1 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; 36912#L151-9 assume 3 == read_history_int8_~history_id; 36911#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 36482#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 36861#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 36620#L366-1 check_#res := 1; 36619#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 37215#L575-72 assume !(0 == assert_~arg % 256); 37214#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 37213#L550-2 assume !!(main_~i2~0 < 10);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;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; 37205#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 37202#L570-16 assume 0 != ~gate1Failed~0 % 256; 36611#L391 [2018-11-28 13:14:04,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 2 times [2018-11-28 13:14:04,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:04,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:04,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:04,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:04,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-28 13:14:04,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:04,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:14:04,458 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:14:04,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1545733139, now seen corresponding path program 1 times [2018-11-28 13:14:04,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:04,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:14:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:14:04,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:04,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:14:04,476 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:14:04,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:14:04,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:14:04,477 INFO L87 Difference]: Start difference. First operand 879 states and 1276 transitions. cyclomatic complexity: 405 Second operand 3 states. [2018-11-28 13:14:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:04,507 INFO L93 Difference]: Finished difference Result 882 states and 1276 transitions. [2018-11-28 13:14:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:14:04,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 882 states and 1276 transitions. [2018-11-28 13:14:04,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 337 [2018-11-28 13:14:04,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 882 states to 857 states and 1236 transitions. [2018-11-28 13:14:04,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 589 [2018-11-28 13:14:04,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 589 [2018-11-28 13:14:04,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 857 states and 1236 transitions. [2018-11-28 13:14:04,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:04,520 INFO L705 BuchiCegarLoop]: Abstraction has 857 states and 1236 transitions. [2018-11-28 13:14:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states and 1236 transitions. [2018-11-28 13:14:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2018-11-28 13:14:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-11-28 13:14:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1236 transitions. [2018-11-28 13:14:04,534 INFO L728 BuchiCegarLoop]: Abstraction has 857 states and 1236 transitions. [2018-11-28 13:14:04,534 INFO L608 BuchiCegarLoop]: Abstraction has 857 states and 1236 transitions. [2018-11-28 13:14:04,535 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 13:14:04,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 857 states and 1236 transitions. [2018-11-28 13:14:04,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 337 [2018-11-28 13:14:04,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:14:04,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:14:04,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:04,538 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-28 13:14:04,538 INFO L794 eck$LassoCheckResult]: Stem: 38468#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 38155#L-1 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;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;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; 38156#L116-2 assume !!(add_history_type_~var~0 < 3); 38549#L117 assume 0 == add_history_type_~history_id;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; 38414#L171 assume 0 == read_history_bool_~history_id; 38415#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 38117#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 38400#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 38401#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 38569#L116-2 assume !(add_history_type_~var~0 < 3); 38567#L116-3 add_history_type_#res := 1; 38432#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 38433#L255 assume !(0 == init_~tmp~1);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; 38539#L116-6 assume !!(add_history_type_~var~0 < 3); 38537#L117-2 assume !(0 == add_history_type_~history_id); 38538#L123-2 assume 1 == add_history_type_~history_id;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; 38568#L171-4 assume !(0 == read_history_bool_~history_id); 38478#L181-4 assume 1 == read_history_bool_~history_id; 38479#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38389#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38213#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 38214#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 38581#L116-6 assume !(add_history_type_~var~0 < 3); 38578#L116-7 add_history_type_#res := 1; 38474#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 38424#L259 assume !(0 == init_~tmp___0~1);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; 38425#L116-10 assume !!(add_history_type_~var~0 < 3); 38532#L117-4 assume !(0 == add_history_type_~history_id); 38534#L123-4 assume !(1 == add_history_type_~history_id); 38595#L129-4 assume 2 == add_history_type_~history_id;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; 38579#L171-8 assume !(0 == read_history_bool_~history_id); 38493#L181-8 assume !(1 == read_history_bool_~history_id); 38243#L191-8 assume 2 == read_history_bool_~history_id; 38244#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 38403#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 38174#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38175#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 38131#L263 assume !(0 == init_~tmp___1~1);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; 38132#L116-14 assume !!(add_history_type_~var~0 < 3); 38516#L117-6 assume !(0 == add_history_type_~history_id); 38518#L123-6 assume 1 == add_history_type_~history_id;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; 38576#L171-10 assume !(0 == read_history_bool_~history_id); 38487#L181-10 assume 1 == read_history_bool_~history_id; 38488#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38258#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38188#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38164#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 38469#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 38429#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 38430#L550-2 assume !!(main_~i2~0 < 10);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;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; 38613#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 38761#L570-16 assume 0 != ~gate1Failed~0 % 256; 38380#L391 [2018-11-28 13:14:04,538 INFO L796 eck$LassoCheckResult]: Loop: 38380#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 38419#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; 38431#L409 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;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; 38410#L226-2 assume !(0 == write_history_bool_~history_id); 38411#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 38317#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 38318#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 38338#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 38215#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 38216#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; 38229#L440 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;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; 38855#L226-4 assume !(0 == write_history_bool_~history_id); 38854#L231-4 assume !(1 == write_history_bool_~history_id); 38853#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 38850#L570-18 assume 0 != ~gate3Failed~0 % 256; 38851#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 38902#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; 38901#L471 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; 38900#L486 assume ~VALUE1~0 == ~VALUE2~0; 38893#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 38892#L570-19 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; 38891#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 38889#L570-20 ~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;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; 38857#L294 assume !(0 == ~gate1Failed~0 % 256); 38668#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 38666#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 38663#L171-12 assume 0 == read_history_bool_~history_id; 38661#L172-12 assume !(0 == read_history_bool_~historyIndex); 38659#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 38656#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 38627#L307 assume !(0 == check_~tmp___3~0 % 256); 38624#L307-1 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; 38623#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 38157#L575-54 assume !(0 == assert_~arg % 256); 38158#L570-27 read_history_int8_#res := -2; 38309#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 38620#L346 assume !(check_~tmp___10~0 > -2); 38536#L346-1 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; 38619#L151-9 assume 3 == read_history_int8_~history_id; 38618#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 38252#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 38617#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 38387#L366-1 check_#res := 1; 38354#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 38355#L575-72 assume !(0 == assert_~arg % 256); 38221#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 38222#L550-2 assume !!(main_~i2~0 < 10);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;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; 38420#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 38378#L570-16 assume 0 != ~gate1Failed~0 % 256; 38380#L391 [2018-11-28 13:14:04,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 3 times [2018-11-28 13:14:04,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:04,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:04,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:04,584 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-28 13:14:04,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:04,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:14:04,584 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:14:04,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1781807208, now seen corresponding path program 1 times [2018-11-28 13:14:04,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:04,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:14:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:14:04,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:04,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:14:04,607 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:14:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:14:04,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:14:04,607 INFO L87 Difference]: Start difference. First operand 857 states and 1236 transitions. cyclomatic complexity: 387 Second operand 3 states. [2018-11-28 13:14:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:04,676 INFO L93 Difference]: Finished difference Result 1395 states and 2012 transitions. [2018-11-28 13:14:04,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:14:04,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1395 states and 2012 transitions. [2018-11-28 13:14:04,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 319 [2018-11-28 13:14:04,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1395 states to 1395 states and 2012 transitions. [2018-11-28 13:14:04,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 960 [2018-11-28 13:14:04,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 960 [2018-11-28 13:14:04,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1395 states and 2012 transitions. [2018-11-28 13:14:04,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:04,690 INFO L705 BuchiCegarLoop]: Abstraction has 1395 states and 2012 transitions. [2018-11-28 13:14:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states and 2012 transitions. [2018-11-28 13:14:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 823. [2018-11-28 13:14:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-11-28 13:14:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1183 transitions. [2018-11-28 13:14:04,701 INFO L728 BuchiCegarLoop]: Abstraction has 823 states and 1183 transitions. [2018-11-28 13:14:04,701 INFO L608 BuchiCegarLoop]: Abstraction has 823 states and 1183 transitions. [2018-11-28 13:14:04,702 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 13:14:04,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 823 states and 1183 transitions. [2018-11-28 13:14:04,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 319 [2018-11-28 13:14:04,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:14:04,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:14:04,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:04,704 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-28 13:14:04,705 INFO L794 eck$LassoCheckResult]: Stem: 40716#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 40413#L-1 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;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;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; 40414#L116-2 assume !!(add_history_type_~var~0 < 3); 40795#L117 assume 0 == add_history_type_~history_id;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; 40657#L171 assume 0 == read_history_bool_~history_id; 40658#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 40377#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 40643#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 40644#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 40818#L116-2 assume !(add_history_type_~var~0 < 3); 40816#L116-3 add_history_type_#res := 1; 40677#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 40678#L255 assume !(0 == init_~tmp~1);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; 40782#L116-6 assume !!(add_history_type_~var~0 < 3); 40780#L117-2 assume !(0 == add_history_type_~history_id); 40781#L123-2 assume 1 == add_history_type_~history_id;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; 40817#L171-4 assume !(0 == read_history_bool_~history_id); 40726#L181-4 assume 1 == read_history_bool_~history_id; 40727#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 40630#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 40459#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 40460#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 40831#L116-6 assume !(add_history_type_~var~0 < 3); 40828#L116-7 add_history_type_#res := 1; 40722#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 40667#L259 assume !(0 == init_~tmp___0~1);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; 40668#L116-10 assume !!(add_history_type_~var~0 < 3); 40775#L117-4 assume !(0 == add_history_type_~history_id); 40777#L123-4 assume !(1 == add_history_type_~history_id); 40848#L129-4 assume 2 == add_history_type_~history_id;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; 40829#L171-8 assume !(0 == read_history_bool_~history_id); 40741#L181-8 assume !(1 == read_history_bool_~history_id); 40484#L191-8 assume 2 == read_history_bool_~history_id; 40485#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 40646#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 40430#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 40431#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 40391#L263 assume !(0 == init_~tmp___1~1);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; 40392#L116-14 assume !!(add_history_type_~var~0 < 3); 40762#L117-6 assume !(0 == add_history_type_~history_id); 40764#L123-6 assume 1 == add_history_type_~history_id;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; 40826#L171-10 assume !(0 == read_history_bool_~history_id); 40735#L181-10 assume 1 == read_history_bool_~history_id; 40736#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 40494#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 40443#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 40420#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 40717#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 40672#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 40673#L550-2 assume !!(main_~i2~0 < 10);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;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; 40874#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 41042#L570-16 assume 0 != ~gate1Failed~0 % 256; 40619#L391 [2018-11-28 13:14:04,705 INFO L796 eck$LassoCheckResult]: Loop: 40619#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 40662#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; 40674#L409 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;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; 40653#L226-2 assume !(0 == write_history_bool_~history_id); 40654#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 41084#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 41085#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 41196#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 40461#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 40462#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; 41012#L440 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;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; 41010#L226-4 assume !(0 == write_history_bool_~history_id); 41008#L231-4 assume !(1 == write_history_bool_~history_id); 41006#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 41003#L570-18 assume 0 != ~gate3Failed~0 % 256; 40791#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 40771#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; 40772#L471 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; 41153#L486 assume ~VALUE1~0 == ~VALUE2~0; 41146#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 40952#L570-19 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; 40949#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 40946#L570-20 ~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;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; 40945#L294 assume !(0 == ~gate1Failed~0 % 256); 40913#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 40912#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 40909#L171-12 assume 0 == read_history_bool_~history_id; 40910#L172-12 assume !(0 == read_history_bool_~historyIndex); 40898#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 40891#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 40883#L307 assume !(0 == check_~tmp___3~0 % 256); 40871#L307-1 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; 40870#L151-7 assume 3 == read_history_int8_~history_id; 40869#L152-7 assume !(0 == read_history_int8_~historyIndex); 40868#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 40794#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 40867#L346 assume !(check_~tmp___10~0 > -2); 40779#L346-1 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; 40866#L151-9 assume 3 == read_history_int8_~history_id; 40865#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 40793#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 40864#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 40628#L366-1 check_#res := 1; 40627#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 41050#L575-72 assume !(0 == assert_~arg % 256); 40465#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 40466#L550-2 assume !!(main_~i2~0 < 10);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;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; 40663#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 40617#L570-16 assume 0 != ~gate1Failed~0 % 256; 40619#L391 [2018-11-28 13:14:04,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 4 times [2018-11-28 13:14:04,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:04,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:04,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:04,762 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-28 13:14:04,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:04,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:14:04,763 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:14:04,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1138800419, now seen corresponding path program 1 times [2018-11-28 13:14:04,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:04,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:04,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:14:04,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:14:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:14:05,350 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 224 [2018-11-28 13:14:06,794 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 191 DAG size of output: 172 [2018-11-28 13:14:06,796 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:14:06,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:14:06,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:14:06,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:14:06,796 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:14:06,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:06,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:14:06,796 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:14:06,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-28 13:14:06,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:14:06,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:14:06,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,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-28 13:14:06,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-28 13:14:06,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-28 13:14:06,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-28 13:14:06,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-28 13:14:06,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-28 13:14:06,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-28 13:14:06,962 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-28 13:14:06,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,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-28 13:14:06,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,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-28 13:14:06,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-28 13:14:06,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-28 13:14:06,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,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-28 13:14:06,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-28 13:14:06,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-28 13:14:06,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:06,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-28 13:14:06,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,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-28 13:14:07,273 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-28 13:14:07,402 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 13:14:09,813 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-28 13:14:09,925 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:14:09,925 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:09,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:09,934 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:09,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:09,949 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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) [2018-11-28 13:14:09,967 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:09,967 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:09,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:09,972 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:09,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:09,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:09,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:09,997 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:10,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:10,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:10,033 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:10,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,052 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:10,055 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:10,055 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:10,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:10,081 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:10,081 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:10,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,098 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-28 13:14:10,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:10,105 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:10,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:10,127 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:10,127 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:10,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,146 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:10,153 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:10,153 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:10,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:10,177 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:10,177 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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) [2018-11-28 13:14:10,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,195 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:10,201 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:10,201 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:10,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:10,225 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:10,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:14:10,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:22,797 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 13:14:22,817 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:14:22,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:14:22,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:14:22,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:14:22,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:14:22,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:22,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:14:22,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:14:22,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-28 13:14:22,817 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:14:22,817 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:14:22,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,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-28 13:14:22,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-28 13:14:22,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:22,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,957 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:22,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,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-28 13:14:22,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-28 13:14:22,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,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-28 13:14:22,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-28 13:14:22,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,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-28 13:14:22,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:22,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-28 13:14:22,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-28 13:14:22,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-28 13:14:23,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,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-28 13:14:23,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,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-28 13:14:23,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:23,286 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-28 13:14:23,416 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 13:14:25,822 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-28 13:14:25,936 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:14:25,936 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:14:25,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:25,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:25,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:25,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:25,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:25,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:25,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:25,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:25,953 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-28 13:14:25,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:25,963 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 13:14:25,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:26,034 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:14:26,125 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:14:26,125 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:14:26,126 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:14:26,126 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:14:26,126 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:14:26,126 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g2v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g2v_old~0 + 1*~nomsg~0 Supporting invariants [] [2018-11-28 13:14:26,126 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:14:26,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:26,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:26,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:14:26,398 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-28 13:14:26,398 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 823 states and 1183 transitions. cyclomatic complexity: 368 Second operand 17 states. [2018-11-28 13:14:27,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 823 states and 1183 transitions. cyclomatic complexity: 368. Second operand 17 states. Result 4447 states and 6229 transitions. Complement of second has 41 states. [2018-11-28 13:14:27,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2018-11-28 13:14:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:14:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1678 transitions. [2018-11-28 13:14:27,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1678 transitions. Stem has 52 letters. Loop has 49 letters. [2018-11-28 13:14:27,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:27,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1678 transitions. Stem has 101 letters. Loop has 49 letters. [2018-11-28 13:14:27,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:27,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 1678 transitions. Stem has 52 letters. Loop has 98 letters. [2018-11-28 13:14:27,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:27,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4447 states and 6229 transitions. [2018-11-28 13:14:27,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 554 [2018-11-28 13:14:27,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4447 states to 2957 states and 4197 transitions. [2018-11-28 13:14:27,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2491 [2018-11-28 13:14:27,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2493 [2018-11-28 13:14:27,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2957 states and 4197 transitions. [2018-11-28 13:14:27,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:27,153 INFO L705 BuchiCegarLoop]: Abstraction has 2957 states and 4197 transitions. [2018-11-28 13:14:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states and 4197 transitions. [2018-11-28 13:14:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1422. [2018-11-28 13:14:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2018-11-28 13:14:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2035 transitions. [2018-11-28 13:14:27,173 INFO L728 BuchiCegarLoop]: Abstraction has 1422 states and 2035 transitions. [2018-11-28 13:14:27,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:14:27,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:14:27,173 INFO L87 Difference]: Start difference. First operand 1422 states and 2035 transitions. Second operand 4 states. [2018-11-28 13:14:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:27,203 INFO L93 Difference]: Finished difference Result 2699 states and 3866 transitions. [2018-11-28 13:14:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:14:27,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2699 states and 3866 transitions. [2018-11-28 13:14:27,213 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1108 [2018-11-28 13:14:27,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2699 states to 2697 states and 3864 transitions. [2018-11-28 13:14:27,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1896 [2018-11-28 13:14:27,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1896 [2018-11-28 13:14:27,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2697 states and 3864 transitions. [2018-11-28 13:14:27,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:27,221 INFO L705 BuchiCegarLoop]: Abstraction has 2697 states and 3864 transitions. [2018-11-28 13:14:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states and 3864 transitions. [2018-11-28 13:14:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1422. [2018-11-28 13:14:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2018-11-28 13:14:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2034 transitions. [2018-11-28 13:14:27,238 INFO L728 BuchiCegarLoop]: Abstraction has 1422 states and 2034 transitions. [2018-11-28 13:14:27,238 INFO L608 BuchiCegarLoop]: Abstraction has 1422 states and 2034 transitions. [2018-11-28 13:14:27,238 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-28 13:14:27,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1422 states and 2034 transitions. [2018-11-28 13:14:27,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 554 [2018-11-28 13:14:27,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:14:27,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:14:27,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:27,242 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-28 13:14:27,243 INFO L794 eck$LassoCheckResult]: Stem: 50512#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 50211#L-1 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;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;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; 50212#L116-2 assume !!(add_history_type_~var~0 < 3); 50598#L117 assume 0 == add_history_type_~history_id;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; 50453#L171 assume 0 == read_history_bool_~history_id; 50454#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 50178#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 50439#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 50440#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 50625#L116-2 assume !(add_history_type_~var~0 < 3); 50623#L116-3 add_history_type_#res := 1; 50476#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 50477#L255 assume !(0 == init_~tmp~1);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; 50585#L116-6 assume !!(add_history_type_~var~0 < 3); 50583#L117-2 assume !(0 == add_history_type_~history_id); 50584#L123-2 assume 1 == add_history_type_~history_id;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; 50624#L171-4 assume !(0 == read_history_bool_~history_id); 50523#L181-4 assume 1 == read_history_bool_~history_id; 50524#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 50428#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 50260#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 50261#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 50639#L116-6 assume !(add_history_type_~var~0 < 3); 50636#L116-7 add_history_type_#res := 1; 50519#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 50469#L259 assume !(0 == init_~tmp___0~1);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; 50470#L116-10 assume !!(add_history_type_~var~0 < 3); 50579#L117-4 assume !(0 == add_history_type_~history_id); 50581#L123-4 assume !(1 == add_history_type_~history_id); 50655#L129-4 assume 2 == add_history_type_~history_id;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; 50637#L171-8 assume !(0 == read_history_bool_~history_id); 50543#L181-8 assume !(1 == read_history_bool_~history_id); 50280#L191-8 assume 2 == read_history_bool_~history_id; 50281#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 50442#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 50228#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 50229#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 50630#L116-10 assume !(add_history_type_~var~0 < 3); 50616#L116-11 add_history_type_#res := 1; 50514#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 50189#L263 assume !(0 == init_~tmp___1~1);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; 50190#L116-14 assume !!(add_history_type_~var~0 < 3); 50565#L117-6 assume !(0 == add_history_type_~history_id); 50567#L123-6 assume 1 == add_history_type_~history_id;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; 50634#L171-10 assume !(0 == read_history_bool_~history_id); 50537#L181-10 assume 1 == read_history_bool_~history_id; 50538#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 50294#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 50239#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 50218#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 50513#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 50473#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 50474#L550-2 assume !!(main_~i2~0 < 10);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;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; 50847#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 51181#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 51180#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 51004#L399 [2018-11-28 13:14:27,243 INFO L796 eck$LassoCheckResult]: Loop: 51004#L399 assume 1 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 51002#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 51001#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; 51000#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; 50996#L409 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;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; 50993#L226-2 assume !(0 == write_history_bool_~history_id); 50987#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 50982#L570-17 assume 0 != ~gate2Failed~0 % 256; 50979#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 50976#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; 50972#L440 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;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; 50968#L226-4 assume !(0 == write_history_bool_~history_id); 50967#L231-4 assume !(1 == write_history_bool_~history_id); 50966#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 50964#L570-18 assume 0 != ~gate3Failed~0 % 256; 50594#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 50574#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; 50575#L471 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; 51325#L486 assume ~VALUE1~0 == ~VALUE2~0; 51307#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 51304#L570-19 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; 51303#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 51301#L570-20 ~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;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; 51138#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 51132#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 51129#L171-12 assume 0 == read_history_bool_~history_id; 51127#L172-12 assume !(0 == read_history_bool_~historyIndex); 51125#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 51123#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 50890#L307 assume !(0 == check_~tmp___3~0 % 256); 50652#L307-1 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; 50885#L151-7 assume 3 == read_history_int8_~history_id; 50884#L152-7 assume !(0 == read_history_int8_~historyIndex); 50881#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 50879#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 50877#L346 assume !(check_~tmp___10~0 > -2); 50600#L346-1 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; 51110#L151-9 assume 3 == read_history_int8_~history_id; 51104#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 51103#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 51102#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 50560#L366-1 check_#res := 1; 50392#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 50393#L575-72 assume !(0 == assert_~arg % 256); 50262#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 50263#L550-2 assume !!(main_~i2~0 < 10);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;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; 50463#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 50418#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 50680#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 51004#L399 [2018-11-28 13:14:27,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash -432897677, now seen corresponding path program 1 times [2018-11-28 13:14:27,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:27,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:27,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:14:27,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:27,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:14:27,284 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:14:27,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash 974165309, now seen corresponding path program 1 times [2018-11-28 13:14:27,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:27,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:27,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:27,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:27,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:14:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:14:27,844 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 226 [2018-11-28 13:14:29,311 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 191 DAG size of output: 172 [2018-11-28 13:14:29,313 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:14:29,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:14:29,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:14:29,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:14:29,313 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:14:29,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:29,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:14:29,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:14:29,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2018-11-28 13:14:29,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:14:29,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,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-28 13:14:29,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,483 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-28 13:14:29,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:29,728 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-28 13:14:29,901 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:14:34,533 WARN L180 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2018-11-28 13:14:34,615 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:14:34,615 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,621 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,621 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,635 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,637 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,637 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,655 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,655 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,672 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,674 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,674 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,694 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,713 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,713 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,731 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,731 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,749 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,749 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,769 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,769 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:34,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,784 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,786 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,803 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,803 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,820 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,837 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,851 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,853 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,854 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,868 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,870 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,893 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,895 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,911 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,913 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,913 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,931 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,932 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,934 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,934 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,953 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,954 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,970 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,972 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:34,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:34,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:34,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:34,988 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,003 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,017 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,017 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:35,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,023 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,023 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,041 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,041 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,058 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,059 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,059 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,076 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,108 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,108 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,113 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,114 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,128 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,130 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,147 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,163 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,163 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,179 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,179 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,197 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,197 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,216 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,216 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,233 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,233 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~next_state~1=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~next_state~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,249 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,249 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___8~0=0} Honda state: {ULTIMATE.start_check_~tmp___8~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,267 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,285 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:14:35,286 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:14:35,301 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/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-28 13:14:35,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:14:35,320 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:14:35,445 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:14:35,446 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:14:35,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:14:35,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:14:35,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:14:35,446 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:14:35,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:35,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:14:35,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:14:35,447 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2018-11-28 13:14:35,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:14:35,447 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:14:35,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-28 13:14:35,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-28 13:14:35,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,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-28 13:14:35,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-28 13:14:35,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,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-28 13:14:35,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-28 13:14:35,667 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-28 13:14:35,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-28 13:14:35,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-28 13:14:35,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-28 13:14:35,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-28 13:14:35,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-28 13:14:35,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,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-28 13:14:35,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-28 13:14:35,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,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-28 13:14:35,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-28 13:14:35,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-28 13:14:35,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-28 13:14:35,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:35,930 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-28 13:14:36,088 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:14:40,780 WARN L180 SmtUtils]: Spent 4.64 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2018-11-28 13:14:40,854 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:14:40,854 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:14:40,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:14:40,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:14:40,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:14:40,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:14:40,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:14:40,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:14:40,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:14:40,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:14:40,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:14:40,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:14:40,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:14:40,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:14:40,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:14:40,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:14:40,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:14:40,907 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:14:40,908 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:14:40,908 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:14:40,908 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:14:40,908 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:14:40,908 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:14:40,909 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 13:14:40,909 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:14:41,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:41,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:41,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:14:41,219 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-28 13:14:41,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1422 states and 2034 transitions. cyclomatic complexity: 622 Second operand 5 states. [2018-11-28 13:14:41,247 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1422 states and 2034 transitions. cyclomatic complexity: 622. Second operand 5 states. Result 3444 states and 4936 transitions. Complement of second has 6 states. [2018-11-28 13:14:41,247 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-28 13:14:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:14:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2018-11-28 13:14:41,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 637 transitions. Stem has 56 letters. Loop has 49 letters. [2018-11-28 13:14:41,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:41,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 637 transitions. Stem has 105 letters. Loop has 49 letters. [2018-11-28 13:14:41,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:41,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 637 transitions. Stem has 56 letters. Loop has 98 letters. [2018-11-28 13:14:41,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:14:41,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3444 states and 4936 transitions. [2018-11-28 13:14:41,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2018-11-28 13:14:41,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3444 states to 1414 states and 2013 transitions. [2018-11-28 13:14:41,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 974 [2018-11-28 13:14:41,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 974 [2018-11-28 13:14:41,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1414 states and 2013 transitions. [2018-11-28 13:14:41,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:41,262 INFO L705 BuchiCegarLoop]: Abstraction has 1414 states and 2013 transitions. [2018-11-28 13:14:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states and 2013 transitions. [2018-11-28 13:14:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2018-11-28 13:14:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2018-11-28 13:14:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2013 transitions. [2018-11-28 13:14:41,273 INFO L728 BuchiCegarLoop]: Abstraction has 1414 states and 2013 transitions. [2018-11-28 13:14:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:14:41,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:14:41,273 INFO L87 Difference]: Start difference. First operand 1414 states and 2013 transitions. Second operand 3 states. [2018-11-28 13:14:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:41,291 INFO L93 Difference]: Finished difference Result 1362 states and 1933 transitions. [2018-11-28 13:14:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:14:41,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1362 states and 1933 transitions. [2018-11-28 13:14:41,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2018-11-28 13:14:41,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1362 states to 1362 states and 1933 transitions. [2018-11-28 13:14:41,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 951 [2018-11-28 13:14:41,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 951 [2018-11-28 13:14:41,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1362 states and 1933 transitions. [2018-11-28 13:14:41,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:14:41,297 INFO L705 BuchiCegarLoop]: Abstraction has 1362 states and 1933 transitions. [2018-11-28 13:14:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states and 1933 transitions. [2018-11-28 13:14:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2018-11-28 13:14:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-11-28 13:14:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1933 transitions. [2018-11-28 13:14:41,310 INFO L728 BuchiCegarLoop]: Abstraction has 1362 states and 1933 transitions. [2018-11-28 13:14:41,310 INFO L608 BuchiCegarLoop]: Abstraction has 1362 states and 1933 transitions. [2018-11-28 13:14:41,310 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-28 13:14:41,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1362 states and 1933 transitions. [2018-11-28 13:14:41,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2018-11-28 13:14:41,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:14:41,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:14:41,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:41,314 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-28 13:14:41,314 INFO L794 eck$LassoCheckResult]: Stem: 58462#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 58185#L-1 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;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;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; 58186#L116-2 assume !!(add_history_type_~var~0 < 3); 58534#L117 assume 0 == add_history_type_~history_id;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; 58401#L171 assume 0 == read_history_bool_~history_id; 58402#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 58158#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 58387#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 58388#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 58558#L116-2 assume !(add_history_type_~var~0 < 3); 58556#L116-3 add_history_type_#res := 1; 58424#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 58425#L255 assume !(0 == init_~tmp~1);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; 58524#L116-6 assume !!(add_history_type_~var~0 < 3); 58522#L117-2 assume !(0 == add_history_type_~history_id); 58523#L123-2 assume 1 == add_history_type_~history_id;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; 58557#L171-4 assume !(0 == read_history_bool_~history_id); 58475#L181-4 assume 1 == read_history_bool_~history_id; 58476#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 58375#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 58225#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 58226#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 58567#L116-6 assume !(add_history_type_~var~0 < 3); 58564#L116-7 add_history_type_#res := 1; 58470#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 58416#L259 assume !(0 == init_~tmp___0~1);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; 58417#L116-10 assume !!(add_history_type_~var~0 < 3); 58518#L117-4 assume !(0 == add_history_type_~history_id); 58520#L123-4 assume !(1 == add_history_type_~history_id); 58589#L129-4 assume 2 == add_history_type_~history_id;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; 58565#L171-8 assume !(0 == read_history_bool_~history_id); 58481#L181-8 assume !(1 == read_history_bool_~history_id); 58239#L191-8 assume 2 == read_history_bool_~history_id; 58240#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 58390#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 58199#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 58200#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 58572#L116-10 assume !(add_history_type_~var~0 < 3); 58551#L116-11 add_history_type_#res := 1; 58465#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 58169#L263 assume !(0 == init_~tmp___1~1);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; 58170#L116-14 assume !!(add_history_type_~var~0 < 3); 58505#L117-6 assume !(0 == add_history_type_~history_id); 58507#L123-6 assume !(1 == add_history_type_~history_id); 58579#L129-6 assume !(2 == add_history_type_~history_id); 58358#L135-9 assume 3 == add_history_type_~history_id;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; 58359#L151-3 assume 3 == read_history_int8_~history_id; 58376#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 58377#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 58382#L137-3 assume !(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0);add_history_type_#res := 0; 58463#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 58464#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 58421#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 58422#L550-2 assume !!(main_~i2~0 < 10);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;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; 58630#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 58633#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 58846#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 58845#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 58843#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; 58844#L408-2 [2018-11-28 13:14:41,314 INFO L796 eck$LassoCheckResult]: Loop: 58844#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; 59176#L409 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;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; 59174#L226-2 assume !(0 == write_history_bool_~history_id); 59170#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 59166#L570-17 assume 0 != ~gate2Failed~0 % 256; 59167#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 59175#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; 59173#L440 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;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; 59172#L226-4 assume !(0 == write_history_bool_~history_id); 59168#L231-4 assume !(1 == write_history_bool_~history_id); 59165#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 59162#L570-18 assume 0 != ~gate3Failed~0 % 256; 59163#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 59361#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; 59360#L471 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; 59359#L486 assume ~VALUE1~0 == ~VALUE2~0; 59341#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 59338#L570-19 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; 59337#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 59335#L570-20 ~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;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; 59115#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 59111#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 59108#L171-12 assume 0 == read_history_bool_~history_id; 59105#L172-12 assume !(0 == read_history_bool_~historyIndex); 59103#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 59098#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 59093#L307 assume !(0 == check_~tmp___3~0 % 256); 58385#L307-1 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; 59087#L151-7 assume 3 == read_history_int8_~history_id; 58270#L152-7 assume !(0 == read_history_int8_~historyIndex); 58271#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 58276#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 58277#L346 assume !(check_~tmp___10~0 > -2); 58504#L346-1 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; 59431#L151-9 assume 3 == read_history_int8_~history_id; 59430#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 58261#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 58262#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 58371#L366-1 check_#res := 1; 58348#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 58349#L575-72 assume !(0 == assert_~arg % 256); 58227#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 58228#L550-2 assume !!(main_~i2~0 < 10);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;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; 58637#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 58613#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 58614#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 59178#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 59177#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; 58844#L408-2 [2018-11-28 13:14:41,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1595648815, now seen corresponding path program 1 times [2018-11-28 13:14:41,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:41,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:41,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:41,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:14:41,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:41,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:14:41,431 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:14:41,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:41,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1676599907, now seen corresponding path program 2 times [2018-11-28 13:14:41,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:41,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:41,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:41,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:41,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:14:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:14:42,067 WARN L180 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 222 [2018-11-28 13:14:44,684 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 191 DAG size of output: 180 [2018-11-28 13:14:44,686 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:14:44,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:14:44,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:14:44,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:14:44,686 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:14:44,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:14:44,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:14:44,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:14:44,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration22_Loop [2018-11-28 13:14:44,687 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:14:44,687 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:14:44,688 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,909 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2018-11-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,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-28 13:14:44,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,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-28 13:14:44,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-28 13:14:44,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,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-28 13:14:44,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,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-28 13:14:44,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2018-11-28 13:17:05,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-28 13:17:05,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:05,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:05,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-28 13:17:06,159 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-28 13:17:06,176 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:17:09,562 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 186 DAG size of output: 134 [2018-11-28 13:17:09,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:09,582 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 225 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 225 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,592 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,594 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,594 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_29=-1} Honda state: {v_rep#funAddr~voter.base_29=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 226 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 226 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,616 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,616 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Honda state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 227 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 227 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,631 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,632 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,632 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 228 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 228 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,650 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,650 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 229 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 229 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,666 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,666 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 230 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 230 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,696 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,697 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 231 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 231 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,712 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,717 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,717 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 232 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 232 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,732 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,733 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,733 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 233 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 233 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,748 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,754 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,754 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 234 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 234 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_29=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_29=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 235 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 235 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,789 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,791 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,791 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 236 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 236 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,816 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,816 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret58=0} Honda state: {ULTIMATE.start_main_#t~ret58=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 237 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 237 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,836 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~history_id=3, ULTIMATE.start_read_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_~history_id=3, 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 238 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 238 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,863 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,863 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret10=0} Honda state: {ULTIMATE.start_check_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 239 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 239 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,879 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,881 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 240 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 240 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,900 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 241 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 241 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,918 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0=0} Honda state: {ULTIMATE.start_check_~temp_count~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 242 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 242 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,936 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,937 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,937 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 243 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 243 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,963 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,963 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___9~0=0} Honda state: {ULTIMATE.start_check_~tmp___9~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 244 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 244 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:09,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:09,980 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:09,982 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:09,982 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post15=0} Honda state: {ULTIMATE.start_check_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 245 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 245 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,008 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,008 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 246 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 246 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,035 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 247 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 247 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,052 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,054 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,054 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___12~0=0} Honda state: {ULTIMATE.start_check_~tmp___12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 248 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 248 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,096 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,096 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed~0=128, ~gate1Failed_History_0~0=128, ULTIMATE.start_check_~tmp___3~0=128, ULTIMATE.start_read_history_bool_#res=128, ~gate1Failed_History_1~0=128, ~gate1Failed_History_2~0=128} Honda state: {~gate1Failed~0=128, ~gate1Failed_History_0~0=128, ULTIMATE.start_check_~tmp___3~0=128, ULTIMATE.start_read_history_bool_#res=128, ~gate1Failed_History_1~0=128, ~gate1Failed_History_2~0=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 249 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 249 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,119 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,119 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,121 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,121 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 250 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 250 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,145 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 251 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 251 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,169 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 252 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 252 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,185 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,185 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 253 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 253 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:10,205 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___6~0=0} Honda state: {ULTIMATE.start_check_~tmp___6~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 254 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 254 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:10,221 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 255 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 255 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:17:10,237 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:10,364 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:17:10,365 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:10,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:10,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:10,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:10,365 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:17:10,365 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:10,365 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:10,365 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:10,365 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration33_Loop [2018-11-28 13:17:10,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:10,366 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:10,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,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-28 13:17:10,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-28 13:17:10,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,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-28 13:17:10,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,570 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,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-28 13:17:10,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:10,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:10,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-28 13:17:10,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-28 13:17:10,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-28 13:17:11,017 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-28 13:17:11,034 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:17:14,428 WARN L180 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 186 DAG size of output: 134 [2018-11-28 13:17:14,451 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:14,451 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:17:14,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,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-28 13:17:14,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:14,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:14,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:14,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:14,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:14,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:14,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:14,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:14,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:14,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:14,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:14,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:14,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:14,476 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:17:14,477 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:17:14,477 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:17:14,477 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:17:14,477 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:17:14,477 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:17:14,477 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 13:17:14,477 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:17:14,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:14,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:14,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:14,612 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-28 13:17:14,612 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1535 states and 1890 transitions. cyclomatic complexity: 363 Second operand 5 states. [2018-11-28 13:17:14,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1535 states and 1890 transitions. cyclomatic complexity: 363. Second operand 5 states. Result 3323 states and 4088 transitions. Complement of second has 6 states. [2018-11-28 13:17:14,660 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-28 13:17:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:17:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2018-11-28 13:17:14,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 405 transitions. Stem has 170 letters. Loop has 57 letters. [2018-11-28 13:17:14,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:14,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 405 transitions. Stem has 227 letters. Loop has 57 letters. [2018-11-28 13:17:14,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:14,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 405 transitions. Stem has 170 letters. Loop has 114 letters. [2018-11-28 13:17:14,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:14,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3323 states and 4088 transitions. [2018-11-28 13:17:14,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 414 [2018-11-28 13:17:14,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3323 states to 1477 states and 1822 transitions. [2018-11-28 13:17:14,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 907 [2018-11-28 13:17:14,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 907 [2018-11-28 13:17:14,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1477 states and 1822 transitions. [2018-11-28 13:17:14,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:17:14,669 INFO L705 BuchiCegarLoop]: Abstraction has 1477 states and 1822 transitions. [2018-11-28 13:17:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states and 1822 transitions. [2018-11-28 13:17:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1477. [2018-11-28 13:17:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2018-11-28 13:17:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1822 transitions. [2018-11-28 13:17:14,675 INFO L728 BuchiCegarLoop]: Abstraction has 1477 states and 1822 transitions. [2018-11-28 13:17:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:17:14,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:17:14,675 INFO L87 Difference]: Start difference. First operand 1477 states and 1822 transitions. Second operand 12 states. [2018-11-28 13:17:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:14,844 INFO L93 Difference]: Finished difference Result 2254 states and 2761 transitions. [2018-11-28 13:17:14,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:17:14,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2254 states and 2761 transitions. [2018-11-28 13:17:14,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 416 [2018-11-28 13:17:14,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2254 states to 2254 states and 2761 transitions. [2018-11-28 13:17:14,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1388 [2018-11-28 13:17:14,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1388 [2018-11-28 13:17:14,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2254 states and 2761 transitions. [2018-11-28 13:17:14,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:17:14,850 INFO L705 BuchiCegarLoop]: Abstraction has 2254 states and 2761 transitions. [2018-11-28 13:17:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states and 2761 transitions. [2018-11-28 13:17:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1477. [2018-11-28 13:17:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2018-11-28 13:17:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1822 transitions. [2018-11-28 13:17:14,858 INFO L728 BuchiCegarLoop]: Abstraction has 1477 states and 1822 transitions. [2018-11-28 13:17:14,858 INFO L608 BuchiCegarLoop]: Abstraction has 1477 states and 1822 transitions. [2018-11-28 13:17:14,858 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-11-28 13:17:14,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1477 states and 1822 transitions. [2018-11-28 13:17:14,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 414 [2018-11-28 13:17:14,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:14,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:14,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:14,860 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-28 13:17:14,860 INFO L794 eck$LassoCheckResult]: Stem: 154426#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 154115#L-1 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;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;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; 154116#L116-2 assume !!(add_history_type_~var~0 < 3); 154174#L117 assume 0 == add_history_type_~history_id;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; 154175#L171 assume 0 == read_history_bool_~history_id; 154352#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 154540#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 154323#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 154324#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154284#L116-2 assume !!(add_history_type_~var~0 < 3); 154285#L117 assume 0 == add_history_type_~history_id;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; 154545#L171 assume 0 == read_history_bool_~history_id; 154179#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 154078#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 154487#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 154333#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154334#L116-2 assume !!(add_history_type_~var~0 < 3); 154525#L117 assume 0 == add_history_type_~history_id;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; 154538#L171 assume 0 == read_history_bool_~history_id; 154535#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 154531#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 154530#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 154529#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154524#L116-2 assume !(add_history_type_~var~0 < 3); 154278#L116-3 add_history_type_#res := 1; 154279#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 154117#L255 assume !(0 == init_~tmp~1);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; 154118#L116-6 assume !!(add_history_type_~var~0 < 3); 154109#L117-2 assume !(0 == add_history_type_~history_id); 154110#L123-2 assume 1 == add_history_type_~history_id;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; 154282#L171-4 assume !(0 == read_history_bool_~history_id); 154283#L181-4 assume 1 == read_history_bool_~history_id; 154527#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 154451#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 154452#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 154523#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154331#L116-6 assume !!(add_history_type_~var~0 < 3); 154332#L117-2 assume !(0 == add_history_type_~history_id); 154490#L123-2 assume 1 == add_history_type_~history_id;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; 154491#L171-4 assume !(0 == read_history_bool_~history_id); 154447#L181-4 assume 1 == read_history_bool_~history_id; 154286#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 154287#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 154157#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 154158#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154358#L116-6 assume !!(add_history_type_~var~0 < 3); 154494#L117-2 assume !(0 == add_history_type_~history_id); 154519#L123-2 assume 1 == add_history_type_~history_id;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; 154516#L171-4 assume !(0 == read_history_bool_~history_id); 154512#L181-4 assume 1 == read_history_bool_~history_id; 154507#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 154502#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 154499#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 154497#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154493#L116-6 assume !(add_history_type_~var~0 < 3); 154325#L116-7 add_history_type_#res := 1; 154326#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 154365#L259 assume !(0 == init_~tmp___0~1);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; 154366#L116-10 assume !!(add_history_type_~var~0 < 3); 154095#L117-4 assume !(0 == add_history_type_~history_id); 154096#L123-4 assume !(1 == add_history_type_~history_id); 154522#L129-4 assume 2 == add_history_type_~history_id;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; 154329#L171-8 assume !(0 == read_history_bool_~history_id); 154330#L181-8 assume !(1 == read_history_bool_~history_id); 154518#L191-8 assume 2 == read_history_bool_~history_id; 154514#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 154510#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 154504#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 154501#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154314#L116-10 assume !!(add_history_type_~var~0 < 3); 154097#L117-4 assume !(0 == add_history_type_~history_id); 154098#L123-4 assume !(1 == add_history_type_~history_id); 154400#L129-4 assume 2 == add_history_type_~history_id;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; 154401#L171-8 assume !(0 == read_history_bool_~history_id); 154466#L181-8 assume !(1 == read_history_bool_~history_id); 154182#L191-8 assume 2 == read_history_bool_~history_id; 154183#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 154383#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 154135#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 154136#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154348#L116-10 assume !!(add_history_type_~var~0 < 3); 154496#L117-4 assume !(0 == add_history_type_~history_id); 154488#L123-4 assume !(1 == add_history_type_~history_id); 154399#L129-4 assume 2 == add_history_type_~history_id;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; 154327#L171-8 assume !(0 == read_history_bool_~history_id); 154328#L181-8 assume !(1 == read_history_bool_~history_id); 154180#L191-8 assume 2 == read_history_bool_~history_id; 154181#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 154381#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 154133#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 154134#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154313#L116-10 assume !(add_history_type_~var~0 < 3); 154224#L116-11 add_history_type_#res := 1; 154225#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 154103#L263 assume !(0 == init_~tmp___1~1);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; 154104#L116-14 assume !!(add_history_type_~var~0 < 3); 154079#L117-6 assume !(0 == add_history_type_~history_id); 154080#L123-6 assume !(1 == add_history_type_~history_id); 154385#L129-6 assume !(2 == add_history_type_~history_id); 154291#L135-9 assume 3 == add_history_type_~history_id;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; 154292#L151-3 assume 3 == read_history_int8_~history_id; 154317#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154318#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 154320#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 154281#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154199#L116-14 assume !!(add_history_type_~var~0 < 3); 154081#L117-6 assume !(0 == add_history_type_~history_id); 154082#L123-6 assume !(1 == add_history_type_~history_id); 154521#L129-6 assume !(2 == add_history_type_~history_id); 154520#L135-9 assume 3 == add_history_type_~history_id;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; 154517#L151-3 assume 3 == read_history_int8_~history_id; 154513#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154509#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 154503#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 154500#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154498#L116-14 assume !!(add_history_type_~var~0 < 3); 154495#L117-6 assume !(0 == add_history_type_~history_id); 154486#L123-6 assume !(1 == add_history_type_~history_id); 154384#L129-6 assume !(2 == add_history_type_~history_id); 154289#L135-9 assume 3 == add_history_type_~history_id;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; 154290#L151-3 assume 3 == read_history_int8_~history_id; 154315#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154316#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 154319#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 154280#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 154198#L116-14 assume !(add_history_type_~var~0 < 3); 154196#L116-15 add_history_type_#res := 1; 154197#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 154427#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 154369#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 154370#L550-2 assume !!(main_~i2~0 < 10);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;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; 154609#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 154931#L570-16 assume 0 != ~gate1Failed~0 % 256; 154610#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 154371#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; 154372#L409 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;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; 155189#L226-2 assume !(0 == write_history_bool_~history_id); 155190#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 154238#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 154239#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 154271#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 154272#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 154167#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; 154168#L440 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;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; 154293#L226-4 assume !(0 == write_history_bool_~history_id); 154294#L231-4 assume !(1 == write_history_bool_~history_id); 154454#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 154455#L570-18 assume 0 != ~gate3Failed~0 % 256; 154150#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 154151#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; 155410#L471 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; 155409#L486 assume ~VALUE1~0 == ~VALUE2~0; 154897#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 155408#L570-19 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; 155407#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 155405#L570-20 ~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;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; 155403#L294 assume !(0 == ~gate1Failed~0 % 256); 155391#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 155390#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 155388#L171-12 assume 0 == read_history_bool_~history_id; 155389#L172-12 assume !(0 == read_history_bool_~historyIndex); 155384#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 155377#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 155264#L307 assume !(0 == check_~tmp___3~0 % 256); 154137#L307-1 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; 154138#L151-7 assume 3 == read_history_int8_~history_id; 154200#L152-7 assume !(0 == read_history_int8_~historyIndex); 154170#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 154171#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 154202#L346 assume !(check_~tmp___10~0 > -2); 155097#L346-1 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; 155095#L151-9 assume 3 == read_history_int8_~history_id; 155093#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 155092#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 154377#L366 assume check_~tmp___11~0 != ~nomsg~0;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; 154378#L151-10 [2018-11-28 13:17:14,958 INFO L796 eck$LassoCheckResult]: Loop: 154378#L151-10 assume 3 == read_history_int8_~history_id; 154263#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154264#L163-10 check_#t~ret24 := read_history_int8_#res;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 154992#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 154386#L366-1 check_#res := 1; 154265#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 154266#L575-72 assume !(0 == assert_~arg % 256); 154770#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 154619#L550-2 assume !!(main_~i2~0 < 10);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;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; 154620#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 154300#L570-16 assume 0 != ~gate1Failed~0 % 256; 154302#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 154904#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; 154899#L409 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;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; 154895#L226-2 assume !(0 == write_history_bool_~history_id); 154889#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 154887#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 154885#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 154881#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 154878#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 154875#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; 154873#L440 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;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; 154870#L226-4 assume !(0 == write_history_bool_~history_id); 154867#L231-4 assume !(1 == write_history_bool_~history_id); 154857#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 154851#L570-18 assume 0 != ~gate3Failed~0 % 256; 154852#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 154882#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; 154879#L471 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; 154876#L486 assume ~VALUE1~0 == ~VALUE2~0; 154877#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 154973#L570-19 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; 154968#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 154967#L570-20 ~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;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; 154965#L294 assume !(0 == ~gate1Failed~0 % 256); 154966#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 155045#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 155044#L171-12 assume 0 == read_history_bool_~history_id; 155043#L172-12 assume !(0 == read_history_bool_~historyIndex); 155042#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 154736#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 154737#L307 assume !(0 == check_~tmp___3~0 % 256); 154994#L307-1 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; 154639#L151-7 assume 3 == read_history_int8_~history_id; 154640#L152-7 assume !(0 == read_history_int8_~historyIndex); 154635#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 154636#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 154631#L346 assume !(check_~tmp___10~0 > -2); 154632#L346-1 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; 154627#L151-9 assume 3 == read_history_int8_~history_id; 154628#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 154623#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 154624#L366 assume check_~tmp___11~0 != ~nomsg~0;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; 154378#L151-10 [2018-11-28 13:17:15,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:15,426 INFO L82 PathProgramCache]: Analyzing trace with hash 493734230, now seen corresponding path program 1 times [2018-11-28 13:17:15,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:15,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:15,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:15,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-28 13:17:15,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:15,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:17:15,510 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:17:15,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 777847101, now seen corresponding path program 1 times [2018-11-28 13:17:15,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:15,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:15,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:16,265 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 239 [2018-11-28 13:17:17,693 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 190 DAG size of output: 171 [2018-11-28 13:17:17,695 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:17,695 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:17,695 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:17,695 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:17,695 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:17:17,695 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:17,695 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:17,695 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:17,695 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration34_Loop [2018-11-28 13:17:17,695 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:17,695 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:17,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,838 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2018-11-28 13:17:17,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-28 13:17:17,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-28 13:17:17,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,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-28 13:17:17,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-28 13:17:17,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,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-28 13:17:17,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,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-28 13:17:17,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:17,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-28 13:17:18,180 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-28 13:17:18,284 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:17:22,743 WARN L180 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 189 DAG size of output: 141 [2018-11-28 13:17:22,822 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:22,822 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 256 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 13:17:22,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:22,832 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 256 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:22,834 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:22,834 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 257 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 257 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:22,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:22,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:22,866 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:22,866 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed~0=0, ~gate2Failed_History_1~0=0, ~gate2Failed_History_0~0=0, ~gate2Failed_History_2~0=0} Honda state: {~gate2Failed~0=0, ~gate2Failed_History_1~0=0, ~gate2Failed_History_0~0=0, ~gate2Failed_History_2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 258 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 258 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:22,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:22,881 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:22,883 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:22,883 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 259 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 259 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:22,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:22,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:22,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:22,900 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 260 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 260 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:22,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:22,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:22,936 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:22,936 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed~0=-128, ~gate1Failed_History_0~0=-128, ULTIMATE.start_check_~tmp___3~0=-128, ULTIMATE.start_read_history_bool_#res=-128, ~gate1Failed_History_1~0=-128, ~gate1Failed_History_2~0=-128} Honda state: {~gate1Failed~0=-128, ~gate1Failed_History_0~0=-128, ULTIMATE.start_check_~tmp___3~0=-128, ULTIMATE.start_read_history_bool_#res=-128, ~gate1Failed_History_1~0=-128, ~gate1Failed_History_2~0=-128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 261 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 261 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:22,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:22,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:22,953 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:22,953 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 262 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 262 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:22,968 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:22,968 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:22,970 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:22,970 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 263 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 263 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:22,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:22,985 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:22,987 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:22,987 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 264 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 264 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:23,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:23,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:23,011 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:23,011 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 265 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 265 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:23,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:23,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:23,027 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:23,027 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 266 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 266 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:23,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:23,042 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 267 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 267 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:23,548 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:17:23,548 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:35,867 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 13:17:35,891 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:35,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:35,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:35,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:35,892 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:17:35,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:35,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:35,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:35,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration34_Loop [2018-11-28 13:17:35,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:35,892 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:35,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-28 13:17:36,120 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2018-11-28 13:17:36,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:36,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:36,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-28 13:17:36,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:36,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:36,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:36,477 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-28 13:17:36,490 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:17:41,088 WARN L180 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 189 DAG size of output: 141 [2018-11-28 13:17:41,103 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:41,104 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:17:41,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:41,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:41,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:41,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:41,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:41,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:41,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:41,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:41,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:41,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:41,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:41,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:41,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:41,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:41,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:41,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:41,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:41,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:41,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:41,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:41,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:41,139 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:17:41,139 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:17:41,139 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:17:41,139 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:17:41,139 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:17:41,139 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:17:41,139 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 13:17:41,139 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:17:41,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:41,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:41,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:41,272 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-28 13:17:41,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1477 states and 1822 transitions. cyclomatic complexity: 353 Second operand 5 states. [2018-11-28 13:17:41,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1477 states and 1822 transitions. cyclomatic complexity: 353. Second operand 5 states. Result 3173 states and 3912 transitions. Complement of second has 6 states. [2018-11-28 13:17:41,288 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-28 13:17:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:17:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2018-11-28 13:17:41,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 357 transitions. Stem has 175 letters. Loop has 53 letters. [2018-11-28 13:17:41,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:41,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 357 transitions. Stem has 228 letters. Loop has 53 letters. [2018-11-28 13:17:41,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:41,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 357 transitions. Stem has 175 letters. Loop has 106 letters. [2018-11-28 13:17:41,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:41,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3173 states and 3912 transitions. [2018-11-28 13:17:41,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 390 [2018-11-28 13:17:41,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3173 states to 1128 states and 1389 transitions. [2018-11-28 13:17:41,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 558 [2018-11-28 13:17:41,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2018-11-28 13:17:41,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 1389 transitions. [2018-11-28 13:17:41,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:17:41,297 INFO L705 BuchiCegarLoop]: Abstraction has 1128 states and 1389 transitions. [2018-11-28 13:17:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 1389 transitions. [2018-11-28 13:17:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2018-11-28 13:17:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-11-28 13:17:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1389 transitions. [2018-11-28 13:17:41,301 INFO L728 BuchiCegarLoop]: Abstraction has 1128 states and 1389 transitions. [2018-11-28 13:17:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:17:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:17:41,301 INFO L87 Difference]: Start difference. First operand 1128 states and 1389 transitions. Second operand 9 states. [2018-11-28 13:17:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:41,625 INFO L93 Difference]: Finished difference Result 1769 states and 2160 transitions. [2018-11-28 13:17:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:17:41,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1769 states and 2160 transitions. [2018-11-28 13:17:41,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 390 [2018-11-28 13:17:41,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1769 states to 1769 states and 2160 transitions. [2018-11-28 13:17:41,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 763 [2018-11-28 13:17:41,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 763 [2018-11-28 13:17:41,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1769 states and 2160 transitions. [2018-11-28 13:17:41,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:17:41,631 INFO L705 BuchiCegarLoop]: Abstraction has 1769 states and 2160 transitions. [2018-11-28 13:17:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states and 2160 transitions. [2018-11-28 13:17:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1128. [2018-11-28 13:17:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-11-28 13:17:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1389 transitions. [2018-11-28 13:17:41,639 INFO L728 BuchiCegarLoop]: Abstraction has 1128 states and 1389 transitions. [2018-11-28 13:17:41,639 INFO L608 BuchiCegarLoop]: Abstraction has 1128 states and 1389 transitions. [2018-11-28 13:17:41,639 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-11-28 13:17:41,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1128 states and 1389 transitions. [2018-11-28 13:17:41,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 390 [2018-11-28 13:17:41,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:41,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:41,642 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-28 13:17:41,642 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-28 13:17:41,643 INFO L794 eck$LassoCheckResult]: Stem: 162683#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 162399#L-1 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;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;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; 162400#L116-2 assume !!(add_history_type_~var~0 < 3); 162555#L117 assume 0 == add_history_type_~history_id;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; 162785#L171 assume 0 == read_history_bool_~history_id; 162783#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 162781#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 162780#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 162604#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162556#L116-2 assume !!(add_history_type_~var~0 < 3); 162456#L117 assume 0 == add_history_type_~history_id;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; 162457#L171 assume 0 == read_history_bool_~history_id; 162458#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 162362#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 162594#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 162595#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162779#L116-2 assume !!(add_history_type_~var~0 < 3); 162763#L117 assume 0 == add_history_type_~history_id;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; 162777#L171 assume 0 == read_history_bool_~history_id; 162774#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 162727#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 162728#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 162769#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162762#L116-2 assume !(add_history_type_~var~0 < 3); 162548#L116-3 add_history_type_#res := 1; 162549#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 162401#L255 assume !(0 == init_~tmp~1);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; 162402#L116-6 assume !!(add_history_type_~var~0 < 3); 162602#L117-2 assume !(0 == add_history_type_~history_id); 162730#L123-2 assume 1 == add_history_type_~history_id;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; 162731#L171-4 assume !(0 == read_history_bool_~history_id); 162698#L181-4 assume 1 == read_history_bool_~history_id; 162699#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 162702#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 162439#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 162440#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162603#L116-6 assume !!(add_history_type_~var~0 < 3); 162393#L117-2 assume !(0 == add_history_type_~history_id); 162394#L123-2 assume 1 == add_history_type_~history_id;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; 162553#L171-4 assume !(0 == read_history_bool_~history_id); 162554#L181-4 assume 1 == read_history_bool_~history_id; 162557#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 162558#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 162768#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 162767#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162766#L116-6 assume !!(add_history_type_~var~0 < 3); 162735#L117-2 assume !(0 == add_history_type_~history_id); 162760#L123-2 assume 1 == add_history_type_~history_id;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; 162757#L171-4 assume !(0 == read_history_bool_~history_id); 162753#L181-4 assume 1 == read_history_bool_~history_id; 162748#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 162743#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 162740#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 162738#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162734#L116-6 assume !(add_history_type_~var~0 < 3); 162596#L116-7 add_history_type_#res := 1; 162597#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 162625#L259 assume !(0 == init_~tmp___0~1);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; 162626#L116-10 assume !!(add_history_type_~var~0 < 3); 162379#L117-4 assume !(0 == add_history_type_~history_id); 162380#L123-4 assume !(1 == add_history_type_~history_id); 162765#L129-4 assume 2 == add_history_type_~history_id;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; 162764#L171-8 assume !(0 == read_history_bool_~history_id); 162713#L181-8 assume !(1 == read_history_bool_~history_id); 162461#L191-8 assume 2 == read_history_bool_~history_id; 162462#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 162646#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 162419#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 162420#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162585#L116-10 assume !!(add_history_type_~var~0 < 3); 162381#L117-4 assume !(0 == add_history_type_~history_id); 162382#L123-4 assume !(1 == add_history_type_~history_id); 162668#L129-4 assume 2 == add_history_type_~history_id;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; 162600#L171-8 assume !(0 == read_history_bool_~history_id); 162601#L181-8 assume !(1 == read_history_bool_~history_id); 162759#L191-8 assume 2 == read_history_bool_~history_id; 162755#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 162751#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 162745#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 162742#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162739#L116-10 assume !!(add_history_type_~var~0 < 3); 162737#L117-4 assume !(0 == add_history_type_~history_id); 162729#L123-4 assume !(1 == add_history_type_~history_id); 162667#L129-4 assume 2 == add_history_type_~history_id;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; 162598#L171-8 assume !(0 == read_history_bool_~history_id); 162599#L181-8 assume !(1 == read_history_bool_~history_id); 162459#L191-8 assume 2 == read_history_bool_~history_id; 162460#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 162644#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 162417#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 162418#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162584#L116-10 assume !(add_history_type_~var~0 < 3); 162506#L116-11 add_history_type_#res := 1; 162507#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 162387#L263 assume !(0 == init_~tmp___1~1);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; 162388#L116-14 assume !!(add_history_type_~var~0 < 3); 162363#L117-6 assume !(0 == add_history_type_~history_id); 162364#L123-6 assume !(1 == add_history_type_~history_id); 162725#L129-6 assume !(2 == add_history_type_~history_id); 162761#L135-9 assume 3 == add_history_type_~history_id;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; 162758#L151-3 assume 3 == read_history_int8_~history_id; 162754#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162750#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 162744#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 162741#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162479#L116-14 assume !!(add_history_type_~var~0 < 3); 162365#L117-6 assume !(0 == add_history_type_~history_id); 162366#L123-6 assume !(1 == add_history_type_~history_id); 162648#L129-6 assume !(2 == add_history_type_~history_id); 162564#L135-9 assume 3 == add_history_type_~history_id;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; 162565#L151-3 assume 3 == read_history_int8_~history_id; 162588#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162589#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 162591#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 162551#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162552#L116-14 assume !!(add_history_type_~var~0 < 3); 162736#L117-6 assume !(0 == add_history_type_~history_id); 162724#L123-6 assume !(1 == add_history_type_~history_id); 162647#L129-6 assume !(2 == add_history_type_~history_id); 162562#L135-9 assume 3 == add_history_type_~history_id;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; 162563#L151-3 assume 3 == read_history_int8_~history_id; 162586#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162587#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 162590#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 162550#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 162478#L116-14 assume !(add_history_type_~var~0 < 3); 162476#L116-15 add_history_type_#res := 1; 162477#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 162684#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 162629#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 162630#L550-2 assume !!(main_~i2~0 < 10);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;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; 162621#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 162573#L570-16 assume 0 != ~gate1Failed~0 % 256; 162574#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 162618#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; 163462#L409 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;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; 163461#L226-2 assume !(0 == write_history_bool_~history_id); 163459#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 163458#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 163457#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 163456#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 163455#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 162450#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; 162451#L440 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;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; 162568#L226-4 assume !(0 == write_history_bool_~history_id); 162569#L231-4 assume !(1 == write_history_bool_~history_id); 162693#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 162525#L570-18 assume 0 != ~gate3Failed~0 % 256; 162527#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 163485#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; 163484#L471 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; 162429#L486 assume ~VALUE1~0 == ~VALUE2~0; 162430#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 162530#L570-19 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; 162531#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 162536#L570-20 ~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;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; 162537#L294 assume !(0 == ~gate1Failed~0 % 256); 162678#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 162679#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 162579#L171-12 assume 0 == read_history_bool_~history_id; 162409#L172-12 assume !(0 == read_history_bool_~historyIndex); 162410#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 162690#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 162414#L307 assume !(0 == check_~tmp___3~0 % 256); 162415#L307-1 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; 162422#L151-7 assume 3 == read_history_int8_~history_id; 162642#L152-7 assume !(0 == read_history_int8_~historyIndex); 162867#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 162864#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 162861#L346 assume !(check_~tmp___10~0 > -2); 162858#L346-1 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; 162855#L151-9 assume 3 == read_history_int8_~history_id; 162850#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162845#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 162840#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 162835#L366-1 check_#res := 1; 162538#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 162539#L575-72 assume !(0 == assert_~arg % 256); 162445#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 162446#L550-2 assume !!(main_~i2~0 < 10);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;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; 162697#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 162880#L570-16 assume 0 != ~gate1Failed~0 % 256; 162869#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 162631#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; 162632#L409 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;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; 163209#L226-2 assume !(0 == write_history_bool_~history_id); 163200#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 163197#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 163195#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 163193#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 163191#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 163189#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; 163187#L440 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;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; 163185#L226-4 assume !(0 == write_history_bool_~history_id); 163181#L231-4 assume !(1 == write_history_bool_~history_id); 163171#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 163165#L570-18 assume 0 != ~gate3Failed~0 % 256; 163161#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 163157#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; 163153#L471 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; 163149#L486 assume !(~VALUE1~0 == ~VALUE2~0); 163133#L493 assume !(~VALUE1~0 == ~VALUE3~0); 163128#L500 assume ~VALUE1~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE1~0; 163116#L570-19 [2018-11-28 13:17:42,139 INFO L796 eck$LassoCheckResult]: Loop: 163116#L570-19 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; 163112#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 163108#L570-20 ~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;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; 163104#L294 assume !(0 == ~gate1Failed~0 % 256); 163099#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 163098#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 163094#L171-12 assume 0 == read_history_bool_~history_id; 163090#L172-12 assume !(0 == read_history_bool_~historyIndex); 163086#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 163006#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 162888#L307 assume !(0 == check_~tmp___3~0 % 256); 162886#L307-1 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; 162640#L151-7 assume 3 == read_history_int8_~history_id; 162641#L152-7 assume !(0 == read_history_int8_~historyIndex); 162452#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 162453#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 162732#L346 assume !(check_~tmp___10~0 > -2); 162733#L346-1 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; 162694#L151-9 assume 3 == read_history_int8_~history_id; 162695#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 162473#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 162474#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 162649#L366-1 check_#res := 1; 162650#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 163084#L575-72 assume !(0 == assert_~arg % 256); 163083#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 163082#L550-2 assume !!(main_~i2~0 < 10);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;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; 163079#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 163077#L570-16 assume 0 != ~gate1Failed~0 % 256; 163075#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 163073#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; 163071#L409 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;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; 163069#L226-2 assume !(0 == write_history_bool_~history_id); 163066#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 163063#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 163061#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 163059#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 163057#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 163055#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; 163053#L440 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;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; 163051#L226-4 assume !(0 == write_history_bool_~history_id); 163049#L231-4 assume !(1 == write_history_bool_~history_id); 163047#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 163042#L570-18 assume 0 != ~gate3Failed~0 % 256; 163038#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 163035#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; 163032#L471 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; 163028#L486 assume !(~VALUE1~0 == ~VALUE2~0); 163029#L493 assume !(~VALUE1~0 == ~VALUE3~0); 163132#L500 assume ~VALUE1~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE1~0; 163116#L570-19 [2018-11-28 13:17:42,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:42,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1306939890, now seen corresponding path program 1 times [2018-11-28 13:17:42,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:42,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:42,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:42,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-28 13:17:42,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:42,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:17:42,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:42,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-28 13:17:43,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:43,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-11-28 13:17:43,055 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:17:43,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash -846001062, now seen corresponding path program 1 times [2018-11-28 13:17:43,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:43,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:43,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:43,642 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 228 [2018-11-28 13:17:44,556 WARN L180 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2018-11-28 13:17:44,558 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:44,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:44,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:44,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:44,559 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:17:44,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:44,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:44,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:44,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration35_Loop [2018-11-28 13:17:44,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:44,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:44,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,723 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2018-11-28 13:17:44,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,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-28 13:17:44,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:17:44,968 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-28 13:17:45,127 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 13:17:51,417 WARN L180 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 245 DAG size of output: 141 [2018-11-28 13:17:51,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:51,518 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 269 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 269 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,521 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,525 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,525 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 270 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 270 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,545 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,545 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___9~0=0} Honda state: {ULTIMATE.start_check_~tmp___9~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 271 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 271 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,561 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,561 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 272 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 272 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,578 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,578 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 273 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 273 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,603 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 274 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 274 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,617 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,619 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,619 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 275 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 275 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,635 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post15=0} Honda state: {ULTIMATE.start_check_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 276 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 276 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,652 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_33=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_33=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 277 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 277 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,668 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,668 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 278 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 278 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,683 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,685 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,685 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 279 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 279 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,706 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,708 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,708 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 280 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 280 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,723 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,724 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,724 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 281 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 281 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,747 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,748 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 282 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 282 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,765 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 283 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 283 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,780 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,781 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,781 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 284 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 284 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,799 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 285 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 285 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,823 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_#in~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_#in~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 286 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 286 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,844 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,846 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,846 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___8~0=0} Honda state: {ULTIMATE.start_check_~tmp___8~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 287 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 287 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,869 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,873 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 288 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 288 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,906 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 289 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 289 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,932 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,932 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 290 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 290 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,964 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,964 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret9=0} Honda state: {ULTIMATE.start_check_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 291 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 291 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:51,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:51,985 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:51,987 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:51,987 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0=0} Honda state: {ULTIMATE.start_check_~temp_count~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 292 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 292 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:52,003 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:52,003 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:52,025 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:52,025 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_33=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_33=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 293 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 293 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:52,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:52,030 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:52,032 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:52,032 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 294 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 294 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:52,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:52,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:52,055 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:52,055 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 295 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 295 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:52,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:52,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:52,071 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:52,071 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 296 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 296 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:52,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:52,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:52,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:52,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_33=3} Honda state: {v_rep#funAddr~voter.offset_33=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 297 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 297 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:52,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:52,110 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:17:52,112 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:17:52,112 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 298 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 298 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:52,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:17:52,126 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 299 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 299 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:52,739 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:17:52,739 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:05,145 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 13:18:05,171 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:18:05,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:18:05,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:18:05,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:18:05,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:18:05,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:05,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:18:05,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:18:05,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration35_Loop [2018-11-28 13:18:05,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:18:05,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,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-28 13:18:05,328 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2018-11-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,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-28 13:18:05,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-28 13:18:05,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:05,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-28 13:18:05,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-28 13:18:05,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-28 13:18:05,581 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-28 13:18:05,763 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 13:18:12,155 WARN L180 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 245 DAG size of output: 141 [2018-11-28 13:18:12,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:18:12,255 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:18:12,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:12,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:12,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:12,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:12,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,279 INFO L206 nArgumentSynthesizer]: 24 loop disjuncts [2018-11-28 13:18:12,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,294 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-28 13:18:12,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:12,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:12,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:12,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:12,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,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-28 13:18:12,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:12,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:12,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:12,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:12,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:12,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:12,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:12,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:12,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:12,435 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:18:12,436 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:18:12,436 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:18:12,436 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:18:12,436 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:18:12,436 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:18:12,436 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 13:18:12,436 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:18:12,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:12,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:12,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:12,742 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-28 13:18:12,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1128 states and 1389 transitions. cyclomatic complexity: 269 Second operand 5 states. [2018-11-28 13:18:12,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1128 states and 1389 transitions. cyclomatic complexity: 269. Second operand 5 states. Result 2354 states and 2899 transitions. Complement of second has 6 states. [2018-11-28 13:18:12,770 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-28 13:18:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:18:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2018-11-28 13:18:12,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 341 transitions. Stem has 203 letters. Loop has 50 letters. [2018-11-28 13:18:12,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:12,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 341 transitions. Stem has 253 letters. Loop has 50 letters. [2018-11-28 13:18:12,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:12,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 341 transitions. Stem has 203 letters. Loop has 100 letters. [2018-11-28 13:18:12,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:12,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2354 states and 2899 transitions. [2018-11-28 13:18:12,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-28 13:18:12,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2354 states to 926 states and 1132 transitions. [2018-11-28 13:18:12,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 356 [2018-11-28 13:18:12,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2018-11-28 13:18:12,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 926 states and 1132 transitions. [2018-11-28 13:18:12,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:18:12,776 INFO L705 BuchiCegarLoop]: Abstraction has 926 states and 1132 transitions. [2018-11-28 13:18:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states and 1132 transitions. [2018-11-28 13:18:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2018-11-28 13:18:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-11-28 13:18:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1132 transitions. [2018-11-28 13:18:12,780 INFO L728 BuchiCegarLoop]: Abstraction has 926 states and 1132 transitions. [2018-11-28 13:18:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 13:18:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:18:12,780 INFO L87 Difference]: Start difference. First operand 926 states and 1132 transitions. Second operand 16 states. [2018-11-28 13:18:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:15,671 INFO L93 Difference]: Finished difference Result 9561 states and 11489 transitions. [2018-11-28 13:18:15,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-11-28 13:18:15,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9561 states and 11489 transitions. [2018-11-28 13:18:15,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3036 [2018-11-28 13:18:15,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9561 states to 8721 states and 10481 transitions. [2018-11-28 13:18:15,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4081 [2018-11-28 13:18:15,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4081 [2018-11-28 13:18:15,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8721 states and 10481 transitions. [2018-11-28 13:18:15,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:18:15,702 INFO L705 BuchiCegarLoop]: Abstraction has 8721 states and 10481 transitions. [2018-11-28 13:18:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states and 10481 transitions. [2018-11-28 13:18:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 3535. [2018-11-28 13:18:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2018-11-28 13:18:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4289 transitions. [2018-11-28 13:18:15,737 INFO L728 BuchiCegarLoop]: Abstraction has 3535 states and 4289 transitions. [2018-11-28 13:18:15,737 INFO L608 BuchiCegarLoop]: Abstraction has 3535 states and 4289 transitions. [2018-11-28 13:18:15,737 INFO L442 BuchiCegarLoop]: ======== Iteration 36============ [2018-11-28 13:18:15,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3535 states and 4289 transitions. [2018-11-28 13:18:15,741 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1172 [2018-11-28 13:18:15,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:18:15,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:18:15,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-28 13:18:15,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:18:15,743 INFO L794 eck$LassoCheckResult]: Stem: 178283#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 177989#L-1 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;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;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; 177990#L116-2 assume !!(add_history_type_~var~0 < 3); 178142#L117 assume 0 == add_history_type_~history_id;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; 178481#L171 assume 0 == read_history_bool_~history_id; 178477#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 178478#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 178471#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 178472#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178467#L116-2 assume !!(add_history_type_~var~0 < 3); 178468#L117 assume 0 == add_history_type_~history_id;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; 178211#L171 assume 0 == read_history_bool_~history_id; 178212#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 177952#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 178185#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 178186#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178143#L116-2 assume !!(add_history_type_~var~0 < 3); 178144#L117 assume 0 == add_history_type_~history_id;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; 178461#L171 assume 0 == read_history_bool_~history_id; 178462#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 178453#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 178452#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 178443#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178384#L116-2 assume !(add_history_type_~var~0 < 3); 178134#L116-3 add_history_type_#res := 1; 178135#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 177991#L255 assume !(0 == init_~tmp~1);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; 177992#L116-6 assume !!(add_history_type_~var~0 < 3); 177983#L117-2 assume !(0 == add_history_type_~history_id); 177984#L123-2 assume 1 == add_history_type_~history_id;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; 179244#L171-4 assume !(0 == read_history_bool_~history_id); 179243#L181-4 assume 1 == read_history_bool_~history_id; 178441#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 178439#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 178434#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 178435#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178193#L116-6 assume !!(add_history_type_~var~0 < 3); 178194#L117-2 assume !(0 == add_history_type_~history_id); 178448#L123-2 assume 1 == add_history_type_~history_id;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; 178449#L171-4 assume !(0 == read_history_bool_~history_id); 178311#L181-4 assume 1 == read_history_bool_~history_id; 178312#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 179236#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 179235#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 179234#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 179233#L116-6 assume !!(add_history_type_~var~0 < 3); 178367#L117-2 assume !(0 == add_history_type_~history_id); 179232#L123-2 assume 1 == add_history_type_~history_id;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; 179231#L171-4 assume !(0 == read_history_bool_~history_id); 179230#L181-4 assume 1 == read_history_bool_~history_id; 178398#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 178396#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 178378#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 178379#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178365#L116-6 assume !(add_history_type_~var~0 < 3); 178366#L116-7 add_history_type_#res := 1; 178301#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 178302#L259 assume !(0 == init_~tmp___0~1);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; 178380#L116-10 assume !!(add_history_type_~var~0 < 3); 178381#L117-4 assume !(0 == add_history_type_~history_id); 178427#L123-4 assume !(1 == add_history_type_~history_id); 178428#L129-4 assume 2 == add_history_type_~history_id;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; 178419#L171-8 assume !(0 == read_history_bool_~history_id); 178420#L181-8 assume !(1 == read_history_bool_~history_id); 178411#L191-8 assume 2 == read_history_bool_~history_id; 178412#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 178393#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 178394#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 178382#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178383#L116-10 assume !!(add_history_type_~var~0 < 3); 177971#L117-4 assume !(0 == add_history_type_~history_id); 177972#L123-4 assume !(1 == add_history_type_~history_id); 178260#L129-4 assume 2 == add_history_type_~history_id;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; 178261#L171-8 assume !(0 == read_history_bool_~history_id); 178329#L181-8 assume !(1 == read_history_bool_~history_id); 178330#L191-8 assume 2 == read_history_bool_~history_id; 178332#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 178239#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 178008#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 178009#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178376#L116-10 assume !!(add_history_type_~var~0 < 3); 178377#L117-4 assume !(0 == add_history_type_~history_id); 178357#L123-4 assume !(1 == add_history_type_~history_id); 178358#L129-4 assume 2 == add_history_type_~history_id;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; 178189#L171-8 assume !(0 == read_history_bool_~history_id); 178190#L181-8 assume !(1 == read_history_bool_~history_id); 178047#L191-8 assume 2 == read_history_bool_~history_id; 178048#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 178334#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 178335#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 178205#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178206#L116-10 assume !(add_history_type_~var~0 < 3); 178090#L116-11 add_history_type_#res := 1; 178091#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 177977#L263 assume !(0 == init_~tmp___1~1);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; 177978#L116-14 assume !!(add_history_type_~var~0 < 3); 177953#L117-6 assume !(0 == add_history_type_~history_id); 177954#L123-6 assume !(1 == add_history_type_~history_id); 178421#L129-6 assume !(2 == add_history_type_~history_id); 178422#L135-9 assume 3 == add_history_type_~history_id;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; 178413#L151-3 assume 3 == read_history_int8_~history_id; 178414#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 178400#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 178401#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 178385#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178386#L116-14 assume !!(add_history_type_~var~0 < 3); 177955#L117-6 assume !(0 == add_history_type_~history_id); 177956#L123-6 assume !(1 == add_history_type_~history_id); 178242#L129-6 assume !(2 == add_history_type_~history_id); 178243#L135-9 assume 3 == add_history_type_~history_id;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; 178279#L151-3 assume 3 == read_history_int8_~history_id; 178280#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 178181#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 178182#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 178138#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178139#L116-14 assume !!(add_history_type_~var~0 < 3); 178368#L117-6 assume !(0 == add_history_type_~history_id); 178369#L123-6 assume !(1 == add_history_type_~history_id); 178240#L129-6 assume !(2 == add_history_type_~history_id); 178241#L135-9 assume 3 == add_history_type_~history_id;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; 178277#L151-3 assume 3 == read_history_int8_~history_id; 178278#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 178179#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 178180#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 178136#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 178137#L116-14 assume !(add_history_type_~var~0 < 3); 178063#L116-15 add_history_type_#res := 1; 178064#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 178284#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 178285#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 179222#L550-2 assume !!(main_~i2~0 < 10);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;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; 179220#L226 assume !(0 == write_history_bool_~history_id); 179218#L231 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 179217#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 179216#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 179215#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 179214#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; 179213#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; 179212#L409 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;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; 179211#L226-2 assume !(0 == write_history_bool_~history_id); 179209#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 179208#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 179207#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 179206#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 179205#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 179204#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; 179203#L440 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;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; 179202#L226-4 assume !(0 == write_history_bool_~history_id); 179201#L231-4 assume !(1 == write_history_bool_~history_id); 179200#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 179198#L570-18 assume 0 != ~gate3Failed~0 % 256; 179197#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 179196#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; 179195#L471 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; 179194#L486 assume ~VALUE1~0 == ~VALUE2~0; 179175#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 179192#L570-19 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; 179190#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 179179#L570-20 ~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;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; 179177#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 179157#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 179154#L171-12 assume 0 == read_history_bool_~history_id; 179150#L172-12 assume !(0 == read_history_bool_~historyIndex); 179147#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 179143#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 179090#L307 assume !(0 == check_~tmp___3~0 % 256); 179085#L307-1 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; 179084#L151-7 assume 3 == read_history_int8_~history_id; 179083#L152-7 assume !(0 == read_history_int8_~historyIndex); 179082#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 179081#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 179080#L346 assume !(check_~tmp___10~0 > -2); 179079#L346-1 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; 179078#L151-9 assume 3 == read_history_int8_~history_id; 179076#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 179074#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 179071#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 179068#L366-1 check_#res := 1; 179069#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 179749#L575-72 assume !(0 == assert_~arg % 256); 179744#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 179739#L550-2 assume !!(main_~i2~0 < 10);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;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; 179725#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 179718#L570-16 assume 0 != ~gate1Failed~0 % 256; 179713#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 179711#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; 179709#L409 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;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; 179707#L226-2 assume !(0 == write_history_bool_~history_id); 179704#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 179701#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 179699#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 179697#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 179695#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 179693#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; 179691#L440 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;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; 179689#L226-4 assume !(0 == write_history_bool_~history_id); 179687#L231-4 assume !(1 == write_history_bool_~history_id); 179685#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 179682#L570-18 assume 0 != ~gate3Failed~0 % 256; 179679#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 179677#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; 179646#L471 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; 179644#L486 assume !(~VALUE1~0 == ~VALUE2~0); 179641#L493 assume !(~VALUE1~0 == ~VALUE3~0); 179639#L500 assume !(~VALUE1~0 != ~nomsg~0); 179637#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 179634#L570-19 [2018-11-28 13:18:15,743 INFO L796 eck$LassoCheckResult]: Loop: 179634#L570-19 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; 179633#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 179632#L570-20 ~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;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; 178573#L294 assume !(0 == ~gate1Failed~0 % 256); 178574#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 179669#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 179667#L171-12 assume !(0 == read_history_bool_~history_id); 179668#L181-12 assume !(1 == read_history_bool_~history_id); 179672#L191-12 assume 2 == read_history_bool_~history_id; 179673#L192-12 assume !(0 == read_history_bool_~historyIndex); 179619#L195-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_1~0; 179620#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 179599#L307 assume !(0 == check_~tmp___3~0 % 256); 179593#L307-1 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; 179590#L151-7 assume 3 == read_history_int8_~history_id; 179587#L152-7 assume !(0 == read_history_int8_~historyIndex); 179584#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 179581#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 179578#L346 assume !(check_~tmp___10~0 > -2); 179576#L346-1 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; 179572#L151-9 assume 3 == read_history_int8_~history_id; 179573#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 180677#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 180675#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 180673#L366-1 check_#res := 1; 180603#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 180601#L575-72 assume !(0 == assert_~arg % 256); 180599#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 180597#L550-2 assume !!(main_~i2~0 < 10);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;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; 180595#L226 assume !(0 == write_history_bool_~history_id); 180582#L231 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 180579#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 180580#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 180682#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 180681#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; 180661#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; 180660#L409 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;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; 180659#L226-2 assume !(0 == write_history_bool_~history_id); 180655#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 180653#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 180652#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 180604#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 180602#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 180600#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; 180598#L440 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;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; 180596#L226-4 assume !(0 == write_history_bool_~history_id); 180594#L231-4 assume !(1 == write_history_bool_~history_id); 180593#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 180592#L570-18 assume 0 != ~gate3Failed~0 % 256; 180591#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 180587#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; 180586#L471 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; 180585#L486 assume ~VALUE1~0 == ~VALUE2~0; 180436#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 180531#L570-19 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; 180529#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 180527#L570-20 ~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;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; 180525#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 178291#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 180521#L171-12 assume !(0 == read_history_bool_~history_id); 180522#L181-12 assume !(1 == read_history_bool_~history_id); 180520#L191-12 assume 2 == read_history_bool_~history_id; 180518#L192-12 assume !(0 == read_history_bool_~historyIndex); 180515#L195-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_1~0; 180516#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 181429#L307 assume !(0 == check_~tmp___3~0 % 256); 178010#L307-1 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; 178011#L151-7 assume 3 == read_history_int8_~history_id; 178069#L152-7 assume !(0 == read_history_int8_~historyIndex); 178039#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 178040#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 178072#L346 assume !(check_~tmp___10~0 > -2); 178342#L346-1 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; 178303#L151-9 assume 3 == read_history_int8_~history_id; 178304#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 179570#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 179559#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 178244#L366-1 check_#res := 1; 178124#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 178125#L575-72 assume !(0 == assert_~arg % 256); 179738#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 179736#L550-2 assume !!(main_~i2~0 < 10);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;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; 179734#L226 assume !(0 == write_history_bool_~history_id); 179723#L231 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 179716#L570-16 assume 0 != ~gate1Failed~0 % 256; 179712#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 179710#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; 179708#L409 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;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; 179706#L226-2 assume !(0 == write_history_bool_~history_id); 179702#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 179700#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 179698#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 179696#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 179694#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 179692#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; 179690#L440 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;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; 179688#L226-4 assume !(0 == write_history_bool_~history_id); 179686#L231-4 assume !(1 == write_history_bool_~history_id); 179684#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 179680#L570-18 assume 0 != ~gate3Failed~0 % 256; 179678#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 179676#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; 179645#L471 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; 179642#L486 assume !(~VALUE1~0 == ~VALUE2~0); 179640#L493 assume !(~VALUE1~0 == ~VALUE3~0); 179638#L500 assume !(~VALUE1~0 != ~nomsg~0); 179635#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 179634#L570-19 [2018-11-28 13:18:15,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:15,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1453205744, now seen corresponding path program 1 times [2018-11-28 13:18:15,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:15,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:15,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-28 13:18:15,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:15,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:15,784 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:18:15,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 525631029, now seen corresponding path program 1 times [2018-11-28 13:18:15,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:15,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:15,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 13:18:15,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:15,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:15,814 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:18:15,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:18:15,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:18:15,814 INFO L87 Difference]: Start difference. First operand 3535 states and 4289 transitions. cyclomatic complexity: 771 Second operand 3 states. [2018-11-28 13:18:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:15,837 INFO L93 Difference]: Finished difference Result 5169 states and 6218 transitions. [2018-11-28 13:18:15,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:18:15,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5169 states and 6218 transitions. [2018-11-28 13:18:15,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1556 [2018-11-28 13:18:15,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5169 states to 5099 states and 6148 transitions. [2018-11-28 13:18:15,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2339 [2018-11-28 13:18:15,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2339 [2018-11-28 13:18:15,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5099 states and 6148 transitions. [2018-11-28 13:18:15,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:18:15,881 INFO L705 BuchiCegarLoop]: Abstraction has 5099 states and 6148 transitions. [2018-11-28 13:18:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5099 states and 6148 transitions. [2018-11-28 13:18:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5099 to 3375. [2018-11-28 13:18:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3375 states. [2018-11-28 13:18:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 4074 transitions. [2018-11-28 13:18:15,909 INFO L728 BuchiCegarLoop]: Abstraction has 3375 states and 4074 transitions. [2018-11-28 13:18:15,909 INFO L608 BuchiCegarLoop]: Abstraction has 3375 states and 4074 transitions. [2018-11-28 13:18:15,909 INFO L442 BuchiCegarLoop]: ======== Iteration 37============ [2018-11-28 13:18:15,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3375 states and 4074 transitions. [2018-11-28 13:18:15,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1116 [2018-11-28 13:18:15,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:18:15,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:18:15,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-28 13:18:15,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:18:15,917 INFO L794 eck$LassoCheckResult]: Stem: 186987#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 186696#L-1 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;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;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; 186697#L116-2 assume !!(add_history_type_~var~0 < 3); 186846#L117 assume 0 == add_history_type_~history_id;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; 187185#L171 assume 0 == read_history_bool_~history_id; 186753#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 186754#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 187055#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 186898#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 186899#L116-2 assume !!(add_history_type_~var~0 < 3); 186751#L117 assume 0 == add_history_type_~history_id;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; 186752#L171 assume 0 == read_history_bool_~history_id; 187181#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 187179#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 187180#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 187175#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 187176#L116-2 assume !!(add_history_type_~var~0 < 3); 187157#L117 assume 0 == add_history_type_~history_id;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; 187158#L171 assume 0 == read_history_bool_~history_id; 187147#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 187143#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 187144#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 187136#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 187137#L116-2 assume !(add_history_type_~var~0 < 3); 186838#L116-3 add_history_type_#res := 1; 186839#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 186698#L255 assume !(0 == init_~tmp~1);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; 186699#L116-6 assume !!(add_history_type_~var~0 < 3); 187172#L117-2 assume !(0 == add_history_type_~history_id); 187173#L123-2 assume 1 == add_history_type_~history_id;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; 186844#L171-4 assume !(0 == read_history_bool_~history_id); 186845#L181-4 assume 1 == read_history_bool_~history_id; 187162#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 187160#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 187151#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 187152#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 186896#L116-6 assume !!(add_history_type_~var~0 < 3); 186897#L117-2 assume !(0 == add_history_type_~history_id); 187170#L123-2 assume 1 == add_history_type_~history_id;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; 187171#L171-4 assume !(0 == read_history_bool_~history_id); 187166#L181-4 assume 1 == read_history_bool_~history_id; 187167#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 187014#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 187015#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 186921#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 186922#L116-6 assume !!(add_history_type_~var~0 < 3); 187070#L117-2 assume !(0 == add_history_type_~history_id); 187138#L123-2 assume 1 == add_history_type_~history_id;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; 187129#L171-4 assume !(0 == read_history_bool_~history_id); 187130#L181-4 assume 1 == read_history_bool_~history_id; 187096#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 187094#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 187081#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 187082#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 187068#L116-6 assume !(add_history_type_~var~0 < 3); 187069#L116-7 add_history_type_#res := 1; 187000#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 187001#L259 assume !(0 == init_~tmp___0~1);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; 187066#L116-10 assume !!(add_history_type_~var~0 < 3); 187067#L117-4 assume !(0 == add_history_type_~history_id); 187127#L123-4 assume !(1 == add_history_type_~history_id); 187128#L129-4 assume 2 == add_history_type_~history_id;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; 187121#L171-8 assume !(0 == read_history_bool_~history_id); 187122#L181-8 assume !(1 == read_history_bool_~history_id); 187113#L191-8 assume 2 == read_history_bool_~history_id; 187114#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 187037#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 187038#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 186911#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 186912#L116-10 assume !!(add_history_type_~var~0 < 3); 186682#L117-4 assume !(0 == add_history_type_~history_id); 186683#L123-4 assume !(1 == add_history_type_~history_id); 186966#L129-4 assume 2 == add_history_type_~history_id;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; 186967#L171-8 assume !(0 == read_history_bool_~history_id); 187031#L181-8 assume !(1 == read_history_bool_~history_id); 187032#L191-8 assume 2 == read_history_bool_~history_id; 187034#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 186946#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 187091#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 187092#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 187079#L116-10 assume !!(add_history_type_~var~0 < 3); 187080#L117-4 assume !(0 == add_history_type_~history_id); 187056#L123-4 assume !(1 == add_history_type_~history_id); 187057#L129-4 assume 2 == add_history_type_~history_id;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; 186890#L171-8 assume !(0 == read_history_bool_~history_id); 186891#L181-8 assume !(1 == read_history_bool_~history_id); 186755#L191-8 assume 2 == read_history_bool_~history_id; 186756#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 187035#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 187036#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 186909#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 186910#L116-10 assume !(add_history_type_~var~0 < 3); 186799#L116-11 add_history_type_#res := 1; 186800#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 186688#L263 assume !(0 == init_~tmp___1~1);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; 186689#L116-14 assume !!(add_history_type_~var~0 < 3); 186664#L117-6 assume !(0 == add_history_type_~history_id); 186665#L123-6 assume !(1 == add_history_type_~history_id); 186949#L129-6 assume !(2 == add_history_type_~history_id); 186950#L135-9 assume 3 == add_history_type_~history_id;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; 186984#L151-3 assume 3 == read_history_int8_~history_id; 186985#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 186882#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 186883#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 186842#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 186843#L116-14 assume !!(add_history_type_~var~0 < 3); 186666#L117-6 assume !(0 == add_history_type_~history_id); 186667#L123-6 assume !(1 == add_history_type_~history_id); 187119#L129-6 assume !(2 == add_history_type_~history_id); 187120#L135-9 assume 3 == add_history_type_~history_id;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; 187111#L151-3 assume 3 == read_history_int8_~history_id; 187112#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 187098#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 187099#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 187083#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 187084#L116-14 assume !!(add_history_type_~var~0 < 3); 187071#L117-6 assume !(0 == add_history_type_~history_id); 187072#L123-6 assume !(1 == add_history_type_~history_id); 186947#L129-6 assume !(2 == add_history_type_~history_id); 186948#L135-9 assume 3 == add_history_type_~history_id;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; 186982#L151-3 assume 3 == read_history_int8_~history_id; 186983#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 186880#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 186881#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 186840#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 186841#L116-14 assume !(add_history_type_~var~0 < 3); 186772#L116-15 add_history_type_#res := 1; 186773#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 186988#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 186989#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 189008#L550-2 assume !!(main_~i2~0 < 10);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;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; 189009#L226 assume !(0 == write_history_bool_~history_id); 189734#L231 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 189732#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 189730#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 189728#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 189726#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; 189724#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; 189722#L409 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;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; 189720#L226-2 assume !(0 == write_history_bool_~history_id); 189714#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 189712#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 189710#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 189708#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 189706#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 189704#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; 189702#L440 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;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; 189699#L226-4 assume !(0 == write_history_bool_~history_id); 189698#L231-4 assume !(1 == write_history_bool_~history_id); 189691#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 189686#L570-18 assume 0 != ~gate3Failed~0 % 256; 189681#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 189677#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; 189637#L471 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; 188942#L486 assume ~VALUE1~0 == ~VALUE2~0; 188940#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 188938#L570-19 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; 188936#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 188931#L570-20 ~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;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; 188899#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 188895#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 188893#L171-12 assume 0 == read_history_bool_~history_id; 188891#L172-12 assume !(0 == read_history_bool_~historyIndex); 188889#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 188887#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 188817#L307 assume !(0 == check_~tmp___3~0 % 256); 188809#L307-1 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; 188800#L151-7 assume 3 == read_history_int8_~history_id; 188781#L152-7 assume !(0 == read_history_int8_~historyIndex); 188763#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 188751#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 188652#L346 assume !(check_~tmp___10~0 > -2); 188650#L346-1 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; 188648#L151-9 assume 3 == read_history_int8_~history_id; 188646#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 188644#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 188642#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 188639#L366-1 check_#res := 1; 188637#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 188635#L575-72 assume !(0 == assert_~arg % 256); 188633#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 188629#L550-2 assume !!(main_~i2~0 < 10);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;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; 188548#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 188546#L570-16 assume 0 != ~gate1Failed~0 % 256; 188524#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 188170#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; 188168#L409 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;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; 188166#L226-2 assume !(0 == write_history_bool_~history_id); 188162#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 188161#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 188160#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 188159#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 188114#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 188107#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; 188103#L440 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;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; 188097#L226-4 assume !(0 == write_history_bool_~history_id); 188091#L231-4 assume !(1 == write_history_bool_~history_id); 188085#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 188079#L570-18 assume 0 != ~gate3Failed~0 % 256; 188080#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 188088#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; 188082#L471 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; 188071#L486 assume !(~VALUE1~0 == ~VALUE2~0); 188070#L493 assume !(~VALUE1~0 == ~VALUE3~0); 188069#L500 assume !(~VALUE1~0 != ~nomsg~0); 187739#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 187737#L570-19 [2018-11-28 13:18:15,917 INFO L796 eck$LassoCheckResult]: Loop: 187737#L570-19 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; 187735#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 187733#L570-20 ~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;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; 187731#L294 assume !(0 == ~gate1Failed~0 % 256); 187729#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 187727#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 187725#L171-12 assume 0 == read_history_bool_~history_id; 187723#L172-12 assume !(0 == read_history_bool_~historyIndex); 187199#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 187198#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 186708#L307 assume 0 == check_~tmp___3~0 % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 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; 186709#L171-13 assume !(0 == read_history_bool_~history_id); 187847#L181-13 assume 1 == read_history_bool_~history_id; 187839#L182-13 assume !(0 == read_history_bool_~historyIndex); 187832#L185-13 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_1~0; 187826#L203-13 check_#t~ret10 := read_history_bool_#res;check_~tmp___4~0 := check_#t~ret10;havoc check_#t~ret10; 187614#L309 assume !(0 == check_~tmp___4~0 % 256); 187612#L307-1 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; 187610#L151-7 assume 3 == read_history_int8_~history_id; 187608#L152-7 assume !(0 == read_history_int8_~historyIndex); 187606#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 187604#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 187602#L346 assume !(check_~tmp___10~0 > -2); 187600#L346-1 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; 187592#L151-9 assume 3 == read_history_int8_~history_id; 187581#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 187575#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 187554#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 187552#L366-1 check_#res := 1; 187550#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 187548#L575-72 assume !(0 == assert_~arg % 256); 187545#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 187543#L550-2 assume !!(main_~i2~0 < 10);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;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; 187532#L226 assume !(0 == write_history_bool_~history_id); 187448#L231 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 187443#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 187442#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 187439#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 187437#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; 187435#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; 187433#L409 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;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; 187431#L226-2 assume !(0 == write_history_bool_~history_id); 187427#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 187425#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 187423#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 187421#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 187418#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 187300#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; 187296#L440 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;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; 187294#L226-4 assume !(0 == write_history_bool_~history_id); 187292#L231-4 assume !(1 == write_history_bool_~history_id); 187290#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 187288#L570-18 assume 0 != ~gate3Failed~0 % 256; 187286#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 187284#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; 187262#L471 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; 187245#L486 assume ~VALUE1~0 == ~VALUE2~0; 187241#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 187242#L570-19 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; 187958#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 187957#L570-20 ~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;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; 187953#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 187590#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 187579#L171-12 assume 0 == read_history_bool_~history_id; 187573#L172-12 assume !(0 == read_history_bool_~historyIndex); 187568#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 187553#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 187551#L307 assume 0 == check_~tmp___3~0 % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 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; 187549#L171-13 assume !(0 == read_history_bool_~history_id); 187546#L181-13 assume 1 == read_history_bool_~history_id; 187547#L182-13 assume !(0 == read_history_bool_~historyIndex); 187538#L185-13 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_1~0; 187530#L203-13 check_#t~ret10 := read_history_bool_#res;check_~tmp___4~0 := check_#t~ret10;havoc check_#t~ret10; 187368#L309 assume !(0 == check_~tmp___4~0 % 256); 187367#L307-1 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; 187366#L151-7 assume 3 == read_history_int8_~history_id; 187365#L152-7 assume !(0 == read_history_int8_~historyIndex); 187364#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 187363#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 187362#L346 assume !(check_~tmp___10~0 > -2); 187361#L346-1 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; 187360#L151-9 assume 3 == read_history_int8_~history_id; 187359#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 187358#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 187357#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 187356#L366-1 check_#res := 1; 187355#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 187354#L575-72 assume !(0 == assert_~arg % 256); 187353#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 187352#L550-2 assume !!(main_~i2~0 < 10);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;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; 187350#L226 assume !(0 == write_history_bool_~history_id); 187348#L231 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 187343#L570-16 assume 0 != ~gate1Failed~0 % 256; 187344#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 188158#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; 188068#L409 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;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; 188067#L226-2 assume !(0 == write_history_bool_~history_id); 188065#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 188064#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 187345#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 187342#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 187340#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 187338#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; 187336#L440 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;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; 187334#L226-4 assume !(0 == write_history_bool_~history_id); 187332#L231-4 assume !(1 == write_history_bool_~history_id); 187330#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 187328#L570-18 assume 0 != ~gate3Failed~0 % 256; 187329#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 187753#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; 187751#L471 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; 187748#L486 assume !(~VALUE1~0 == ~VALUE2~0); 187746#L493 assume !(~VALUE1~0 == ~VALUE3~0); 187744#L500 assume !(~VALUE1~0 != ~nomsg~0); 187742#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 187737#L570-19 [2018-11-28 13:18:15,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1453205744, now seen corresponding path program 2 times [2018-11-28 13:18:15,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:15,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:15,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:15,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:15,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-28 13:18:16,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:16,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:16,009 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:18:16,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1944259787, now seen corresponding path program 1 times [2018-11-28 13:18:16,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:16,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:16,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:18:16,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:18:16,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:16,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:16,027 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:18:16,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:18:16,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:18:16,027 INFO L87 Difference]: Start difference. First operand 3375 states and 4074 transitions. cyclomatic complexity: 716 Second operand 3 states. [2018-11-28 13:18:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:16,035 INFO L93 Difference]: Finished difference Result 1566 states and 1863 transitions. [2018-11-28 13:18:16,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:18:16,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1566 states and 1863 transitions. [2018-11-28 13:18:16,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 368 [2018-11-28 13:18:16,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1566 states to 1566 states and 1863 transitions. [2018-11-28 13:18:16,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2018-11-28 13:18:16,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2018-11-28 13:18:16,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1566 states and 1863 transitions. [2018-11-28 13:18:16,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:18:16,041 INFO L705 BuchiCegarLoop]: Abstraction has 1566 states and 1863 transitions. [2018-11-28 13:18:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states and 1863 transitions. [2018-11-28 13:18:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1409. [2018-11-28 13:18:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1409 states. [2018-11-28 13:18:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1686 transitions. [2018-11-28 13:18:16,049 INFO L728 BuchiCegarLoop]: Abstraction has 1409 states and 1686 transitions. [2018-11-28 13:18:16,049 INFO L608 BuchiCegarLoop]: Abstraction has 1409 states and 1686 transitions. [2018-11-28 13:18:16,049 INFO L442 BuchiCegarLoop]: ======== Iteration 38============ [2018-11-28 13:18:16,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1409 states and 1686 transitions. [2018-11-28 13:18:16,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 368 [2018-11-28 13:18:16,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:18:16,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:18:16,053 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-11-28 13:18:16,053 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:18:16,053 INFO L794 eck$LassoCheckResult]: Stem: 191952#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 191644#L-1 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;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;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; 191645#L116-2 assume !!(add_history_type_~var~0 < 3); 191807#L117 assume 0 == add_history_type_~history_id;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; 192373#L171 assume 0 == read_history_bool_~history_id; 191706#L172 assume !(0 == read_history_bool_~historyIndex); 191610#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 191611#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 191847#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 191848#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 191858#L116-2 assume !!(add_history_type_~var~0 < 3); 192376#L117 assume 0 == add_history_type_~history_id;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; 192375#L171 assume 0 == read_history_bool_~history_id; 192367#L172 assume !(0 == read_history_bool_~historyIndex); 192368#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 192441#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 192150#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 192151#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 192145#L116-2 assume !!(add_history_type_~var~0 < 3); 192122#L117 assume 0 == add_history_type_~history_id;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; 192133#L171 assume 0 == read_history_bool_~history_id; 192134#L172 assume !(0 == read_history_bool_~historyIndex); 192131#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 192132#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 192125#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 192126#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 192120#L116-2 assume !(add_history_type_~var~0 < 3); 192121#L116-3 add_history_type_#res := 1; 191895#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 191896#L255 assume !(0 == init_~tmp~1);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; 191855#L116-6 assume !!(add_history_type_~var~0 < 3); 191856#L117-2 assume !(0 == add_history_type_~history_id); 192155#L123-2 assume 1 == add_history_type_~history_id;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; 192156#L171-4 assume !(0 == read_history_bool_~history_id); 191981#L181-4 assume 1 == read_history_bool_~history_id; 191809#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 191810#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 191687#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 191688#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 191880#L116-6 assume !!(add_history_type_~var~0 < 3); 192360#L117-2 assume !(0 == add_history_type_~history_id); 192359#L123-2 assume 1 == add_history_type_~history_id;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; 192358#L171-4 assume !(0 == read_history_bool_~history_id); 192357#L181-4 assume 1 == read_history_bool_~history_id; 192355#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 192353#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 192352#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 192351#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 192350#L116-6 assume !!(add_history_type_~var~0 < 3); 192046#L117-2 assume !(0 == add_history_type_~history_id); 192349#L123-2 assume 1 == add_history_type_~history_id;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; 192348#L171-4 assume !(0 == read_history_bool_~history_id); 192347#L181-4 assume 1 == read_history_bool_~history_id; 192073#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 192071#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 192058#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 192059#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 192044#L116-6 assume !(add_history_type_~var~0 < 3); 192045#L116-7 add_history_type_#res := 1; 191968#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 191969#L259 assume !(0 == init_~tmp___0~1);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; 192042#L116-10 assume !!(add_history_type_~var~0 < 3); 192043#L117-4 assume !(0 == add_history_type_~history_id); 192032#L123-4 assume !(1 == add_history_type_~history_id); 191929#L129-4 assume 2 == add_history_type_~history_id;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; 191930#L171-8 assume !(0 == read_history_bool_~history_id); 192005#L181-8 assume !(1 == read_history_bool_~history_id); 192006#L191-8 assume 2 == read_history_bool_~history_id; 192008#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 191910#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 191663#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 191664#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 191872#L116-10 assume !!(add_history_type_~var~0 < 3); 191630#L117-4 assume !(0 == add_history_type_~history_id); 191631#L123-4 assume !(1 == add_history_type_~history_id); 192096#L129-4 assume 2 == add_history_type_~history_id;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; 192097#L171-8 assume !(0 == read_history_bool_~history_id); 192090#L181-8 assume !(1 == read_history_bool_~history_id); 192091#L191-8 assume 2 == read_history_bool_~history_id; 192081#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 192082#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 192068#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 192069#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 192056#L116-10 assume !!(add_history_type_~var~0 < 3); 192057#L117-4 assume !(0 == add_history_type_~history_id); 192030#L123-4 assume !(1 == add_history_type_~history_id); 192031#L129-4 assume 2 == add_history_type_~history_id;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; 191851#L171-8 assume !(0 == read_history_bool_~history_id); 191852#L181-8 assume !(1 == read_history_bool_~history_id); 191708#L191-8 assume 2 == read_history_bool_~history_id; 191709#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 192009#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 192010#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 191870#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 191871#L116-10 assume !(add_history_type_~var~0 < 3); 191756#L116-11 add_history_type_#res := 1; 191757#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 191636#L263 assume !(0 == init_~tmp___1~1);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; 191637#L116-14 assume !!(add_history_type_~var~0 < 3); 191612#L117-6 assume !(0 == add_history_type_~history_id); 191613#L123-6 assume !(1 == add_history_type_~history_id); 191913#L129-6 assume !(2 == add_history_type_~history_id); 191914#L135-9 assume 3 == add_history_type_~history_id;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; 191948#L151-3 assume 3 == read_history_int8_~history_id; 191949#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 191843#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 191844#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 191803#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 191804#L116-14 assume !!(add_history_type_~var~0 < 3); 191614#L117-6 assume !(0 == add_history_type_~history_id); 191615#L123-6 assume !(1 == add_history_type_~history_id); 192116#L129-6 assume !(2 == add_history_type_~history_id); 192117#L135-9 assume 3 == add_history_type_~history_id;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; 192112#L151-3 assume 3 == read_history_int8_~history_id; 192113#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 192075#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 192076#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 192060#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 192061#L116-14 assume !!(add_history_type_~var~0 < 3); 192047#L117-6 assume !(0 == add_history_type_~history_id); 192048#L123-6 assume !(1 == add_history_type_~history_id); 191911#L129-6 assume !(2 == add_history_type_~history_id); 191912#L135-9 assume 3 == add_history_type_~history_id;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; 191946#L151-3 assume 3 == read_history_int8_~history_id; 191947#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 191841#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 191842#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 191801#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 191802#L116-14 assume !(add_history_type_~var~0 < 3); 191725#L116-15 add_history_type_#res := 1; 191726#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 191953#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 191954#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 192335#L550-2 assume !!(main_~i2~0 < 10);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;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; 192330#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 192329#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 192327#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 192325#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 192323#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; 192321#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; 192319#L409 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;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; 192317#L226-2 assume !(0 == write_history_bool_~history_id); 192313#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 192311#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 192309#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 192307#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 192305#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 192303#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; 192301#L440 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;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; 192299#L226-4 assume !(0 == write_history_bool_~history_id); 192293#L231-4 assume !(1 == write_history_bool_~history_id); 192289#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 192283#L570-18 assume 0 != ~gate3Failed~0 % 256; 192279#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 192275#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; 192273#L471 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; 192264#L486 assume ~VALUE1~0 == ~VALUE2~0; 192259#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 192254#L570-19 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; 192250#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 192246#L570-20 ~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;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; 192237#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 192233#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 192231#L171-12 assume 0 == read_history_bool_~history_id; 192229#L172-12 assume !(0 == read_history_bool_~historyIndex); 192227#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 192225#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 192185#L307 assume !(0 == check_~tmp___3~0 % 256); 192182#L307-1 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; 192181#L151-7 assume 3 == read_history_int8_~history_id; 192180#L152-7 assume !(0 == read_history_int8_~historyIndex); 192179#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 192178#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 192177#L346 assume !(check_~tmp___10~0 > -2); 192176#L346-1 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; 192175#L151-9 assume 3 == read_history_int8_~history_id; 192174#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 192173#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 192172#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 192170#L366-1 check_#res := 1; 192169#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 192168#L575-72 assume !(0 == assert_~arg % 256); 192167#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 192166#L550-2 assume !!(main_~i2~0 < 10);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;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; 192165#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 192164#L570-16 assume 0 != ~gate1Failed~0 % 256; 192161#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 192162#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; 192979#L409 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;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; 192977#L226-2 assume !(0 == write_history_bool_~history_id); 192973#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 192972#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 192971#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 192970#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 192969#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 192968#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; 192966#L440 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;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; 192964#L226-4 assume !(0 == write_history_bool_~history_id); 192962#L231-4 assume !(1 == write_history_bool_~history_id); 192960#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 192958#L570-18 assume 0 != ~gate3Failed~0 % 256; 192956#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 192955#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; 192954#L471 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; 192952#L486 assume !(~VALUE1~0 == ~VALUE2~0); 192950#L493 assume !(~VALUE1~0 == ~VALUE3~0); 192948#L500 assume !(~VALUE1~0 != ~nomsg~0); 192931#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 192929#L570-19 [2018-11-28 13:18:16,053 INFO L796 eck$LassoCheckResult]: Loop: 192929#L570-19 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; 192927#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 192922#L570-20 ~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;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; 192916#L294 assume !(0 == ~gate1Failed~0 % 256); 192865#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 192863#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 192861#L171-12 assume 0 == read_history_bool_~history_id; 192860#L172-12 assume !(0 == read_history_bool_~historyIndex); 192859#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 192856#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 192749#L307 assume !(0 == check_~tmp___3~0 % 256); 191657#L307-1 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; 191904#L151-7 assume 3 == read_history_int8_~history_id; 191905#L152-7 assume !(0 == read_history_int8_~historyIndex); 191700#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 191701#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 192036#L346 assume !(check_~tmp___10~0 > -2); 192037#L346-1 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; 191970#L151-9 assume 3 == read_history_int8_~history_id; 191971#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 191722#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 191723#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 191915#L366-1 check_#res := 1; 191916#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 192848#L575-72 assume !(0 == assert_~arg % 256); 192846#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 192844#L550-2 assume !!(main_~i2~0 < 10);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;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; 192842#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 192840#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 192837#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 192835#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 192833#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; 192831#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; 192829#L409 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;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; 192826#L226-2 assume !(0 == write_history_bool_~history_id); 192823#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 192821#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 192819#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 192817#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 192815#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 192813#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; 192811#L440 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;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; 192809#L226-4 assume !(0 == write_history_bool_~history_id); 192807#L231-4 assume !(1 == write_history_bool_~history_id); 192804#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 192803#L570-18 assume 0 != ~gate3Failed~0 % 256; 191680#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 191624#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; 191625#L471 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; 192770#L486 assume ~VALUE1~0 == ~VALUE2~0; 192768#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 192766#L570-19 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; 192764#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 192762#L570-20 ~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;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; 192759#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 192755#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 192754#L171-12 assume 0 == read_history_bool_~history_id; 192753#L172-12 assume !(0 == read_history_bool_~historyIndex); 192752#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 192750#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 192751#L307 assume !(0 == check_~tmp___3~0 % 256); 191665#L307-1 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; 191666#L151-7 assume 3 == read_history_int8_~history_id; 191731#L152-7 assume !(0 == read_history_int8_~historyIndex); 191732#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 191734#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 191735#L346 assume !(check_~tmp___10~0 > -2); 192016#L346-1 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; 192017#L151-9 assume 3 == read_history_int8_~history_id; 191718#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 191719#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 191901#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 191902#L366-1 check_#res := 1; 192849#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 192847#L575-72 assume !(0 == assert_~arg % 256); 192845#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 192843#L550-2 assume !!(main_~i2~0 < 10);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;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; 192841#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 192838#L570-16 assume 0 != ~gate1Failed~0 % 256; 192836#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 192834#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; 192832#L409 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;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; 192830#L226-2 assume !(0 == write_history_bool_~history_id); 192827#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 192825#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 192822#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 192820#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 192818#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 192816#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; 192814#L440 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;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; 192812#L226-4 assume !(0 == write_history_bool_~history_id); 192810#L231-4 assume !(1 == write_history_bool_~history_id); 192808#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 192805#L570-18 assume 0 != ~gate3Failed~0 % 256; 192806#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 192945#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; 192942#L471 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; 192940#L486 assume !(~VALUE1~0 == ~VALUE2~0); 192938#L493 assume !(~VALUE1~0 == ~VALUE3~0); 192936#L500 assume !(~VALUE1~0 != ~nomsg~0); 192934#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 192929#L570-19 [2018-11-28 13:18:16,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1614313294, now seen corresponding path program 1 times [2018-11-28 13:18:16,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:16,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:16,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:16,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-28 13:18:16,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:16,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:16,165 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:18:16,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash 828297667, now seen corresponding path program 1 times [2018-11-28 13:18:16,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:16,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:16,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:16,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:18:16,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:18:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:16,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:16,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:18:16,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2018-11-28 13:18:16,587 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:18:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 13:18:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2018-11-28 13:18:16,587 INFO L87 Difference]: Start difference. First operand 1409 states and 1686 transitions. cyclomatic complexity: 288 Second operand 32 states. [2018-11-28 13:18:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:17,834 INFO L93 Difference]: Finished difference Result 1946 states and 2311 transitions. [2018-11-28 13:18:17,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 13:18:17,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1946 states and 2311 transitions. [2018-11-28 13:18:17,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-28 13:18:17,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1946 states to 1140 states and 1350 transitions. [2018-11-28 13:18:17,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2018-11-28 13:18:17,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 563 [2018-11-28 13:18:17,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1140 states and 1350 transitions. [2018-11-28 13:18:17,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:18:17,844 INFO L705 BuchiCegarLoop]: Abstraction has 1140 states and 1350 transitions. [2018-11-28 13:18:17,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states and 1350 transitions. [2018-11-28 13:18:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1102. [2018-11-28 13:18:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2018-11-28 13:18:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1306 transitions. [2018-11-28 13:18:17,852 INFO L728 BuchiCegarLoop]: Abstraction has 1102 states and 1306 transitions. [2018-11-28 13:18:17,852 INFO L608 BuchiCegarLoop]: Abstraction has 1102 states and 1306 transitions. [2018-11-28 13:18:17,852 INFO L442 BuchiCegarLoop]: ======== Iteration 39============ [2018-11-28 13:18:17,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1102 states and 1306 transitions. [2018-11-28 13:18:17,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 [2018-11-28 13:18:17,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:18:17,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:18:17,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-11-28 13:18:17,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:18:17,857 INFO L794 eck$LassoCheckResult]: Stem: 195656#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 195406#L-1 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;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;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; 195407#L116-2 assume !!(add_history_type_~var~0 < 3); 195461#L117 assume 0 == add_history_type_~history_id;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; 195462#L171 assume 0 == read_history_bool_~history_id; 195463#L172 assume !(0 == read_history_bool_~historyIndex); 195465#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 196322#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 196320#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 196318#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 196316#L116-2 assume !!(add_history_type_~var~0 < 3); 196314#L117 assume 0 == add_history_type_~history_id;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; 196312#L171 assume 0 == read_history_bool_~history_id; 196295#L172 assume !(0 == read_history_bool_~historyIndex); 195372#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 195373#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 195587#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 195588#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195551#L116-2 assume !!(add_history_type_~var~0 < 3); 195552#L117 assume 0 == add_history_type_~history_id;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; 196324#L171 assume 0 == read_history_bool_~history_id; 196277#L172 assume !(0 == read_history_bool_~historyIndex); 196278#L175 assume !(1 == read_history_bool_~historyIndex);read_history_bool_#res := ~gate1Failed_History_2~0; 196425#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 196424#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 195597#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195598#L116-2 assume !(add_history_type_~var~0 < 3); 195545#L116-3 add_history_type_#res := 1; 195546#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 195408#L255 assume !(0 == init_~tmp~1);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; 195409#L116-6 assume !!(add_history_type_~var~0 < 3); 195404#L117-2 assume !(0 == add_history_type_~history_id); 195405#L123-2 assume 1 == add_history_type_~history_id;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; 195549#L171-4 assume !(0 == read_history_bool_~history_id); 195550#L181-4 assume 1 == read_history_bool_~history_id; 195553#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 195554#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 195449#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 195450#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195595#L116-6 assume !!(add_history_type_~var~0 < 3); 195596#L117-2 assume !(0 == add_history_type_~history_id); 196099#L123-2 assume 1 == add_history_type_~history_id;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; 196098#L171-4 assume !(0 == read_history_bool_~history_id); 196096#L181-4 assume 1 == read_history_bool_~history_id; 196093#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 196088#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 196086#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 196084#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 196082#L116-6 assume !!(add_history_type_~var~0 < 3); 195700#L117-2 assume !(0 == add_history_type_~history_id); 196079#L123-2 assume 1 == add_history_type_~history_id;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; 196077#L171-4 assume !(0 == read_history_bool_~history_id); 195775#L181-4 assume 1 == read_history_bool_~history_id; 195772#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 195711#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 195707#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 195702#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195699#L116-6 assume !(add_history_type_~var~0 < 3); 195589#L116-7 add_history_type_#res := 1; 195590#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 195614#L259 assume !(0 == init_~tmp___0~1);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; 195577#L116-10 assume !!(add_history_type_~var~0 < 3); 195394#L117-4 assume !(0 == add_history_type_~history_id); 195395#L123-4 assume !(1 == add_history_type_~history_id); 195645#L129-4 assume 2 == add_history_type_~history_id;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; 195593#L171-8 assume !(0 == read_history_bool_~history_id); 195594#L181-8 assume !(1 == read_history_bool_~history_id); 195468#L191-8 assume 2 == read_history_bool_~history_id; 195469#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 195628#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 195429#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 195430#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195578#L116-10 assume !!(add_history_type_~var~0 < 3); 195396#L117-4 assume !(0 == add_history_type_~history_id); 195397#L123-4 assume !(1 == add_history_type_~history_id); 196115#L129-4 assume 2 == add_history_type_~history_id;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; 196113#L171-8 assume !(0 == read_history_bool_~history_id); 196111#L181-8 assume !(1 == read_history_bool_~history_id); 196109#L191-8 assume 2 == read_history_bool_~history_id; 196105#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 196103#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 196102#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 195769#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195709#L116-10 assume !!(add_history_type_~var~0 < 3); 195704#L117-4 assume !(0 == add_history_type_~history_id); 195695#L123-4 assume !(1 == add_history_type_~history_id); 195644#L129-4 assume 2 == add_history_type_~history_id;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; 195591#L171-8 assume !(0 == read_history_bool_~history_id); 195592#L181-8 assume !(1 == read_history_bool_~history_id); 195466#L191-8 assume 2 == read_history_bool_~history_id; 195467#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 195626#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 195427#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 195428#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195607#L116-10 assume !(add_history_type_~var~0 < 3); 195513#L116-11 add_history_type_#res := 1; 195514#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 195398#L263 assume !(0 == init_~tmp___1~1);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; 195399#L116-14 assume !!(add_history_type_~var~0 < 3); 195374#L117-6 assume !(0 == add_history_type_~history_id); 195375#L123-6 assume !(1 == add_history_type_~history_id); 195785#L129-6 assume !(2 == add_history_type_~history_id); 195783#L135-9 assume 3 == add_history_type_~history_id;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; 195781#L151-3 assume 3 == read_history_int8_~history_id; 195779#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 195777#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 195669#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 195548#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195485#L116-14 assume !!(add_history_type_~var~0 < 3); 195376#L117-6 assume !(0 == add_history_type_~history_id); 195377#L123-6 assume !(1 == add_history_type_~history_id); 195630#L129-6 assume !(2 == add_history_type_~history_id); 195631#L135-9 assume 3 == add_history_type_~history_id;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; 196143#L151-3 assume 3 == read_history_int8_~history_id; 196141#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 196139#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 196137#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 196135#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 196133#L116-14 assume !!(add_history_type_~var~0 < 3); 195701#L117-6 assume !(0 == add_history_type_~history_id); 195694#L123-6 assume !(1 == add_history_type_~history_id); 195629#L129-6 assume !(2 == add_history_type_~history_id); 195564#L135-9 assume 3 == add_history_type_~history_id;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; 195565#L151-3 assume 3 == read_history_int8_~history_id; 195579#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 195580#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 195583#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 195547#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 195484#L116-14 assume !(add_history_type_~var~0 < 3); 195482#L116-15 add_history_type_#res := 1; 195483#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 196114#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 196112#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 196110#L550-2 assume !!(main_~i2~0 < 10);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;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; 195908#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 195906#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 195671#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 195615#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 195543#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; 195544#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; 195378#L409 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;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; 195379#L226-2 assume !(0 == write_history_bool_~history_id); 195608#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 195519#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 195520#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 195541#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 195445#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 195446#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; 195455#L440 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;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; 195560#L226-4 assume !(0 == write_history_bool_~history_id); 195561#L231-4 assume !(1 == write_history_bool_~history_id); 195664#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 195523#L570-18 assume 0 != ~gate3Failed~0 % 256; 195525#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 196415#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; 196414#L471 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; 196413#L486 assume ~VALUE1~0 == ~VALUE2~0; 196412#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 196411#L570-19 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; 196409#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 195533#L570-20 ~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;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; 195534#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 195652#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 196408#L171-12 assume 0 == read_history_bool_~history_id; 196407#L172-12 assume !(0 == read_history_bool_~historyIndex); 196405#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 195676#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 195677#L307 assume !(0 == check_~tmp___3~0 % 256); 195768#L307-1 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; 195766#L151-7 assume 3 == read_history_int8_~history_id; 195765#L152-7 assume !(0 == read_history_int8_~historyIndex); 195763#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 195762#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 195761#L346 assume !(check_~tmp___10~0 > -2); 195760#L346-1 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; 195758#L151-9 assume 3 == read_history_int8_~history_id; 195756#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 195754#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 195752#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 195750#L366-1 check_#res := 1; 195748#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 195747#L575-72 assume !(0 == assert_~arg % 256); 195745#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 195743#L550-2 assume !!(main_~i2~0 < 10);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;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; 195741#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 195739#L570-16 assume 0 != ~gate1Failed~0 % 256; 195736#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 195737#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; 196020#L409 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;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; 196018#L226-2 assume !(0 == write_history_bool_~history_id); 196014#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 196012#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 196010#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 196008#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 196006#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 196004#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; 196002#L440 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;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; 196000#L226-4 assume !(0 == write_history_bool_~history_id); 195998#L231-4 assume !(1 == write_history_bool_~history_id); 195996#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 195994#L570-18 assume 0 != ~gate3Failed~0 % 256; 195439#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 195386#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; 195387#L471 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; 195433#L486 assume !(~VALUE1~0 == ~VALUE2~0); 195434#L493 assume !(~VALUE1~0 == ~VALUE3~0); 195692#L500 assume !(~VALUE1~0 != ~nomsg~0); 195686#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 195680#L570-19 [2018-11-28 13:18:17,857 INFO L796 eck$LassoCheckResult]: Loop: 195680#L570-19 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; 195885#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 195883#L570-20 ~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;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; 195881#L294 assume !(0 == ~gate1Failed~0 % 256); 195873#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 195874#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 196468#L171-12 assume 0 == read_history_bool_~history_id; 196467#L172-12 assume !(0 == read_history_bool_~historyIndex); 196466#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 196465#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 196066#L307 assume !(0 == check_~tmp___3~0 % 256); 195423#L307-1 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; 195424#L151-7 assume 3 == read_history_int8_~history_id; 195486#L152-7 assume !(0 == read_history_int8_~historyIndex); 195457#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 195458#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 195488#L346 assume !(check_~tmp___10~0 > -2); 195683#L346-1 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; 195666#L151-9 assume 3 == read_history_int8_~history_id; 195476#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 195477#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 195480#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 195620#L366-1 check_#res := 1; 195537#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 195538#L575-72 assume !(0 == assert_~arg % 256); 195451#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 195452#L550-2 assume !!(main_~i2~0 < 10);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;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; 195612#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 195568#L570-16 assume 0 != ~gate1Failed~0 % 256; 195569#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 195610#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; 195616#L409 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;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; 196384#L226-2 assume !(0 == write_history_bool_~history_id); 196382#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 196381#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 196380#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 196379#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 196378#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 196377#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; 196376#L440 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;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; 196375#L226-4 assume !(0 == write_history_bool_~history_id); 196374#L231-4 assume !(1 == write_history_bool_~history_id); 196373#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 196372#L570-18 assume !(0 != ~gate3Failed~0 % 256);gate3_each_pals_period_~tmp~5 := gate3_each_pals_period_#t~nondet37;havoc gate3_each_pals_period_#t~nondet37;gate3_each_pals_period_~next_state~2 := gate3_each_pals_period_~tmp~5; 195507#L458 assume 0 == gate3_each_pals_period_~next_state~2;gate3_each_pals_period_~tmp___0~5 := 1; 195382#L464-2 assume 0 != (if 0 == gate3_each_pals_period_~tmp___0~5 then 0 else 1) % 256; 195383#L470 assume gate3_each_pals_period_~next_state~2 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0;gate3_each_pals_period_#t~ite38 := gate3_each_pals_period_~next_state~2; 195672#L470-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite38 % 256 <= 127 then gate3_each_pals_period_#t~ite38 % 256 else gate3_each_pals_period_#t~ite38 % 256 - 256);havoc gate3_each_pals_period_#t~ite38; 195673#L471 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; 196357#L486 assume ~VALUE1~0 == ~VALUE2~0; 195945#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 196354#L570-19 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; 196352#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 196350#L570-20 ~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;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; 196348#L294 assume !(0 == ~gate1Failed~0 % 256); 196346#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 195655#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 195575#L171-12 assume 0 == read_history_bool_~history_id; 195414#L172-12 assume !(0 == read_history_bool_~historyIndex); 195415#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 195696#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 195418#L307 assume !(0 == check_~tmp___3~0 % 256); 195419#L307-1 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; 196021#L151-7 assume 3 == read_history_int8_~history_id; 196019#L152-7 assume !(0 == read_history_int8_~historyIndex); 196017#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 196016#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 196013#L346 assume !(check_~tmp___10~0 > -2); 196011#L346-1 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; 196009#L151-9 assume 3 == read_history_int8_~history_id; 196007#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 196005#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 196003#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 196001#L366-1 check_#res := 1; 195999#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 195997#L575-72 assume !(0 == assert_~arg % 256); 195995#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 195993#L550-2 assume !!(main_~i2~0 < 10);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;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; 195992#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 195991#L570-16 assume 0 != ~gate1Failed~0 % 256; 195987#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 195985#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; 195983#L409 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;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; 195981#L226-2 assume !(0 == write_history_bool_~history_id); 195977#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 195975#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 195973#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 195972#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 195971#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 195970#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; 195969#L440 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;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; 195968#L226-4 assume !(0 == write_history_bool_~history_id); 195967#L231-4 assume !(1 == write_history_bool_~history_id); 195966#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 195964#L570-18 assume 0 != ~gate3Failed~0 % 256; 195965#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 196428#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; 196427#L471 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; 196426#L486 assume !(~VALUE1~0 == ~VALUE2~0); 195603#L493 assume !(~VALUE1~0 == ~VALUE3~0); 195604#L500 assume !(~VALUE1~0 != ~nomsg~0); 196430#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 195680#L570-19 [2018-11-28 13:18:17,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1614313294, now seen corresponding path program 2 times [2018-11-28 13:18:17,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:17,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:17,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:17,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-28 13:18:17,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:17,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:17,899 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:18:17,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1286971995, now seen corresponding path program 1 times [2018-11-28 13:18:17,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:17,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:17,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:18:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:18:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:18:19,810 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 503 DAG size of output: 419 [2018-11-28 13:18:19,811 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 13:18:21,959 WARN L180 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 169 [2018-11-28 13:18:21,960 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:18:21,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:18:21,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:18:21,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:18:21,961 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:18:21,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:21,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:18:21,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:18:21,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration39_Loop [2018-11-28 13:18:21,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:18:21,961 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:18:21,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:21,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:21,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-28 13:18:21,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-28 13:18:21,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-28 13:18:21,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-28 13:18:21,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-28 13:18:21,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:21,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:21,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:21,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:21,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-28 13:18:21,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:21,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:21,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-28 13:18:21,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,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-28 13:18:22,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,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-28 13:18:22,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,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-28 13:18:22,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,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-28 13:18:22,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:22,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-28 13:18:22,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-28 13:18:22,437 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2018-11-28 13:18:22,838 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:18:22,838 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 301 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 301 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:22,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:22,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:22,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:22,855 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_35=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_35=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 302 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 302 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:22,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:22,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:22,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:22,881 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___9~0=0} Honda state: {ULTIMATE.start_check_~tmp___9~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 303 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 303 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:22,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:22,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:22,898 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:22,898 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 304 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 304 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:22,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:22,913 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:22,915 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:22,915 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 305 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 305 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:22,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:22,931 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:22,933 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:22,933 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 306 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 306 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:22,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:22,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:22,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:22,949 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_35=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_35=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 307 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 307 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:22,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:22,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:22,984 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:22,984 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_35=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 308 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 308 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:22,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:22,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:22,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:22,988 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 309 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 309 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,011 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,011 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post15=0} Honda state: {ULTIMATE.start_check_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 310 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 310 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,032 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,032 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,034 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,034 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 311 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 311 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,052 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,074 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,074 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_35=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_35=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 312 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 312 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,082 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,082 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~ite28=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~ite28=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 313 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 313 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,105 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,114 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate1Failed_History_1~0=128} Honda state: {~gate1Failed_History_1~0=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 314 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 314 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,137 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,137 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 315 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 315 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,154 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,154 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 316 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 316 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,177 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,177 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 317 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 317 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,193 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_#in~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_#in~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 318 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 318 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,209 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,209 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 319 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 319 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,232 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 320 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 320 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,249 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,249 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 321 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 321 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,265 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,265 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___8~0=0} Honda state: {ULTIMATE.start_check_~tmp___8~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 322 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 322 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,281 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,281 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 323 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 323 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp___0~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 324 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 324 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,320 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,320 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 325 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 325 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,337 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 326 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 326 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,360 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,360 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 327 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 327 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,377 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,377 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 328 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 328 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,393 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,393 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 329 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 329 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,443 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,443 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_35=3} Honda state: {v_rep#funAddr~voter.offset_35=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 330 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 330 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,446 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,448 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,448 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 331 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 331 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,464 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 332 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 332 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,481 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,481 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 333 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 333 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,498 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 334 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 334 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,512 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,514 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 335 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 335 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,528 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,530 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,530 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret10=0} Honda state: {ULTIMATE.start_check_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 336 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 336 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,544 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,546 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,546 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 337 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 337 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,561 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:23,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:23,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed_History_1~0=-256} Honda state: {~gate2Failed_History_1~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 338 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 338 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:23,589 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 339 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 339 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:23,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:18:23,637 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:35,819 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 13:18:35,834 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:18:35,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:18:35,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:18:35,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:18:35,834 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:18:35,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:35,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:18:35,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:18:35,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration39_Loop [2018-11-28 13:18:35,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:18:35,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:35,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-28 13:18:36,304 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2018-11-28 13:18:36,685 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:18:36,685 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:18:36,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:36,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:36,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:36,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:36,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:36,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:36,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:36,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:36,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:36,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:36,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:36,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:36,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:36,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:36,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:36,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:36,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:36,711 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:18:36,716 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:18:36,716 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 13:18:36,716 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:18:36,716 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:18:36,716 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:18:36,716 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_voter_~voted_value~0) = -1*ULTIMATE.start_voter_~voted_value~0 Supporting invariants [] [2018-11-28 13:18:36,717 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:18:36,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:36,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:36,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:37,021 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2018-11-28 13:18:37,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1102 states and 1306 transitions. cyclomatic complexity: 214 Second operand 18 states. [2018-11-28 13:18:37,814 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1102 states and 1306 transitions. cyclomatic complexity: 214. Second operand 18 states. Result 2710 states and 3200 transitions. Complement of second has 44 states. [2018-11-28 13:18:37,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2018-11-28 13:18:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 13:18:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 643 transitions. [2018-11-28 13:18:37,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 643 transitions. Stem has 208 letters. Loop has 102 letters. [2018-11-28 13:18:37,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:37,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 643 transitions. Stem has 310 letters. Loop has 102 letters. [2018-11-28 13:18:37,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:37,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 643 transitions. Stem has 208 letters. Loop has 204 letters. [2018-11-28 13:18:37,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:37,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2710 states and 3200 transitions. [2018-11-28 13:18:37,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 [2018-11-28 13:18:37,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2710 states to 2086 states and 2468 transitions. [2018-11-28 13:18:37,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1216 [2018-11-28 13:18:37,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1218 [2018-11-28 13:18:37,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2086 states and 2468 transitions. [2018-11-28 13:18:37,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:18:37,824 INFO L705 BuchiCegarLoop]: Abstraction has 2086 states and 2468 transitions. [2018-11-28 13:18:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states and 2468 transitions. [2018-11-28 13:18:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1620. [2018-11-28 13:18:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1620 states. [2018-11-28 13:18:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1923 transitions. [2018-11-28 13:18:37,832 INFO L728 BuchiCegarLoop]: Abstraction has 1620 states and 1923 transitions. [2018-11-28 13:18:37,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:18:37,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:18:37,832 INFO L87 Difference]: Start difference. First operand 1620 states and 1923 transitions. Second operand 3 states. [2018-11-28 13:18:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:37,846 INFO L93 Difference]: Finished difference Result 1412 states and 1651 transitions. [2018-11-28 13:18:37,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:18:37,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1412 states and 1651 transitions. [2018-11-28 13:18:37,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 [2018-11-28 13:18:37,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1412 states to 1412 states and 1651 transitions. [2018-11-28 13:18:37,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-28 13:18:37,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-28 13:18:37,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1412 states and 1651 transitions. [2018-11-28 13:18:37,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:18:37,850 INFO L705 BuchiCegarLoop]: Abstraction has 1412 states and 1651 transitions. [2018-11-28 13:18:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states and 1651 transitions. [2018-11-28 13:18:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2018-11-28 13:18:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-11-28 13:18:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1651 transitions. [2018-11-28 13:18:37,858 INFO L728 BuchiCegarLoop]: Abstraction has 1412 states and 1651 transitions. [2018-11-28 13:18:37,858 INFO L608 BuchiCegarLoop]: Abstraction has 1412 states and 1651 transitions. [2018-11-28 13:18:37,858 INFO L442 BuchiCegarLoop]: ======== Iteration 40============ [2018-11-28 13:18:37,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1412 states and 1651 transitions. [2018-11-28 13:18:37,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 [2018-11-28 13:18:37,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:18:37,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:18:37,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-28 13:18:37,862 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-28 13:18:37,862 INFO L794 eck$LassoCheckResult]: Stem: 203553#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 203287#L-1 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;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;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; 203288#L116-2 assume !!(add_history_type_~var~0 < 3); 203435#L117 assume 0 == add_history_type_~history_id;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; 203490#L171 assume 0 == read_history_bool_~history_id; 203491#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 203593#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 203594#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 203479#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203436#L116-2 assume !!(add_history_type_~var~0 < 3); 203345#L117 assume 0 == add_history_type_~history_id;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; 203346#L171 assume 0 == read_history_bool_~history_id; 203347#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 203348#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 203469#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 203470#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203645#L116-2 assume !!(add_history_type_~var~0 < 3); 203630#L117 assume 0 == add_history_type_~history_id;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; 203642#L171 assume 0 == read_history_bool_~history_id; 203640#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 203638#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 203635#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 203634#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203629#L116-2 assume !(add_history_type_~var~0 < 3); 203429#L116-3 add_history_type_#res := 1; 203430#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 203289#L255 assume !(0 == init_~tmp~1);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; 203290#L116-6 assume !!(add_history_type_~var~0 < 3); 203285#L117-2 assume !(0 == add_history_type_~history_id); 203286#L123-2 assume 1 == add_history_type_~history_id;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; 203433#L171-4 assume !(0 == read_history_bool_~history_id); 203434#L181-4 assume 1 == read_history_bool_~history_id; 203565#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 203641#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 203639#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 203637#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203477#L116-6 assume !!(add_history_type_~var~0 < 3); 203478#L117-2 assume !(0 == add_history_type_~history_id); 203599#L123-2 assume 1 == add_history_type_~history_id;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; 203600#L171-4 assume !(0 == read_history_bool_~history_id); 203644#L181-4 assume 1 == read_history_bool_~history_id; 203437#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 203438#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 203332#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 203333#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203497#L116-6 assume !!(add_history_type_~var~0 < 3); 203602#L117-2 assume !(0 == add_history_type_~history_id); 203627#L123-2 assume 1 == add_history_type_~history_id;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; 203624#L171-4 assume !(0 == read_history_bool_~history_id); 203621#L181-4 assume 1 == read_history_bool_~history_id; 203617#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 203613#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 203610#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 203607#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203601#L116-6 assume !(add_history_type_~var~0 < 3); 203471#L116-7 add_history_type_#res := 1; 203472#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 203498#L259 assume !(0 == init_~tmp___0~1);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; 203499#L116-10 assume !!(add_history_type_~var~0 < 3); 203275#L117-4 assume !(0 == add_history_type_~history_id); 203276#L123-4 assume !(1 == add_history_type_~history_id); 203636#L129-4 assume 2 == add_history_type_~history_id;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; 203475#L171-8 assume !(0 == read_history_bool_~history_id); 203476#L181-8 assume !(1 == read_history_bool_~history_id); 203351#L191-8 assume 2 == read_history_bool_~history_id; 203352#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 203577#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 203309#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 203310#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203460#L116-10 assume !!(add_history_type_~var~0 < 3); 203277#L117-4 assume !(0 == add_history_type_~history_id); 203278#L123-4 assume !(1 == add_history_type_~history_id); 203535#L129-4 assume 2 == add_history_type_~history_id;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; 203536#L171-8 assume !(0 == read_history_bool_~history_id); 203626#L181-8 assume !(1 == read_history_bool_~history_id); 203623#L191-8 assume 2 == read_history_bool_~history_id; 203619#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 203615#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 203612#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 203609#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203606#L116-10 assume !!(add_history_type_~var~0 < 3); 203604#L117-4 assume !(0 == add_history_type_~history_id); 203595#L123-4 assume !(1 == add_history_type_~history_id); 203534#L129-4 assume 2 == add_history_type_~history_id;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; 203473#L171-8 assume !(0 == read_history_bool_~history_id); 203474#L181-8 assume !(1 == read_history_bool_~history_id); 203349#L191-8 assume 2 == read_history_bool_~history_id; 203350#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 203576#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 203307#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 203308#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203459#L116-10 assume !(add_history_type_~var~0 < 3); 203398#L116-11 add_history_type_#res := 1; 203399#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 203279#L263 assume !(0 == init_~tmp___1~1);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; 203280#L116-14 assume !!(add_history_type_~var~0 < 3); 203255#L117-6 assume !(0 == add_history_type_~history_id); 203256#L123-6 assume !(1 == add_history_type_~history_id); 203513#L129-6 assume !(2 == add_history_type_~history_id); 203449#L135-9 assume 3 == add_history_type_~history_id;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; 203450#L151-3 assume 3 == read_history_int8_~history_id; 203463#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203464#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 203466#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 203432#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203368#L116-14 assume !!(add_history_type_~var~0 < 3); 203257#L117-6 assume !(0 == add_history_type_~history_id); 203258#L123-6 assume !(1 == add_history_type_~history_id); 203628#L129-6 assume !(2 == add_history_type_~history_id); 203625#L135-9 assume 3 == add_history_type_~history_id;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; 203622#L151-3 assume 3 == read_history_int8_~history_id; 203618#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203614#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 203611#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 203608#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203605#L116-14 assume !!(add_history_type_~var~0 < 3); 203603#L117-6 assume !(0 == add_history_type_~history_id); 203592#L123-6 assume !(1 == add_history_type_~history_id); 203512#L129-6 assume !(2 == add_history_type_~history_id); 203447#L135-9 assume 3 == add_history_type_~history_id;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; 203448#L151-3 assume 3 == read_history_int8_~history_id; 203461#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203462#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 203465#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 203431#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 203367#L116-14 assume !(add_history_type_~var~0 < 3); 203365#L116-15 add_history_type_#res := 1; 203366#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 203554#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 203503#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 203504#L550-2 assume !!(main_~i2~0 < 10);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;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; 203632#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 203631#L570-16 assume !(0 != ~gate1Failed~0 % 256);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; 203567#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 203500#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 203427#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; 203428#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; 203439#L409 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;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; 203867#L226-2 assume !(0 == write_history_bool_~history_id); 203847#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 203845#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 203843#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 203838#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 203804#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 203800#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; 203797#L440 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;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; 203794#L226-4 assume !(0 == write_history_bool_~history_id); 203791#L231-4 assume !(1 == write_history_bool_~history_id); 203788#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 203784#L570-18 assume 0 != ~gate3Failed~0 % 256; 203783#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 203780#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; 203781#L471 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; 203856#L486 assume ~VALUE1~0 == ~VALUE2~0; 203772#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 203773#L570-19 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; 203768#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 203766#L570-20 ~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;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; 203763#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 203759#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 203757#L171-12 assume 0 == read_history_bool_~history_id; 203755#L172-12 assume !(0 == read_history_bool_~historyIndex); 203753#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 203751#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 203749#L307 assume 0 == check_~tmp___3~0 % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 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; 203748#L171-13 assume !(0 == read_history_bool_~history_id); 203746#L181-13 assume 1 == read_history_bool_~history_id; 203744#L182-13 assume !(0 == read_history_bool_~historyIndex); 203738#L185-13 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_1~0; 203732#L203-13 check_#t~ret10 := read_history_bool_#res;check_~tmp___4~0 := check_#t~ret10;havoc check_#t~ret10; 203719#L309 assume !(0 == check_~tmp___4~0 % 256); 203717#L307-1 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; 203715#L151-7 assume 3 == read_history_int8_~history_id; 203713#L152-7 assume !(0 == read_history_int8_~historyIndex); 203711#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 203709#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 203707#L346 assume !(check_~tmp___10~0 > -2); 203705#L346-1 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; 203703#L151-9 assume 3 == read_history_int8_~history_id; 203701#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 203699#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 203697#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 203694#L366-1 check_#res := 1; 203692#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 203690#L575-72 assume !(0 == assert_~arg % 256); 203688#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 203686#L550-2 assume !!(main_~i2~0 < 10);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;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; 203684#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 203682#L570-16 assume 0 != ~gate1Failed~0 % 256; 203679#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 203680#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; 204185#L409 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;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; 204182#L226-2 assume !(0 == write_history_bool_~history_id); 204176#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 204171#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 204166#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 204162#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 204159#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 204154#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; 204149#L440 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;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; 204144#L226-4 assume !(0 == write_history_bool_~history_id); 204141#L231-4 assume !(1 == write_history_bool_~history_id); 204138#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 204133#L570-18 assume 0 != ~gate3Failed~0 % 256; 204134#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 204332#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; 204331#L471 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; 204330#L486 assume !(~VALUE1~0 == ~VALUE2~0); 203484#L493 assume !(~VALUE1~0 == ~VALUE3~0); 203485#L500 assume !(~VALUE1~0 != ~nomsg~0); 203583#L503 assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 203584#L570-19 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; 204315#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 204562#L570-20 ~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;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; 204560#L294 assume !(0 == ~gate1Failed~0 % 256); 204558#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 204556#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 204554#L171-12 assume 0 == read_history_bool_~history_id; 204552#L172-12 assume !(0 == read_history_bool_~historyIndex); 204550#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 204548#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 204512#L307 assume !(0 == check_~tmp___3~0 % 256); 204510#L307-1 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; 204509#L151-7 assume 3 == read_history_int8_~history_id; 204508#L152-7 assume !(0 == read_history_int8_~historyIndex); 204507#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 204506#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 204505#L346 assume !(check_~tmp___10~0 > -2); 204504#L346-1 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; 204503#L151-9 assume 3 == read_history_int8_~history_id; 204502#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 204501#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 204500#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 204499#L366-1 check_#res := 1; 204498#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 204497#L575-72 assume !(0 == assert_~arg % 256); 204496#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 204495#L550-2 assume !!(main_~i2~0 < 10);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;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; 204494#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 204493#L570-16 assume 0 != ~gate1Failed~0 % 256; 204492#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 204491#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; 204490#L409 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;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; 204489#L226-2 assume !(0 == write_history_bool_~history_id); 204487#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 204486#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 204485#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 204484#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 204483#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 204482#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; 204481#L440 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;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; 204480#L226-4 assume !(0 == write_history_bool_~history_id); 204479#L231-4 assume !(1 == write_history_bool_~history_id); 204346#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 204343#L570-18 assume 0 != ~gate3Failed~0 % 256; 204345#L453 [2018-11-28 13:18:38,382 INFO L796 eck$LassoCheckResult]: Loop: 204345#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 203267#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; 203268#L471 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; 204666#L486 assume ~VALUE1~0 == ~VALUE2~0; 204613#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 204665#L570-19 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; 204664#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 204663#L570-20 ~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;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; 204662#L294 assume !(0 == ~gate1Failed~0 % 256); 204658#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 204657#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 204656#L171-12 assume 0 == read_history_bool_~history_id; 204655#L172-12 assume !(0 == read_history_bool_~historyIndex); 204654#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 204376#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 204366#L307 assume !(0 == check_~tmp___3~0 % 256); 204363#L307-1 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; 203511#L151-7 assume 3 == read_history_int8_~history_id; 203369#L152-7 assume !(0 == read_history_int8_~historyIndex); 203341#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 203342#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 203597#L346 assume !(check_~tmp___10~0 > -2); 203598#L346-1 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; 203560#L151-9 assume 3 == read_history_int8_~history_id; 203561#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 204360#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 203506#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 203507#L366-1 check_#res := 1; 203421#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 203422#L575-72 assume !(0 == assert_~arg % 256); 203587#L570-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 203563#L550-2 assume !!(main_~i2~0 < 10);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;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; 203564#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 204358#L570-16 assume 0 != ~gate1Failed~0 % 256; 203492#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 203493#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; 203259#L409 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;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; 203260#L226-2 assume !(0 == write_history_bool_~history_id); 203488#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 203404#L570-17 assume !(0 != ~gate2Failed~0 % 256);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; 203405#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 203425#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 203328#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 203329#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; 204350#L440 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;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; 204349#L226-4 assume !(0 == write_history_bool_~history_id); 204347#L231-4 assume !(1 == write_history_bool_~history_id); 204348#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 204476#L570-18 assume 0 != ~gate3Failed~0 % 256; 204345#L453 [2018-11-28 13:18:38,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:38,850 INFO L82 PathProgramCache]: Analyzing trace with hash -834366997, now seen corresponding path program 1 times [2018-11-28 13:18:38,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:38,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:38,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-28 13:18:38,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:38,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:18:38,920 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:18:38,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash -828883181, now seen corresponding path program 5 times [2018-11-28 13:18:38,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:38,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:38,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:18:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:18:39,477 WARN L180 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 226 [2018-11-28 13:18:40,991 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 193 DAG size of output: 174 [2018-11-28 13:18:40,992 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:18:40,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:18:40,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:18:40,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:18:40,993 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:18:40,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:40,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:18:40,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:18:40,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration40_Loop [2018-11-28 13:18:40,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:18:40,993 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,150 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-11-28 13:18:41,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-28 13:18:41,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:41,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-28 13:18:41,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-28 13:18:41,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-28 13:18:41,429 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-28 13:18:43,350 WARN L180 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 153 DAG size of output: 127 [2018-11-28 13:18:43,454 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:18:43,455 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 340 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 340 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,459 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,459 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_37=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_37=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 341 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 341 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,475 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,476 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 342 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 342 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,490 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,490 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,499 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,499 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Honda state: {~gate2Failed~0=-256, ~gate2Failed_History_1~0=-256, ~gate2Failed_History_0~0=-256, ~gate2Failed_History_2~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 343 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 343 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,515 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,515 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___9~0=0} Honda state: {ULTIMATE.start_check_~tmp___9~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 344 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 344 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,531 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,531 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post15=0} Honda state: {ULTIMATE.start_check_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 345 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 345 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,560 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_37=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 346 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 346 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,565 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,567 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 347 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 347 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,590 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,590 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_37=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_37=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 348 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 348 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:43,607 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:18:43,607 INFO L448 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_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 349 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 349 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:18:43,628 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec27db1-cfa0-479a-aac7-0a5127e2babf/bin-2019/uautomizer/z3 Starting monitored process 350 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 350 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:43,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:18:43,780 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:18:55,982 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 13:18:56,004 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:18:56,004 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:18:56,004 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:18:56,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:18:56,004 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:18:56,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:18:56,005 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:18:56,005 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:18:56,005 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration40_Loop [2018-11-28 13:18:56,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:18:56,005 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:18:56,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-28 13:18:56,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,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-28 13:18:56,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,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-28 13:18:56,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-28 13:18:56,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,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-28 13:18:56,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-28 13:18:56,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,238 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-11-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,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-28 13:18:56,628 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-28 13:18:58,470 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 153 DAG size of output: 127 [2018-11-28 13:18:58,485 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:18:58,486 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:18:58,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-28 13:18:58,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:58,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:58,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:58,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:58,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:18:58,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:18:58,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,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-28 13:18:58,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:18:58,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:18:58,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:18:58,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:18:58,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:18:58,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:18:58,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:18:58,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:18:58,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:18:58,512 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:18:58,513 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:18:58,513 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:18:58,513 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:18:58,513 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:18:58,513 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:18:58,513 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 13:18:58,513 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 13:18:58,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:58,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:58,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:58,803 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-28 13:18:58,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1412 states and 1651 transitions. cyclomatic complexity: 246 Second operand 5 states. [2018-11-28 13:18:59,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1412 states and 1651 transitions. cyclomatic complexity: 246. Second operand 5 states. Result 4039 states and 4773 transitions. Complement of second has 6 states. [2018-11-28 13:18:59,042 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-28 13:18:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:18:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2018-11-28 13:18:59,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 295 transitions. Stem has 255 letters. Loop has 49 letters. [2018-11-28 13:18:59,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:59,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 295 transitions. Stem has 304 letters. Loop has 49 letters. [2018-11-28 13:18:59,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:59,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 295 transitions. Stem has 255 letters. Loop has 98 letters. [2018-11-28 13:18:59,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:18:59,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4039 states and 4773 transitions. [2018-11-28 13:18:59,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2018-11-28 13:18:59,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4039 states to 1030 states and 1201 transitions. [2018-11-28 13:18:59,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2018-11-28 13:18:59,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2018-11-28 13:18:59,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1030 states and 1201 transitions. [2018-11-28 13:18:59,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:18:59,055 INFO L705 BuchiCegarLoop]: Abstraction has 1030 states and 1201 transitions. [2018-11-28 13:18:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states and 1201 transitions. [2018-11-28 13:18:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2018-11-28 13:18:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2018-11-28 13:18:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1201 transitions. [2018-11-28 13:18:59,064 INFO L728 BuchiCegarLoop]: Abstraction has 1030 states and 1201 transitions. [2018-11-28 13:18:59,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:18:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:59,064 INFO L87 Difference]: Start difference. First operand 1030 states and 1201 transitions. Second operand 9 states. [2018-11-28 13:18:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:59,501 INFO L93 Difference]: Finished difference Result 508 states and 574 transitions. [2018-11-28 13:18:59,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:18:59,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 574 transitions. [2018-11-28 13:18:59,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:18:59,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 0 states and 0 transitions. [2018-11-28 13:18:59,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:18:59,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:18:59,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:18:59,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:18:59,502 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:18:59,502 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:18:59,502 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:18:59,502 INFO L442 BuchiCegarLoop]: ======== Iteration 41============ [2018-11-28 13:18:59,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:18:59,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:18:59,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:18:59,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:18:59 BoogieIcfgContainer [2018-11-28 13:18:59,507 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:18:59,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:18:59,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:18:59,507 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:18:59,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:13:36" (3/4) ... [2018-11-28 13:18:59,509 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:18:59,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:18:59,510 INFO L168 Benchmark]: Toolchain (without parser) took 324543.98 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.5 MB). Free memory was 958.7 MB in the beginning and 1.3 GB in the end (delta: -311.6 MB). Peak memory consumption was 163.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:18:59,510 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:18:59,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:18:59,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.30 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:18:59,511 INFO L168 Benchmark]: Boogie Preprocessor took 52.67 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:18:59,511 INFO L168 Benchmark]: RCFGBuilder took 1129.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.2 MB in the end (delta: 138.6 MB). Peak memory consumption was 138.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:18:59,511 INFO L168 Benchmark]: BuchiAutomizer took 323017.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 984.2 MB in the beginning and 1.3 GB in the end (delta: -286.1 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:18:59,511 INFO L168 Benchmark]: Witness Printer took 2.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:18:59,512 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.30 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.67 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1129.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.2 MB in the end (delta: 138.6 MB). Peak memory consumption was 138.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 323017.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 984.2 MB in the beginning and 1.3 GB in the end (delta: -286.1 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 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 59 terminating modules (40 trivial, 19 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 19 locations. One deterministic module has affine ranking function -1 * votedValue_History_0 + -1 * g2v_\old + nomsg and consists of 21 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. 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 nomsg + -1 * \result + -1 * g2v_\old and consists of 21 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 -1 * voted_value and consists of 23 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. 40 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 322.9s and 41 iterations. TraceHistogramMax:3. Analysis of lassos took 306.5s. Construction of modules took 5.2s. Büchi inclusion checks took 9.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 58. Automata minimization 0.6s AutomataMinimizationTime, 58 MinimizatonAttempts, 28372 StatesRemovedByMinimization, 40 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 3535 states and ocurred in iteration 35. Nontrivial modules had stage [19, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/46 HoareTripleCheckerStatistics: 31269 SDtfs, 37570 SDslu, 64597 SDs, 0 SdLazy, 9855 SolverSat, 871 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI21 SILT18 lasso0 LassoPreprocessingBenchmarks: Lassos: inital726 mio100 ax144 hnf105 lsp22 ukn75 mio100 lsp100 div158 bol100 ite100 ukn100 eq174 hnf74 smp99 dnf3846 smp21 tf102 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 136ms VariablesStem: 0 VariablesLoop: 31 DisjunctsStem: 1 DisjunctsLoop: 24 SupportingInvariants: 0 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 303 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 11 LassoNonterminationAnalysisTime: 142.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...