./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3d58fadf54daed6107b58402b79d250d23d0301 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:24:19,362 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:24:19,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:24:19,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:24:19,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:24:19,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:24:19,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:24:19,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:24:19,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:24:19,375 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:24:19,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:24:19,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:24:19,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:24:19,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:24:19,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:24:19,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:24:19,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:24:19,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:24:19,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:24:19,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:24:19,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:24:19,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:24:19,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:24:19,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:24:19,387 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:24:19,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:24:19,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:24:19,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:24:19,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:24:19,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:24:19,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:24:19,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:24:19,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:24:19,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:24:19,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:24:19,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:24:19,392 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 08:24:19,402 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:24:19,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:24:19,403 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 08:24:19,403 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 08:24:19,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:24:19,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:24:19,404 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:24:19,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:24:19,404 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:24:19,404 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:24:19,405 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 08:24:19,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:24:19,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:24:19,406 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 08:24:19,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 08:24:19,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:24:19,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:24:19,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 08:24:19,406 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 08:24:19,406 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:24:19,406 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 08:24:19,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 08:24:19,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_900b7b0e-17a4-4b45-8c02-f8602f1dee15/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(G ! call(__VERIFIER_error())) ) 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 -> e3d58fadf54daed6107b58402b79d250d23d0301 [2018-12-08 08:24:19,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:24:19,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:24:19,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:24:19,443 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:24:19,443 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:24:19,443 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-08 08:24:19,484 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/data/b411f4ec9/5d0866402a91483293a4ae2ca13085d0/FLAG0b75eec94 [2018-12-08 08:24:19,771 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:24:19,771 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-08 08:24:19,777 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/data/b411f4ec9/5d0866402a91483293a4ae2ca13085d0/FLAG0b75eec94 [2018-12-08 08:24:19,787 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/data/b411f4ec9/5d0866402a91483293a4ae2ca13085d0 [2018-12-08 08:24:19,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:24:19,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:24:19,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:24:19,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:24:19,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:24:19,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:24:19" (1/1) ... [2018-12-08 08:24:19,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7faede09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:19, skipping insertion in model container [2018-12-08 08:24:19,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:24:19" (1/1) ... [2018-12-08 08:24:19,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:24:19,820 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:24:19,950 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:24:19,954 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:24:19,977 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:24:20,016 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:24:20,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20 WrapperNode [2018-12-08 08:24:20,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:24:20,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:24:20,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:24:20,017 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:24:20,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:24:20,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:24:20,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:24:20,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:24:20,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... [2018-12-08 08:24:20,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:24:20,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:24:20,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:24:20,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:24:20,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:24:20,082 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-08 08:24:20,083 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-08 08:24:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-12-08 08:24:20,083 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-12-08 08:24:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 08:24:20,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 08:24:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-08 08:24:20,083 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-08 08:24:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-08 08:24:20,083 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-08 08:24:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-12-08 08:24:20,084 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-12-08 08:24:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-08 08:24:20,084 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-08 08:24:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-08 08:24:20,084 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-08 08:24:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-08 08:24:20,084 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-08 08:24:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-08 08:24:20,084 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-08 08:24:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-08 08:24:20,084 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-08 08:24:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-08 08:24:20,085 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-08 08:24:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-08 08:24:20,085 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-08 08:24:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-08 08:24:20,085 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-08 08:24:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-08 08:24:20,085 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-08 08:24:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-08 08:24:20,085 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-08 08:24:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-08 08:24:20,085 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-08 08:24:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 08:24:20,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 08:24:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-08 08:24:20,086 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-08 08:24:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-08 08:24:20,086 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-08 08:24:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-08 08:24:20,086 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-08 08:24:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:24:20,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:24:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-08 08:24:20,086 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-08 08:24:20,335 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:24:20,335 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 08:24:20,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:24:20 BoogieIcfgContainer [2018-12-08 08:24:20,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:24:20,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 08:24:20,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 08:24:20,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 08:24:20,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:24:19" (1/3) ... [2018-12-08 08:24:20,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d66fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:24:20, skipping insertion in model container [2018-12-08 08:24:20,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:20" (2/3) ... [2018-12-08 08:24:20,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d66fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:24:20, skipping insertion in model container [2018-12-08 08:24:20,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:24:20" (3/3) ... [2018-12-08 08:24:20,341 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-08 08:24:20,349 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 08:24:20,355 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 08:24:20,367 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 08:24:20,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:24:20,390 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 08:24:20,390 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 08:24:20,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 08:24:20,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:24:20,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:24:20,390 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 08:24:20,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:24:20,390 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 08:24:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-12-08 08:24:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 08:24:20,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:20,409 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:20,410 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:20,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -698129678, now seen corresponding path program 1 times [2018-12-08 08:24:20,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:20,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:20,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:20,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:20,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:20,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:20,597 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2018-12-08 08:24:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:20,891 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2018-12-08 08:24:20,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:24:20,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-08 08:24:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:20,901 INFO L225 Difference]: With dead ends: 361 [2018-12-08 08:24:20,901 INFO L226 Difference]: Without dead ends: 195 [2018-12-08 08:24:20,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:24:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-08 08:24:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-12-08 08:24:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-08 08:24:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2018-12-08 08:24:20,943 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2018-12-08 08:24:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:20,943 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2018-12-08 08:24:20,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2018-12-08 08:24:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 08:24:20,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:20,946 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:20,946 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:20,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:20,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1190755852, now seen corresponding path program 1 times [2018-12-08 08:24:20,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:20,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:20,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:20,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:20,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:21,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:21,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:21,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:21,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:21,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:21,027 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2018-12-08 08:24:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:21,279 INFO L93 Difference]: Finished difference Result 340 states and 474 transitions. [2018-12-08 08:24:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:24:21,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-08 08:24:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:21,281 INFO L225 Difference]: With dead ends: 340 [2018-12-08 08:24:21,282 INFO L226 Difference]: Without dead ends: 195 [2018-12-08 08:24:21,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:24:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-08 08:24:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-12-08 08:24:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-08 08:24:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2018-12-08 08:24:21,299 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2018-12-08 08:24:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:21,300 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2018-12-08 08:24:21,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2018-12-08 08:24:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 08:24:21,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:21,302 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:21,302 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:21,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash -236815694, now seen corresponding path program 1 times [2018-12-08 08:24:21,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:21,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:21,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:21,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:21,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:21,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:21,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:21,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:21,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:21,365 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2018-12-08 08:24:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:21,579 INFO L93 Difference]: Finished difference Result 338 states and 468 transitions. [2018-12-08 08:24:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:24:21,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-08 08:24:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:21,580 INFO L225 Difference]: With dead ends: 338 [2018-12-08 08:24:21,580 INFO L226 Difference]: Without dead ends: 193 [2018-12-08 08:24:21,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:24:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-08 08:24:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2018-12-08 08:24:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-08 08:24:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2018-12-08 08:24:21,593 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2018-12-08 08:24:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:21,593 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2018-12-08 08:24:21,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2018-12-08 08:24:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 08:24:21,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:21,594 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:21,594 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:21,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1452969420, now seen corresponding path program 1 times [2018-12-08 08:24:21,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:21,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:21,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:21,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:21,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:21,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:21,655 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2018-12-08 08:24:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:21,877 INFO L93 Difference]: Finished difference Result 355 states and 494 transitions. [2018-12-08 08:24:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:24:21,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-08 08:24:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:21,878 INFO L225 Difference]: With dead ends: 355 [2018-12-08 08:24:21,878 INFO L226 Difference]: Without dead ends: 210 [2018-12-08 08:24:21,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:24:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-08 08:24:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2018-12-08 08:24:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-08 08:24:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2018-12-08 08:24:21,893 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2018-12-08 08:24:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:21,894 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2018-12-08 08:24:21,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2018-12-08 08:24:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 08:24:21,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:21,895 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:21,895 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:21,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2110030450, now seen corresponding path program 1 times [2018-12-08 08:24:21,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:21,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:21,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:21,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:21,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:21,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:21,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:21,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:21,953 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2018-12-08 08:24:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:22,178 INFO L93 Difference]: Finished difference Result 349 states and 483 transitions. [2018-12-08 08:24:22,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:24:22,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-08 08:24:22,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:22,180 INFO L225 Difference]: With dead ends: 349 [2018-12-08 08:24:22,180 INFO L226 Difference]: Without dead ends: 204 [2018-12-08 08:24:22,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:24:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-08 08:24:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2018-12-08 08:24:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-08 08:24:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2018-12-08 08:24:22,191 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2018-12-08 08:24:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:22,191 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2018-12-08 08:24:22,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2018-12-08 08:24:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 08:24:22,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:22,193 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:22,193 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:22,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash 423850612, now seen corresponding path program 1 times [2018-12-08 08:24:22,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:22,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:22,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:22,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:22,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:22,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:22,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:22,230 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 5 states. [2018-12-08 08:24:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:22,465 INFO L93 Difference]: Finished difference Result 351 states and 482 transitions. [2018-12-08 08:24:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:24:22,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-08 08:24:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:22,467 INFO L225 Difference]: With dead ends: 351 [2018-12-08 08:24:22,467 INFO L226 Difference]: Without dead ends: 206 [2018-12-08 08:24:22,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:24:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-08 08:24:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2018-12-08 08:24:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-08 08:24:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2018-12-08 08:24:22,482 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2018-12-08 08:24:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:22,482 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2018-12-08 08:24:22,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2018-12-08 08:24:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 08:24:22,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:22,484 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:22,484 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:22,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash 369457714, now seen corresponding path program 1 times [2018-12-08 08:24:22,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:22,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:22,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:22,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:24:22,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:24:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:24:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:22,525 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 4 states. [2018-12-08 08:24:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:22,640 INFO L93 Difference]: Finished difference Result 445 states and 612 transitions. [2018-12-08 08:24:22,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:24:22,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-08 08:24:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:22,642 INFO L225 Difference]: With dead ends: 445 [2018-12-08 08:24:22,642 INFO L226 Difference]: Without dead ends: 301 [2018-12-08 08:24:22,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-08 08:24:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-12-08 08:24:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-08 08:24:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 393 transitions. [2018-12-08 08:24:22,660 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 393 transitions. Word has length 91 [2018-12-08 08:24:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:22,660 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 393 transitions. [2018-12-08 08:24:22,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:24:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-12-08 08:24:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-08 08:24:22,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:22,661 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:22,661 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:22,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash -515079540, now seen corresponding path program 1 times [2018-12-08 08:24:22,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:22,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:22,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 08:24:22,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:24:22,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:24:22,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:22,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:24:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 08:24:22,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:24:22,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-08 08:24:22,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 08:24:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:24:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:22,852 INFO L87 Difference]: Start difference. First operand 300 states and 393 transitions. Second operand 7 states. [2018-12-08 08:24:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:22,974 INFO L93 Difference]: Finished difference Result 871 states and 1227 transitions. [2018-12-08 08:24:22,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:24:22,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2018-12-08 08:24:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:22,977 INFO L225 Difference]: With dead ends: 871 [2018-12-08 08:24:22,977 INFO L226 Difference]: Without dead ends: 592 [2018-12-08 08:24:22,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:24:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-12-08 08:24:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 567. [2018-12-08 08:24:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-12-08 08:24:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 766 transitions. [2018-12-08 08:24:23,009 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 766 transitions. Word has length 145 [2018-12-08 08:24:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:23,009 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 766 transitions. [2018-12-08 08:24:23,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 08:24:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 766 transitions. [2018-12-08 08:24:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 08:24:23,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:23,011 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:23,011 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:23,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:23,011 INFO L82 PathProgramCache]: Analyzing trace with hash 318721420, now seen corresponding path program 1 times [2018-12-08 08:24:23,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:23,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:23,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-08 08:24:23,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:24:23,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:24:23,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:23,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:24:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 08:24:23,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:24:23,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-08 08:24:23,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:23,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:23,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:23,184 INFO L87 Difference]: Start difference. First operand 567 states and 766 transitions. Second operand 5 states. [2018-12-08 08:24:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:23,554 INFO L93 Difference]: Finished difference Result 2624 states and 3935 transitions. [2018-12-08 08:24:23,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:24:23,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2018-12-08 08:24:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:23,564 INFO L225 Difference]: With dead ends: 2624 [2018-12-08 08:24:23,565 INFO L226 Difference]: Without dead ends: 2083 [2018-12-08 08:24:23,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2018-12-08 08:24:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2068. [2018-12-08 08:24:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2018-12-08 08:24:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2869 transitions. [2018-12-08 08:24:23,684 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2869 transitions. Word has length 164 [2018-12-08 08:24:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:23,685 INFO L480 AbstractCegarLoop]: Abstraction has 2068 states and 2869 transitions. [2018-12-08 08:24:23,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2869 transitions. [2018-12-08 08:24:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-08 08:24:23,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:23,687 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:23,687 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:23,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:23,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1264541432, now seen corresponding path program 1 times [2018-12-08 08:24:23,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:23,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:23,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:23,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:23,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:23,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:23,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:24:23,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:24:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:24:23,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:23,720 INFO L87 Difference]: Start difference. First operand 2068 states and 2869 transitions. Second operand 4 states. [2018-12-08 08:24:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:23,918 INFO L93 Difference]: Finished difference Result 3607 states and 4966 transitions. [2018-12-08 08:24:23,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:24:23,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-08 08:24:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:23,924 INFO L225 Difference]: With dead ends: 3607 [2018-12-08 08:24:23,924 INFO L226 Difference]: Without dead ends: 1566 [2018-12-08 08:24:23,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2018-12-08 08:24:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2018-12-08 08:24:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2018-12-08 08:24:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2132 transitions. [2018-12-08 08:24:24,000 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2132 transitions. Word has length 145 [2018-12-08 08:24:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:24,000 INFO L480 AbstractCegarLoop]: Abstraction has 1566 states and 2132 transitions. [2018-12-08 08:24:24,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:24:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2132 transitions. [2018-12-08 08:24:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 08:24:24,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:24,002 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:24,002 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:24,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:24,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1654182224, now seen corresponding path program 1 times [2018-12-08 08:24:24,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:24,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:24,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:24,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:24,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:24,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:24,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:24:24,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:24:24,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:24:24,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:24,036 INFO L87 Difference]: Start difference. First operand 1566 states and 2132 transitions. Second operand 4 states. [2018-12-08 08:24:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:24,192 INFO L93 Difference]: Finished difference Result 2844 states and 3834 transitions. [2018-12-08 08:24:24,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:24:24,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-08 08:24:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:24,199 INFO L225 Difference]: With dead ends: 2844 [2018-12-08 08:24:24,199 INFO L226 Difference]: Without dead ends: 1300 [2018-12-08 08:24:24,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2018-12-08 08:24:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2018-12-08 08:24:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-12-08 08:24:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1729 transitions. [2018-12-08 08:24:24,270 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1729 transitions. Word has length 146 [2018-12-08 08:24:24,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:24,270 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 1729 transitions. [2018-12-08 08:24:24,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:24:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1729 transitions. [2018-12-08 08:24:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 08:24:24,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:24,271 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:24,271 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:24,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1965624946, now seen corresponding path program 1 times [2018-12-08 08:24:24,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:24,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:24,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:24,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:24,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 08:24:24,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:24:24,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:24:24,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:24,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:24:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 08:24:24,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:24:24,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-08 08:24:24,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 08:24:24,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:24:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:24,415 INFO L87 Difference]: Start difference. First operand 1300 states and 1729 transitions. Second operand 7 states. [2018-12-08 08:24:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:24,602 INFO L93 Difference]: Finished difference Result 3906 states and 5645 transitions. [2018-12-08 08:24:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:24:24,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-12-08 08:24:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:24,609 INFO L225 Difference]: With dead ends: 3906 [2018-12-08 08:24:24,609 INFO L226 Difference]: Without dead ends: 2627 [2018-12-08 08:24:24,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:24:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2018-12-08 08:24:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2595. [2018-12-08 08:24:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2018-12-08 08:24:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3628 transitions. [2018-12-08 08:24:24,733 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3628 transitions. Word has length 146 [2018-12-08 08:24:24,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:24,733 INFO L480 AbstractCegarLoop]: Abstraction has 2595 states and 3628 transitions. [2018-12-08 08:24:24,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 08:24:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3628 transitions. [2018-12-08 08:24:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 08:24:24,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:24,735 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:24,735 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:24,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:24,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1788622330, now seen corresponding path program 1 times [2018-12-08 08:24:24,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:24,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:24,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:24,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:24,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-08 08:24:24,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:24:24,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:24:24,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:24,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:24:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:24,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:24:24,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-08 08:24:24,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 08:24:24,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:24:24,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:24,888 INFO L87 Difference]: Start difference. First operand 2595 states and 3628 transitions. Second operand 7 states. [2018-12-08 08:24:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:25,148 INFO L93 Difference]: Finished difference Result 7827 states and 12348 transitions. [2018-12-08 08:24:25,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:24:25,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2018-12-08 08:24:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:25,166 INFO L225 Difference]: With dead ends: 7827 [2018-12-08 08:24:25,166 INFO L226 Difference]: Without dead ends: 5258 [2018-12-08 08:24:25,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:24:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-08 08:24:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5229. [2018-12-08 08:24:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5229 states. [2018-12-08 08:24:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 7664 transitions. [2018-12-08 08:24:25,484 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 7664 transitions. Word has length 167 [2018-12-08 08:24:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:25,484 INFO L480 AbstractCegarLoop]: Abstraction has 5229 states and 7664 transitions. [2018-12-08 08:24:25,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 08:24:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 7664 transitions. [2018-12-08 08:24:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 08:24:25,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:25,489 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:25,489 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:25,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2137289136, now seen corresponding path program 1 times [2018-12-08 08:24:25,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:25,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:25,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:25,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:25,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:24:25,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:24:25,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:24:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:25,511 INFO L87 Difference]: Start difference. First operand 5229 states and 7664 transitions. Second operand 4 states. [2018-12-08 08:24:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:25,756 INFO L93 Difference]: Finished difference Result 9216 states and 13353 transitions. [2018-12-08 08:24:25,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:24:25,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-08 08:24:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:25,769 INFO L225 Difference]: With dead ends: 9216 [2018-12-08 08:24:25,769 INFO L226 Difference]: Without dead ends: 4009 [2018-12-08 08:24:25,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-12-08 08:24:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4009. [2018-12-08 08:24:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2018-12-08 08:24:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5717 transitions. [2018-12-08 08:24:25,967 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5717 transitions. Word has length 146 [2018-12-08 08:24:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:25,967 INFO L480 AbstractCegarLoop]: Abstraction has 4009 states and 5717 transitions. [2018-12-08 08:24:25,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:24:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5717 transitions. [2018-12-08 08:24:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 08:24:25,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:25,970 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:25,971 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:25,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash 4256015, now seen corresponding path program 1 times [2018-12-08 08:24:25,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:25,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:26,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:26,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:26,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:26,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:26,027 INFO L87 Difference]: Start difference. First operand 4009 states and 5717 transitions. Second operand 5 states. [2018-12-08 08:24:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:26,533 INFO L93 Difference]: Finished difference Result 9831 states and 14243 transitions. [2018-12-08 08:24:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:24:26,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-08 08:24:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:26,550 INFO L225 Difference]: With dead ends: 9831 [2018-12-08 08:24:26,551 INFO L226 Difference]: Without dead ends: 5845 [2018-12-08 08:24:26,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5845 states. [2018-12-08 08:24:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5845 to 5224. [2018-12-08 08:24:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-12-08 08:24:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 7019 transitions. [2018-12-08 08:24:26,787 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 7019 transitions. Word has length 147 [2018-12-08 08:24:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:26,787 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 7019 transitions. [2018-12-08 08:24:26,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 7019 transitions. [2018-12-08 08:24:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 08:24:26,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:26,790 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:26,791 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:26,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1880738833, now seen corresponding path program 1 times [2018-12-08 08:24:26,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:26,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:26,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:26,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:26,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:26,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:26,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:26,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:26,838 INFO L87 Difference]: Start difference. First operand 5224 states and 7019 transitions. Second operand 5 states. [2018-12-08 08:24:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:27,261 INFO L93 Difference]: Finished difference Result 10425 states and 14064 transitions. [2018-12-08 08:24:27,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:24:27,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-08 08:24:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:27,275 INFO L225 Difference]: With dead ends: 10425 [2018-12-08 08:24:27,275 INFO L226 Difference]: Without dead ends: 5224 [2018-12-08 08:24:27,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:24:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2018-12-08 08:24:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5224. [2018-12-08 08:24:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-12-08 08:24:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 6965 transitions. [2018-12-08 08:24:27,536 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 6965 transitions. Word has length 147 [2018-12-08 08:24:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:27,536 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 6965 transitions. [2018-12-08 08:24:27,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 6965 transitions. [2018-12-08 08:24:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 08:24:27,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:27,539 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:27,539 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:27,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:27,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1607887, now seen corresponding path program 1 times [2018-12-08 08:24:27,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:27,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:27,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:27,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:27,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:27,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:27,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:27,580 INFO L87 Difference]: Start difference. First operand 5224 states and 6965 transitions. Second operand 5 states. [2018-12-08 08:24:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:27,941 INFO L93 Difference]: Finished difference Result 10425 states and 13956 transitions. [2018-12-08 08:24:27,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:24:27,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-08 08:24:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:27,956 INFO L225 Difference]: With dead ends: 10425 [2018-12-08 08:24:27,956 INFO L226 Difference]: Without dead ends: 5224 [2018-12-08 08:24:27,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:24:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2018-12-08 08:24:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5224. [2018-12-08 08:24:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-12-08 08:24:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 6911 transitions. [2018-12-08 08:24:28,169 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 6911 transitions. Word has length 147 [2018-12-08 08:24:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:28,169 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 6911 transitions. [2018-12-08 08:24:28,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 6911 transitions. [2018-12-08 08:24:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 08:24:28,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:28,172 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:28,172 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:28,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1326464081, now seen corresponding path program 1 times [2018-12-08 08:24:28,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:28,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:28,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:28,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:28,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:28,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:28,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:28,232 INFO L87 Difference]: Start difference. First operand 5224 states and 6911 transitions. Second operand 5 states. [2018-12-08 08:24:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:28,785 INFO L93 Difference]: Finished difference Result 11281 states and 16689 transitions. [2018-12-08 08:24:28,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:24:28,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-08 08:24:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:28,799 INFO L225 Difference]: With dead ends: 11281 [2018-12-08 08:24:28,799 INFO L226 Difference]: Without dead ends: 6080 [2018-12-08 08:24:28,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2018-12-08 08:24:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 5579. [2018-12-08 08:24:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2018-12-08 08:24:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 7229 transitions. [2018-12-08 08:24:29,045 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 7229 transitions. Word has length 147 [2018-12-08 08:24:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:29,046 INFO L480 AbstractCegarLoop]: Abstraction has 5579 states and 7229 transitions. [2018-12-08 08:24:29,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 7229 transitions. [2018-12-08 08:24:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 08:24:29,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:29,048 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:29,048 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:29,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1401745265, now seen corresponding path program 1 times [2018-12-08 08:24:29,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:29,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:29,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:29,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:29,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:29,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:29,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:29,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:29,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:29,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:29,092 INFO L87 Difference]: Start difference. First operand 5579 states and 7229 transitions. Second operand 5 states. [2018-12-08 08:24:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:29,605 INFO L93 Difference]: Finished difference Result 11547 states and 15922 transitions. [2018-12-08 08:24:29,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:24:29,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-08 08:24:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:29,619 INFO L225 Difference]: With dead ends: 11547 [2018-12-08 08:24:29,619 INFO L226 Difference]: Without dead ends: 5991 [2018-12-08 08:24:29,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2018-12-08 08:24:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 5914. [2018-12-08 08:24:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5914 states. [2018-12-08 08:24:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 7667 transitions. [2018-12-08 08:24:29,927 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 7667 transitions. Word has length 147 [2018-12-08 08:24:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:29,927 INFO L480 AbstractCegarLoop]: Abstraction has 5914 states and 7667 transitions. [2018-12-08 08:24:29,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 7667 transitions. [2018-12-08 08:24:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 08:24:29,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:29,929 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:29,929 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:29,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1835383953, now seen corresponding path program 1 times [2018-12-08 08:24:29,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:29,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:29,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 08:24:29,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:29,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:24:29,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:29,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:29,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:29,989 INFO L87 Difference]: Start difference. First operand 5914 states and 7667 transitions. Second operand 5 states. [2018-12-08 08:24:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:30,568 INFO L93 Difference]: Finished difference Result 12600 states and 18979 transitions. [2018-12-08 08:24:30,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:24:30,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-08 08:24:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:30,584 INFO L225 Difference]: With dead ends: 12600 [2018-12-08 08:24:30,584 INFO L226 Difference]: Without dead ends: 6708 [2018-12-08 08:24:30,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2018-12-08 08:24:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 6114. [2018-12-08 08:24:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6114 states. [2018-12-08 08:24:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 7893 transitions. [2018-12-08 08:24:30,888 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 7893 transitions. Word has length 147 [2018-12-08 08:24:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:30,889 INFO L480 AbstractCegarLoop]: Abstraction has 6114 states and 7893 transitions. [2018-12-08 08:24:30,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 7893 transitions. [2018-12-08 08:24:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 08:24:30,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:30,890 INFO L402 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:30,891 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 692881487, now seen corresponding path program 1 times [2018-12-08 08:24:30,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:30,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:30,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:30,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 08:24:30,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:30,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:24:30,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 08:24:30,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:24:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:30,955 INFO L87 Difference]: Start difference. First operand 6114 states and 7893 transitions. Second operand 4 states. [2018-12-08 08:24:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:31,330 INFO L93 Difference]: Finished difference Result 9514 states and 12687 transitions. [2018-12-08 08:24:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:24:31,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-08 08:24:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:31,340 INFO L225 Difference]: With dead ends: 9514 [2018-12-08 08:24:31,340 INFO L226 Difference]: Without dead ends: 5475 [2018-12-08 08:24:31,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:24:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2018-12-08 08:24:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5445. [2018-12-08 08:24:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5445 states. [2018-12-08 08:24:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5445 states to 5445 states and 6729 transitions. [2018-12-08 08:24:31,594 INFO L78 Accepts]: Start accepts. Automaton has 5445 states and 6729 transitions. Word has length 147 [2018-12-08 08:24:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:31,594 INFO L480 AbstractCegarLoop]: Abstraction has 5445 states and 6729 transitions. [2018-12-08 08:24:31,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 08:24:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 5445 states and 6729 transitions. [2018-12-08 08:24:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 08:24:31,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:31,597 INFO L402 BasicCegarLoop]: trace 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, 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, 1, 1, 1, 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-12-08 08:24:31,597 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:31,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash -198318960, now seen corresponding path program 1 times [2018-12-08 08:24:31,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:31,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:31,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-08 08:24:31,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:24:31,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:24:31,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:31,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:24:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 08:24:31,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:24:31,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-08 08:24:31,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:24:31,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:24:31,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:31,745 INFO L87 Difference]: Start difference. First operand 5445 states and 6729 transitions. Second operand 5 states. [2018-12-08 08:24:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:32,286 INFO L93 Difference]: Finished difference Result 9689 states and 11989 transitions. [2018-12-08 08:24:32,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:24:32,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2018-12-08 08:24:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:32,302 INFO L225 Difference]: With dead ends: 9689 [2018-12-08 08:24:32,302 INFO L226 Difference]: Without dead ends: 5444 [2018-12-08 08:24:32,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:24:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5444 states. [2018-12-08 08:24:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5444 to 5444. [2018-12-08 08:24:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5444 states. [2018-12-08 08:24:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 6619 transitions. [2018-12-08 08:24:32,698 INFO L78 Accepts]: Start accepts. Automaton has 5444 states and 6619 transitions. Word has length 192 [2018-12-08 08:24:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:32,698 INFO L480 AbstractCegarLoop]: Abstraction has 5444 states and 6619 transitions. [2018-12-08 08:24:32,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:24:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5444 states and 6619 transitions. [2018-12-08 08:24:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-08 08:24:32,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:32,705 INFO L402 BasicCegarLoop]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:32,705 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:32,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:32,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1598654101, now seen corresponding path program 1 times [2018-12-08 08:24:32,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:32,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:32,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-08 08:24:32,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:24:32,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:24:32,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:32,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:24:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-08 08:24:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:24:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-12-08 08:24:32,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:32,858 INFO L87 Difference]: Start difference. First operand 5444 states and 6619 transitions. Second operand 3 states. [2018-12-08 08:24:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:33,152 INFO L93 Difference]: Finished difference Result 8878 states and 11013 transitions. [2018-12-08 08:24:33,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:33,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-12-08 08:24:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:33,167 INFO L225 Difference]: With dead ends: 8878 [2018-12-08 08:24:33,167 INFO L226 Difference]: Without dead ends: 4634 [2018-12-08 08:24:33,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2018-12-08 08:24:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4581. [2018-12-08 08:24:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4581 states. [2018-12-08 08:24:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 5403 transitions. [2018-12-08 08:24:33,412 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 5403 transitions. Word has length 212 [2018-12-08 08:24:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:33,412 INFO L480 AbstractCegarLoop]: Abstraction has 4581 states and 5403 transitions. [2018-12-08 08:24:33,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 5403 transitions. [2018-12-08 08:24:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-12-08 08:24:33,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:33,419 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:33,419 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:33,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1570043649, now seen corresponding path program 1 times [2018-12-08 08:24:33,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:33,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:33,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 42 proven. 32 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2018-12-08 08:24:33,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:24:33,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:24:33,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:33,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:24:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-12-08 08:24:33,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:24:33,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-12-08 08:24:33,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:24:33,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:24:33,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:24:33,705 INFO L87 Difference]: Start difference. First operand 4581 states and 5403 transitions. Second operand 12 states. [2018-12-08 08:24:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:33,915 INFO L93 Difference]: Finished difference Result 6850 states and 8061 transitions. [2018-12-08 08:24:33,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:24:33,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 371 [2018-12-08 08:24:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:33,919 INFO L225 Difference]: With dead ends: 6850 [2018-12-08 08:24:33,920 INFO L226 Difference]: Without dead ends: 2291 [2018-12-08 08:24:33,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-08 08:24:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2018-12-08 08:24:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2115. [2018-12-08 08:24:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-12-08 08:24:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2326 transitions. [2018-12-08 08:24:34,027 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2326 transitions. Word has length 371 [2018-12-08 08:24:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:34,027 INFO L480 AbstractCegarLoop]: Abstraction has 2115 states and 2326 transitions. [2018-12-08 08:24:34,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:24:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2326 transitions. [2018-12-08 08:24:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-08 08:24:34,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:34,030 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:34,030 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:34,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:34,030 INFO L82 PathProgramCache]: Analyzing trace with hash 79500943, now seen corresponding path program 1 times [2018-12-08 08:24:34,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:34,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:34,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:34,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:34,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-12-08 08:24:34,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:24:34,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:24:34,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:34,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:24:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-08 08:24:34,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:24:34,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-12-08 08:24:34,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 08:24:34,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:24:34,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:34,211 INFO L87 Difference]: Start difference. First operand 2115 states and 2326 transitions. Second operand 7 states. [2018-12-08 08:24:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:34,530 INFO L93 Difference]: Finished difference Result 2781 states and 3053 transitions. [2018-12-08 08:24:34,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:24:34,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2018-12-08 08:24:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:34,532 INFO L225 Difference]: With dead ends: 2781 [2018-12-08 08:24:34,532 INFO L226 Difference]: Without dead ends: 451 [2018-12-08 08:24:34,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:24:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-08 08:24:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 442. [2018-12-08 08:24:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-08 08:24:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 460 transitions. [2018-12-08 08:24:34,553 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 460 transitions. Word has length 264 [2018-12-08 08:24:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:34,554 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 460 transitions. [2018-12-08 08:24:34,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 08:24:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 460 transitions. [2018-12-08 08:24:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-08 08:24:34,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:34,555 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 08:24:34,555 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:34,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:34,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1370083387, now seen corresponding path program 1 times [2018-12-08 08:24:34,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:34,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:34,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:34,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:34,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-08 08:24:34,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:34,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 08:24:34,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 08:24:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:24:34,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:24:34,672 INFO L87 Difference]: Start difference. First operand 442 states and 460 transitions. Second operand 7 states. [2018-12-08 08:24:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:35,023 INFO L93 Difference]: Finished difference Result 442 states and 460 transitions. [2018-12-08 08:24:35,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:24:35,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2018-12-08 08:24:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:35,024 INFO L225 Difference]: With dead ends: 442 [2018-12-08 08:24:35,024 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 08:24:35,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:24:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 08:24:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 08:24:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 08:24:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 08:24:35,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2018-12-08 08:24:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:35,025 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:24:35,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 08:24:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:24:35,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 08:24:35,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 08:24:35,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:24:35,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:24:35,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:24:35,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:24:36,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 08:24:37,011 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2018-12-08 08:24:38,243 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 167 DAG size of output: 91 [2018-12-08 08:24:38,440 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2018-12-08 08:24:38,847 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2018-12-08 08:24:39,599 WARN L180 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 102 [2018-12-08 08:24:40,085 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2018-12-08 08:24:40,186 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2018-12-08 08:24:40,498 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 119 [2018-12-08 08:24:40,603 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2018-12-08 08:24:40,716 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2018-12-08 08:24:40,845 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2018-12-08 08:24:41,089 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2018-12-08 08:24:41,612 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 88 [2018-12-08 08:24:41,794 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2018-12-08 08:24:42,127 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2018-12-08 08:24:42,417 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 119 [2018-12-08 08:24:43,420 WARN L180 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 98 [2018-12-08 08:24:43,832 WARN L180 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2018-12-08 08:24:44,694 WARN L180 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 93 [2018-12-08 08:24:45,512 WARN L180 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 102 [2018-12-08 08:24:45,932 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2018-12-08 08:24:47,266 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 159 DAG size of output: 108 [2018-12-08 08:24:48,534 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 139 DAG size of output: 98 [2018-12-08 08:24:48,806 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2018-12-08 08:24:49,026 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-12-08 08:24:49,666 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 97 [2018-12-08 08:24:50,000 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2018-12-08 08:24:50,134 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-08 08:24:50,855 WARN L180 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 123 [2018-12-08 08:24:51,702 WARN L180 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 81 [2018-12-08 08:24:51,906 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2018-12-08 08:24:52,533 WARN L180 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 123 [2018-12-08 08:24:52,674 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2018-12-08 08:24:52,913 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2018-12-08 08:24:54,447 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 134 DAG size of output: 86 [2018-12-08 08:24:54,731 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-12-08 08:24:55,202 WARN L180 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2018-12-08 08:24:56,048 WARN L180 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 93 [2018-12-08 08:24:56,261 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2018-12-08 08:24:56,633 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2018-12-08 08:24:57,902 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 139 DAG size of output: 98 [2018-12-08 08:24:58,009 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 1 [2018-12-08 08:24:58,687 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2018-12-08 08:24:58,824 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2018-12-08 08:25:00,038 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 198 DAG size of output: 145 [2018-12-08 08:25:00,639 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2018-12-08 08:25:00,816 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2018-12-08 08:25:01,545 WARN L180 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-12-08 08:25:01,716 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2018-12-08 08:25:01,908 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2018-12-08 08:25:02,501 WARN L180 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2018-12-08 08:25:02,903 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2018-12-08 08:25:04,261 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 198 DAG size of output: 145 [2018-12-08 08:25:04,264 INFO L444 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse4 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0))) (let ((.cse37 (not .cse0)) (.cse38 (not .cse4)) (.cse33 (= 1 ~m_pc~0)) (.cse39 (not (= ~M_E~0 0))) (.cse40 (not (= ~E_1~0 0))) (.cse41 (not (= ~E_2~0 0)))) (let ((.cse22 (= 0 ~t2_st~0)) (.cse23 (not (= ~E_2~0 1))) (.cse24 (and .cse37 .cse38 .cse33 .cse39 (not (= ~E_M~0 0)) .cse40 .cse41)) (.cse2 (< 0 ~t2_pc~0)) (.cse11 (not (= 0 |old(~t2_st~0)|))) (.cse20 (<= 2 ~m_st~0)) (.cse3 (< |old(~m_st~0)| 2)) (.cse13 (not .cse33)) (.cse35 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse25 (< ~local~0 |old(~token~0)|)) (.cse26 (< |old(~token~0)| ~local~0)) (.cse27 (= |old(~t1_pc~0)| 1)) (.cse29 (= |old(~E_2~0)| ~E_2~0)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse34 (<= 2 ~t2_st~0)) (.cse30 (<= ~token~0 ~local~0)) (.cse31 (and .cse37 .cse38 (= ~m_st~0 0) .cse39 .cse40 .cse41)) (.cse32 (<= ~local~0 ~token~0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse36 (not (= 1 ~t2_pc~0))) (.cse8 (= ~T1_E~0 1)) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_1~0)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 |old(~E_2~0)|)) (.cse19 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse20 .cse21 .cse22 .cse23 .cse24)) (or .cse0 .cse1 .cse2 .cse25 .cse26 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse14 (and .cse29 .cse21 .cse22 .cse30 .cse31 .cse32) .cse15 .cse16 .cse17 .cse18 .cse19 .cse33) (or .cse0 .cse1 .cse25 .cse3 (and .cse20 .cse21 .cse34 .cse23 .cse24) .cse4 .cse5 .cse6 .cse10 .cse12 .cse15 .cse18 .cse19 .cse35 .cse26 .cse7 .cse36 .cse8 .cse9 .cse13 .cse14 .cse16 .cse17 (and .cse20 .cse21 .cse22 .cse23 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse24)) (or .cse0 .cse1 .cse2 .cse29 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse35 (and .cse20 .cse29 .cse21 .cse34) .cse1 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse36 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse35 .cse1 .cse25 .cse26 .cse27 .cse4 (and .cse29 .cse21 .cse34 .cse30 .cse31 .cse32) .cse5 .cse6 .cse7 .cse36 .cse8 .cse28 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33))))) [2018-12-08 08:25:04,264 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-12-08 08:25:04,265 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse33 (= 1 ~m_pc~0)) (.cse26 (= |old(~t1_pc~0)| 1))) (let ((.cse7 (< 0 ~t2_pc~0)) (.cse17 (not (= 0 |old(~t2_st~0)|))) (.cse5 (= 0 ~t2_st~0)) (.cse8 (not .cse26)) (.cse9 (< |old(~m_st~0)| 2)) (.cse19 (not .cse33)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~m_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse34 (< |old(~t2_st~0)| 2)) (.cse6 (= ~T2_E~0 1)) (.cse28 (< ~local~0 |old(~token~0)|)) (.cse29 (< |old(~token~0)| ~local~0)) (.cse27 (not (= ~t1_pc~0 1))) (.cse31 (= ~m_st~0 0)) (.cse32 (= ~token~0 |old(~token~0)|)) (.cse3 (= |old(~E_2~0)| ~E_2~0)) (.cse4 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse35 (<= 2 ~t2_st~0)) (.cse10 (= ~T2_E~0 0)) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse36 (not (= 1 ~t2_pc~0))) (.cse14 (= ~T1_E~0 1)) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse15 (not (= ~m_i~0 1))) (.cse16 (= 1 ~E_1~0)) (.cse18 (= 1 |old(~E_2~0)|)) (.cse20 (= 0 ~E_1~0)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~E_M~0)) (.cse24 (= 0 |old(~E_2~0)|)) (.cse25 (= |old(~t1_st~0)| 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse6 .cse7 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (and .cse27 .cse2 .cse3 .cse4 .cse5)) (or .cse0 .cse6 .cse7 .cse28 .cse29 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 (and .cse27 .cse31 .cse32 .cse3 .cse4 .cse5) .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse33) (or .cse0 .cse34 .cse6 (and .cse27 .cse2 .cse3 .cse4 .cse35) .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse34 .cse6 .cse28 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse1 .cse2 .cse32 .cse3 .cse4 .cse35) .cse25) (or .cse0 .cse34 .cse6 .cse28 .cse29 (and .cse27 .cse31 .cse32 .cse3 .cse4 .cse35) .cse26 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse30 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse33)))) [2018-12-08 08:25:04,265 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-08 08:25:04,265 INFO L444 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0))) (let ((.cse12 (not (= 0 |old(~m_st~0)|))) (.cse25 (< 0 ~t2_pc~0)) (.cse5 (= |old(~t1_pc~0)| 1)) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (< |old(~token~0)| ~local~0)) (.cse23 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse15 (= 1 |old(~E_2~0)|)) (.cse24 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse27 (= 1 ~t1_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse29 (= |old(~E_2~0)| ~E_2~0)) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse21 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 (and .cse27 .cse28 .cse29 .cse30 (= 0 ~t2_st~0)) .cse2 .cse25 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse25 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse27 .cse28 (= ~token~0 |old(~token~0)|) .cse29 .cse30 (<= 2 ~t2_st~0)) .cse21)))) [2018-12-08 08:25:04,265 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-12-08 08:25:04,265 INFO L444 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse36 (= 1 ~m_pc~0))) (let ((.cse17 (not (= ~E_2~0 1))) (.cse18 (not (= ~E_2~0 0))) (.cse12 (< |old(~t2_st~0)| 2)) (.cse3 (< |old(~m_st~0)| 2)) (.cse22 (not (= 1 ~t2_pc~0))) (.cse25 (not .cse36)) (.cse15 (<= 2 ~m_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse29 (< 0 ~t2_pc~0)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse13 (< |old(~token~0)| ~local~0)) (.cse31 (= |old(~t1_pc~0)| 1)) (.cse4 (= ~T2_E~0 0)) (.cse14 (= 1 ~t1_pc~0)) (.cse33 (= ~m_st~0 0)) (.cse16 (<= 2 ~t1_st~0)) (.cse34 (= ~token~0 |old(~token~0)|)) (.cse35 (= |old(~E_2~0)| ~E_2~0)) (.cse19 (= 0 ~t2_st~0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse21 (= 1 ~E_M~0)) (.cse23 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse24 (not (= ~m_i~0 1))) (.cse7 (= 1 ~E_1~0)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse8 (= 1 |old(~E_2~0)|)) (.cse26 (= 0 ~E_1~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse27 (not (= 1 ~t2_i~0))) (.cse28 (= 0 ~E_M~0)) (.cse10 (= 0 |old(~E_2~0)|)) (.cse11 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17 (<= ~token~0 (+ |old(~token~0)| 1)) .cse18 .cse19 (<= (+ ~local~0 1) ~token~0)) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse29 .cse3 .cse4 .cse5 .cse6 .cse21 .cse23 .cse24 .cse7 .cse30 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse8 .cse25 .cse26 .cse9 .cse27 .cse28 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse2 .cse13 .cse31 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse32 .cse24 .cse7 .cse8 (and .cse14 .cse33 .cse16 .cse34 .cse35 .cse20) .cse26 .cse9 .cse27 .cse28 .cse10 .cse11 .cse36) (or .cse0 .cse1 .cse29 .cse31 .cse35 .cse3 .cse4 .cse5 .cse6 .cse21 .cse23 .cse24 .cse7 .cse30 .cse8 .cse25 .cse26 .cse9 .cse27 .cse28 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse31 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse24 .cse7 .cse8 .cse25 .cse26 (and .cse14 .cse15 .cse16 .cse35 .cse20) .cse9 .cse27 .cse28 .cse10 .cse11) (or .cse0 .cse1 .cse29 .cse2 .cse13 .cse31 .cse4 (and .cse14 .cse33 .cse16 .cse34 .cse35 .cse19) .cse5 .cse6 .cse21 .cse23 .cse32 .cse24 .cse7 .cse30 .cse8 .cse26 .cse9 .cse27 .cse28 .cse10 .cse11 .cse36)))) [2018-12-08 08:25:04,266 INFO L444 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0))) (let ((.cse12 (not (= 0 |old(~m_st~0)|))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (< |old(~token~0)| ~local~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse27 (= 1 ~t1_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse29 (not (= ~E_2~0 0))) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse25 (< 0 ~t2_pc~0)) (.cse5 (= |old(~t1_pc~0)| 1)) (.cse23 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 1 |old(~E_2~0)|)) (.cse24 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse21 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse25 .cse23 .cse6 (and .cse27 .cse28 .cse29 .cse30 (= 0 ~t2_st~0)) .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 (and .cse27 .cse28 (<= ~token~0 (+ |old(~token~0)| 1)) .cse29 .cse30 (<= 2 ~t2_st~0) (<= (+ ~local~0 1) ~token~0)) .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse25 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-12-08 08:25:04,266 INFO L448 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-12-08 08:25:04,266 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-12-08 08:25:04,266 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse24 (= ~t1_pc~0 1)) (.cse27 (= 1 ~m_pc~0)) (.cse35 (<= 2 ~m_st~0)) (.cse33 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse23 (<= 2 ~t2_st~0)) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse22 (= 0 ~t1_st~0)) (.cse25 (not .cse21)) (.cse28 (< 0 ~t2_pc~0)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse29 (= 0 ~t2_st~0)) (.cse5 (and .cse35 .cse33 .cse23)) (.cse4 (< |old(~m_st~0)| 2)) (.cse14 (= 1 ~E_1~0)) (.cse15 (not .cse27)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse31 (< ~local~0 ~token~0)) (.cse3 (not .cse24)) (.cse32 (< ~token~0 ~local~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse34 (< |old(~t1_st~0)| 2)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse26 (= 1 ~E_2~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 ~E_2~0))) (and (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse12 ~token~0) .cse19 .cse20 .cse21)) (or (and .cse22 .cse23) .cse0 .cse1 .cse2 .cse24 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse11 .cse13 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27) (or .cse0 .cse2 .cse28 (and .cse22 .cse29) .cse24 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse13 .cse30 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27) (or .cse0 .cse2 .cse28 .cse31 .cse3 .cse32 .cse6 .cse7 (and .cse33 .cse29) .cse8 .cse9 .cse34 .cse11 .cse13 .cse30 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27) (or .cse0 .cse2 .cse28 .cse31 .cse32 .cse24 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 (not (= 0 |old(~m_st~0)|)) .cse13 .cse14 .cse30 .cse26 .cse16 (= ~m_st~0 0) .cse17 .cse18 .cse19 .cse20 .cse27) (or .cse0 .cse2 .cse28 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse35 .cse33 .cse29)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse5 .cse9 .cse10 .cse34 .cse11 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse36 (+ ~local~0 2))) (or .cse0 .cse2 (< .cse36 ~token~0) .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse34 .cse11 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< ~token~0 .cse36) (and .cse35 .cse33))) (or .cse0 .cse1 .cse2 .cse31 (and .cse33 .cse23) .cse3 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse34 .cse11 .cse13 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-12-08 08:25:04,267 INFO L444 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse35 (= 1 ~m_pc~0)) (.cse31 (= ~t1_pc~0 1)) (.cse22 (= |old(~t1_st~0)| 0)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (<= 2 ~t2_st~0))) (let ((.cse32 (= 0 ~t1_st~0)) (.cse30 (and .cse4 .cse5 .cse28)) (.cse34 (not .cse22)) (.cse6 (= 0 ~t2_st~0)) (.cse2 (< 0 ~t2_pc~0)) (.cse15 (not (= 0 |old(~t2_st~0)|))) (.cse23 (< |old(~t2_st~0)| 2)) (.cse24 (< ~local~0 ~token~0)) (.cse25 (< ~token~0 ~local~0)) (.cse33 (= activate_threads_~tmp~1 0)) (.cse37 (= ~m_st~0 0)) (.cse11 (= 1 ~E_M~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (not .cse31)) (.cse7 (< |old(~m_st~0)| 2)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse26 (not (= 1 ~t2_pc~0))) (.cse27 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse29 (= 1 ~E_2~0)) (.cse16 (not .cse35)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse24 .cse3 .cse25 .cse8 .cse9 .cse10 .cse11 .cse26 .cse27 .cse12 (and .cse5 .cse28) .cse13 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse23 .cse1 .cse3 .cse7 .cse8 .cse9 .cse11 .cse26 .cse27 .cse12 .cse13 .cse14 .cse29 .cse16 .cse17 .cse18 .cse30 .cse19 .cse20 .cse21) (or .cse0 .cse23 .cse1 .cse31 .cse8 (and .cse32 .cse33 .cse28) .cse9 .cse10 .cse34 .cse11 .cse26 .cse12 .cse13 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse1 .cse2 .cse31 .cse8 .cse9 (and .cse32 .cse33 .cse6) .cse10 .cse34 .cse11 .cse12 .cse13 .cse15 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35) (let ((.cse36 (+ ~local~0 1))) (or .cse0 .cse23 .cse1 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 (< ~token~0 .cse36) .cse13 .cse14 .cse30 .cse16 .cse17 .cse18 .cse19 (< .cse36 ~token~0) .cse20 .cse21 .cse22)) (or .cse0 .cse1 .cse2 .cse24 .cse25 .cse31 .cse8 .cse9 .cse10 .cse34 .cse11 .cse12 (not (= 0 |old(~m_st~0)|)) .cse13 .cse14 .cse15 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35 .cse37) (or (and .cse5 .cse33 .cse6) .cse0 .cse1 .cse2 .cse24 .cse3 .cse25 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse15 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse23 .cse1 .cse24 .cse3 .cse25 .cse8 .cse9 .cse10 .cse11 .cse26 .cse27 .cse12 .cse13 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35 .cse33) (let ((.cse38 (+ ~local~0 2))) (or (and .cse37 .cse5 .cse11) .cse0 .cse1 (< .cse38 ~token~0) .cse3 .cse7 .cse8 .cse9 .cse10 .cse26 .cse27 .cse12 .cse13 .cse14 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse4 .cse5) (< ~token~0 .cse38)))))) [2018-12-08 08:25:04,267 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-08 08:25:04,267 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-12-08 08:25:04,267 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse24 (= ~t1_pc~0 1)) (.cse27 (= 1 ~m_pc~0)) (.cse35 (<= 2 ~m_st~0)) (.cse33 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse23 (<= 2 ~t2_st~0)) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse22 (= 0 ~t1_st~0)) (.cse25 (not .cse21)) (.cse28 (< 0 ~t2_pc~0)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse29 (= 0 ~t2_st~0)) (.cse5 (and .cse35 .cse33 .cse23)) (.cse4 (< |old(~m_st~0)| 2)) (.cse14 (= 1 ~E_1~0)) (.cse15 (not .cse27)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse31 (< ~local~0 ~token~0)) (.cse3 (not .cse24)) (.cse32 (< ~token~0 ~local~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse34 (< |old(~t1_st~0)| 2)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse26 (= 1 ~E_2~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 ~E_2~0))) (and (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse12 ~token~0) .cse19 .cse20 .cse21)) (or (and .cse22 .cse23) .cse0 .cse1 .cse2 .cse24 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse11 .cse13 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27) (or .cse0 .cse2 .cse28 (and .cse22 .cse29) .cse24 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse13 .cse30 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27) (or .cse0 .cse2 .cse28 .cse31 .cse3 .cse32 .cse6 .cse7 (and .cse33 .cse29) .cse8 .cse9 .cse34 .cse11 .cse13 .cse30 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27) (or .cse0 .cse2 .cse28 .cse31 .cse32 .cse24 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 (not (= 0 |old(~m_st~0)|)) .cse13 .cse14 .cse30 .cse26 .cse16 (= ~m_st~0 0) .cse17 .cse18 .cse19 .cse20 .cse27) (or .cse0 .cse2 .cse28 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse35 .cse33 .cse29)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse5 .cse9 .cse10 .cse34 .cse11 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse36 (+ ~local~0 2))) (or .cse0 .cse2 (< .cse36 ~token~0) .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse34 .cse11 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< ~token~0 .cse36) (and .cse35 .cse33))) (or .cse0 .cse1 .cse2 .cse31 (and .cse33 .cse23) .cse3 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse34 .cse11 .cse13 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-12-08 08:25:04,267 INFO L448 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-12-08 08:25:04,267 INFO L448 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-12-08 08:25:04,267 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-12-08 08:25:04,268 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-12-08 08:25:04,268 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-08 08:25:04,268 INFO L444 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1)) (.cse32 (= 1 ~m_pc~0)) (.cse14 (<= 2 ~m_st~0)) (.cse15 (= activate_threads_~tmp___0~0 0)) (.cse16 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse30 (<= 2 ~t2_st~0)) (.cse23 (= |old(~t1_st~0)| 0))) (let ((.cse17 (= 0 ~t2_st~0)) (.cse2 (< 0 ~t2_pc~0)) (.cse26 (not .cse23)) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse33 (and .cse14 .cse15 .cse16 .cse30)) (.cse4 (< |old(~m_st~0)| 2)) (.cse37 (= ~m_st~0 0)) (.cse13 (not .cse32)) (.cse11 (= 1 ~E_1~0)) (.cse28 (= 0 ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse24 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse29 (= activate_threads_~tmp~1 0)) (.cse35 (< ~local~0 ~token~0)) (.cse3 (not .cse25)) (.cse36 (< ~token~0 ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse27 (not (= 1 ~t2_pc~0))) (.cse34 (< |old(~t1_st~0)| 2)) (.cse9 (= ~T1_E~0 1)) (.cse10 (not (= ~m_i~0 1))) (.cse31 (= 1 ~E_2~0)) (.cse18 (= 0 ~E_1~0)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse24 .cse1 .cse25 .cse5 .cse6 .cse7 .cse26 .cse8 .cse27 .cse9 .cse10 (and .cse15 .cse28 .cse29 .cse30) .cse31 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32) (or .cse0 .cse24 .cse33 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse27 .cse34 .cse9 .cse10 .cse11 .cse31 .cse13 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse35 .cse3 .cse36 .cse5 .cse6 .cse7 .cse8 .cse34 .cse9 (and .cse11 .cse28 .cse29 .cse17) .cse10 .cse12 .cse31 .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse16 (and .cse15 .cse29 .cse17)) .cse32) (or .cse0 .cse1 .cse2 .cse25 .cse5 .cse6 .cse7 .cse26 (and .cse15 .cse28 .cse29 .cse17) .cse8 .cse9 .cse10 .cse12 .cse31 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse2 .cse35 .cse36 .cse25 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 (not (= 0 |old(~m_st~0)|)) .cse10 .cse11 .cse12 .cse31 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse32) (let ((.cse38 (+ ~local~0 1))) (or .cse0 .cse24 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 (< ~token~0 .cse38) .cse10 .cse11 .cse13 .cse33 .cse18 .cse19 .cse20 (< .cse38 ~token~0) .cse21 .cse22 .cse23)) (let ((.cse39 (+ ~local~0 2))) (or .cse0 .cse1 (< .cse39 ~token~0) .cse3 (and .cse16 (and .cse14 .cse15)) .cse4 .cse5 .cse6 .cse7 .cse27 .cse34 .cse9 .cse10 .cse11 (and .cse37 .cse15 .cse16 .cse8) .cse31 .cse13 .cse18 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse39))) (or .cse0 .cse24 .cse1 .cse35 .cse3 .cse36 (and .cse11 .cse28 .cse30) .cse5 .cse6 .cse7 .cse8 .cse27 .cse34 .cse9 .cse10 .cse31 (and .cse30 .cse15 .cse16) .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse24 .cse1 .cse29 .cse35 .cse3 .cse36 .cse5 .cse6 .cse7 .cse8 .cse27 .cse34 .cse9 .cse10 .cse31 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32)))) [2018-12-08 08:25:04,268 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-12-08 08:25:04,268 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1)) (.cse28 (= 1 ~m_pc~0)) (.cse23 (= |old(~t1_st~0)| 0))) (let ((.cse24 (= 0 ~t1_st~0)) (.cse26 (not .cse23)) (.cse29 (< 0 ~t2_pc~0)) (.cse31 (not (= 0 |old(~t2_st~0)|))) (.cse30 (= 0 ~t2_st~0)) (.cse4 (< |old(~m_st~0)| 2)) (.cse16 (= 1 ~E_1~0)) (.cse17 (not .cse28)) (.cse5 (<= 2 ~m_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse32 (< ~local~0 ~token~0)) (.cse6 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse7 (<= 2 ~t2_st~0)) (.cse3 (not .cse25)) (.cse33 (< ~token~0 ~local~0)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (= 1 ~E_M~0)) (.cse12 (not (= 1 ~t2_pc~0))) (.cse34 (< |old(~t1_st~0)| 2)) (.cse13 (= ~T1_E~0 1)) (.cse15 (not (= ~m_i~0 1))) (.cse27 (= 1 ~E_2~0)) (.cse18 (= 0 ~E_1~0)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0))) (and (let ((.cse14 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~token~0 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse14 ~token~0) .cse21 .cse22 .cse23)) (or (and .cse24 .cse7) .cse0 .cse1 .cse2 .cse25 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse2 .cse29 (and .cse24 .cse30) .cse25 .cse8 .cse9 .cse10 .cse26 .cse11 .cse13 .cse15 .cse31 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse2 .cse29 .cse32 .cse3 .cse33 .cse8 .cse9 (and .cse6 .cse30) .cse10 .cse11 .cse34 .cse13 .cse15 .cse31 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse2 .cse29 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse5 .cse6 .cse30)) (let ((.cse35 (+ ~local~0 2))) (or .cse0 .cse2 (< .cse35 ~token~0) .cse3 .cse4 .cse8 .cse9 .cse10 .cse12 .cse34 .cse13 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse35) (and .cse5 .cse6))) (or .cse0 .cse1 .cse2 .cse32 (and .cse6 .cse7) .cse3 .cse33 .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse13 .cse15 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2018-12-08 08:25:04,269 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-12-08 08:25:04,269 INFO L444 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1)) (.cse25 (= 1 ~m_pc~0))) (let ((.cse8 (not (= |old(~t1_st~0)| 0))) (.cse4 (< |old(~m_st~0)| 2)) (.cse14 (not .cse25)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse22 (< ~local~0 |old(~token~0)|)) (.cse20 (not .cse3)) (.cse23 (< |old(~token~0)| ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse24 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse23 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25) (or .cse0 .cse1 .cse2 .cse22 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse26 (+ ~local~0 1))) (or .cse0 .cse1 .cse20 (and (<= 2 ~m_st~0) (= |old(~E_M~0)| ~E_M~0) (= 1 ~t2_pc~0) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse9 (not (= 1 |old(~t2_pc~0)|)) .cse21 .cse10 (< |old(~token~0)| .cse26) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse26 |old(~token~0)|) .cse18 .cse19)) (or .cse0 .cse1 .cse2 .cse22 .cse20 .cse23 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse24 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25)))) [2018-12-08 08:25:04,269 INFO L444 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse27 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse18 (not (= 0 |old(~m_st~0)|))) (.cse10 (= ~m_st~0 0)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse28 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse37 (<= 2 ~m_st~0)) (.cse11 (= |old(~E_M~0)| ~E_M~0)) (.cse12 (= 1 ~t2_pc~0)) (.cse13 (= ~token~0 |old(~token~0)|)) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= 2 ~t2_st~0)) (.cse29 (not .cse5)) (.cse4 (< |old(~token~0)| ~local~0)) (.cse31 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse16 (= 1 |old(~E_M~0)|)) (.cse17 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (= 1 ~E_1~0)) (.cse21 (= 1 ~E_2~0)) (.cse33 (not .cse27)) (.cse22 (= 0 ~E_1~0)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 |old(~E_M~0)|)) (.cse26 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or (and .cse10 .cse11 .cse12 .cse13 .cse28 .cse15) .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse6 .cse7 .cse8 .cse16 .cse30 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (let ((.cse32 (+ ~local~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse35 (not (= ~E_M~0 1)))) (or .cse0 .cse1 .cse29 .cse31 .cse6 .cse7 .cse8 .cse16 (not (= 1 |old(~t2_pc~0)|)) .cse30 .cse17 (< |old(~token~0)| .cse32) .cse19 .cse20 .cse21 .cse33 (let ((.cse36 (+ ~local~0 2))) (and .cse10 .cse34 .cse35 (<= ~token~0 .cse36) .cse12 .cse28 .cse15 (<= .cse36 ~token~0))) .cse22 .cse23 .cse24 (< .cse32 |old(~token~0)|) .cse25 .cse26 (and .cse37 .cse34 .cse35 .cse12 .cse28 .cse15))) (or .cse0 .cse1 .cse2 .cse29 .cse31 .cse6 .cse7 .cse8 .cse16 .cse30 .cse17 (and .cse37 .cse11 .cse12 .cse28 .cse15) .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 (and .cse37 .cse11 .cse12 .cse14 .cse15) .cse1 .cse2 .cse5 .cse31 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 (and .cse37 .cse11 .cse12 .cse13 .cse14 .cse15) .cse29 .cse4 .cse31 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2018-12-08 08:25:04,269 INFO L448 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-12-08 08:25:04,270 INFO L444 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1)) (.cse27 (= 1 ~m_pc~0))) (let ((.cse4 (< |old(~m_st~0)| 2)) (.cse8 (not (= |old(~t1_st~0)| 0))) (.cse14 (not .cse27)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse24 (< ~local~0 |old(~token~0)|)) (.cse20 (not .cse3)) (.cse25 (< |old(~token~0)| ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse23 (+ ~local~0 1))) (or .cse0 .cse1 (let ((.cse22 (+ ~local~0 2))) (and (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (<= ~token~0 .cse22) (= 1 ~t2_pc~0) (= ~t1_st~0 |old(~t1_st~0)|) (<= .cse22 ~token~0))) .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 (not (= 1 |old(~t2_pc~0)|)) .cse21 .cse10 (< |old(~token~0)| .cse23) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse23 |old(~token~0)|) .cse18 .cse19)) (or .cse0 .cse1 .cse2 .cse24 .cse25 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27) (or .cse0 .cse1 .cse2 .cse24 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse24 .cse20 .cse25 .cse5 .cse6 .cse7 .cse9 .cse21 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27)))) [2018-12-08 08:25:04,270 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-12-08 08:25:04,270 INFO L444 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse31 (= ~t1_pc~0 1)) (.cse38 (= 1 ~m_pc~0))) (let ((.cse8 (< |old(~m_st~0)| 2)) (.cse4 (<= 2 ~m_st~0)) (.cse21 (not .cse38)) (.cse2 (not .cse31)) (.cse5 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse27 (<= ~t2_pc~0 0)) (.cse35 (<= ~token~0 ~local~0)) (.cse10 (= ~m_st~0 0)) (.cse29 (= 0 ~t1_st~0)) (.cse36 (<= ~local~0 ~token~0)) (.cse28 (= |old(~E_M~0)| ~E_M~0)) (.cse1 (= ~T2_E~0 1)) (.cse30 (< 0 |old(~t2_pc~0)|)) (.cse33 (< ~local~0 |old(~token~0)|)) (.cse34 (< |old(~token~0)| ~local~0)) (.cse9 (= ~T2_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~M_E~0)) (.cse32 (not (= |old(~t1_st~0)| 0))) (.cse14 (= 1 |old(~E_M~0)|)) (.cse16 (= ~T1_E~0 1)) (.cse37 (not (= 0 |old(~m_st~0)|))) (.cse18 (not (= ~m_i~0 1))) (.cse19 (= 1 ~E_1~0)) (.cse20 (= 1 ~E_2~0)) (.cse22 (= 0 ~E_1~0)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 |old(~E_M~0)|)) (.cse26 (= 0 ~E_2~0))) (and (let ((.cse6 (not (= ~E_M~0 0))) (.cse7 (not (= ~E_M~0 1))) (.cse3 (= 1 ~t2_pc~0)) (.cse17 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 (let ((.cse11 (+ ~local~0 2))) (and .cse10 .cse6 .cse7 (<= ~token~0 .cse11) .cse3 .cse5 (<= .cse11 ~token~0))) .cse12 .cse13 .cse14 (not (= 1 |old(~t2_pc~0)|)) .cse15 .cse16 (< |old(~token~0)| .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (< .cse17 |old(~token~0)|) .cse25 .cse26)) (or (and .cse4 .cse27 .cse28 .cse29) .cse0 .cse1 .cse30 .cse31 .cse8 .cse9 .cse12 .cse13 .cse32 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse30 .cse2 .cse8 .cse9 (and .cse4 .cse5 .cse27 .cse28) .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse30 .cse33 .cse2 .cse34 .cse8 .cse9 (and .cse4 .cse27 .cse35 .cse29 .cse36 .cse28) .cse12 .cse13 .cse32 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse30 .cse33 .cse2 .cse34 .cse9 .cse12 .cse13 (and .cse10 .cse5 .cse27 .cse35 .cse36 .cse28) .cse14 .cse15 .cse16 .cse37 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse38) (or .cse0 (and .cse27 .cse35 (and .cse10 .cse29) .cse36 .cse28) .cse1 .cse30 .cse33 .cse34 .cse31 .cse9 .cse12 .cse13 .cse32 .cse14 .cse16 .cse37 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse38)))) [2018-12-08 08:25:04,270 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-12-08 08:25:04,270 INFO L444 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse26 (= 1 ~m_pc~0)) (.cse33 (= ~t1_pc~0 1))) (let ((.cse4 (not .cse33)) (.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse29 (< |old(~m_st~0)| 2)) (.cse31 (not .cse26)) (.cse27 (<= 2 ~m_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse5 (< |old(~token~0)| ~local~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (<= ~t2_pc~0 0)) (.cse8 (= |old(~E_M~0)| ~E_M~0)) (.cse9 (= ~token~0 |old(~token~0)|)) (.cse28 (= 0 ~t1_st~0)) (.cse11 (= ~T2_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~M_E~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse14 (= 1 |old(~E_M~0)|)) (.cse16 (= ~T1_E~0 1)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse18 (not (= ~m_i~0 1))) (.cse19 (= 1 ~E_1~0)) (.cse20 (= 1 ~E_2~0)) (.cse21 (= 0 ~E_1~0)) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 |old(~E_M~0)|)) (.cse25 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse27 .cse7 .cse8 .cse9 .cse28) .cse29 .cse11 .cse12 .cse13 .cse30 .cse14 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 (and .cse27 .cse7 .cse8 .cse10) .cse21 .cse22 .cse23 .cse24 .cse25) (let ((.cse32 (+ ~local~0 1))) (or .cse0 .cse1 .cse4 (and .cse27 .cse8 (= 1 ~t2_pc~0) .cse9 .cse10) .cse29 .cse11 .cse12 .cse13 .cse14 (not (= 1 |old(~t2_pc~0)|)) .cse15 .cse16 (< |old(~token~0)| .cse32) .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 (< .cse32 |old(~token~0)|) .cse24 .cse25)) (or .cse0 .cse1 .cse2 .cse33 .cse29 .cse11 .cse12 .cse13 .cse30 .cse14 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 (and .cse27 .cse7 .cse8 .cse28) .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse28) .cse33 .cse11 .cse12 .cse13 .cse30 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2018-12-08 08:25:04,271 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-08 08:25:04,271 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-12-08 08:25:04,271 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-12-08 08:25:04,271 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-12-08 08:25:04,271 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-12-08 08:25:04,271 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-12-08 08:25:04,271 INFO L444 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse26 (= 1 ~m_pc~0)) (.cse28 (= ~t1_pc~0 1))) (let ((.cse23 (not .cse28)) (.cse24 (< ~t1_st~0 2)) (.cse1 (< ~t2_st~0 2)) (.cse12 (not (= 1 ~t2_pc~0))) (.cse25 (not (= 0 ~m_st~0))) (.cse0 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse27 (< 0 ~t2_pc~0)) (.cse4 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse2 (= exists_runnable_thread_~__retres1~3 1)) (.cse6 (< ~m_st~0 2)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse10 (not (= ~t1_st~0 0))) (.cse11 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse14 (not (= ~m_i~0 1))) (.cse15 (= 1 ~E_1~0)) (.cse29 (not (= 0 ~t2_st~0))) (.cse16 (= 1 ~E_2~0)) (.cse17 (not .cse26)) (.cse18 (= 0 ~E_1~0)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse23 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse25 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse26) (or .cse0 .cse3 .cse27 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse30 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 (< .cse30 ~token~0) .cse23 .cse7 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 (< ~token~0 .cse30))) (or .cse0 .cse3 .cse27 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse2 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse3 .cse23 .cse6 .cse7 .cse2 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 (< ~token~0 .cse31) .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse31 ~token~0) .cse21 .cse22)) (or .cse0 .cse1 .cse3 .cse28 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse3 .cse27 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse13 .cse25 .cse14 .cse15 .cse29 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse26) (or .cse2 .cse0 .cse3 .cse27 .cse4 .cse23 .cse5 .cse7 .cse8 .cse9 .cse11 .cse24 .cse13 .cse25 .cse14 .cse15 .cse29 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse26) (or .cse0 .cse3 .cse27 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2018-12-08 08:25:04,271 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-12-08 08:25:04,271 INFO L448 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-12-08 08:25:04,272 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= |old(~T2_E~0)| 0)) (.cse4 (= 0 |old(~M_E~0)|)) (.cse5 (= 1 |old(~M_E~0)|)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse10 (= 1 |old(~E_2~0)|)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse17 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse11 (= 1 ~m_pc~0))) (and (or .cse0 (< ~t2_st~0 2) .cse1 (not .cse2) (< ~m_st~0 2) .cse3 .cse4 .cse5 .cse6 (not (= 1 ~t2_pc~0)) (< ~t1_st~0 2) .cse7 .cse8 .cse9 .cse10 (not .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 (< 0 ~t2_pc~0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 (not (= 0 ~m_st~0)) .cse8 .cse9 (not (= 0 ~t2_st~0)) .cse10 .cse12 .cse17 .cse13 .cse14 .cse15 .cse16 .cse11))) [2018-12-08 08:25:04,272 INFO L448 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-12-08 08:25:04,272 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-12-08 08:25:04,272 INFO L448 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-12-08 08:25:04,272 INFO L448 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-12-08 08:25:04,272 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-12-08 08:25:04,272 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-12-08 08:25:04,272 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-12-08 08:25:04,272 INFO L444 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse24 (= 1 ~m_pc~0)) (.cse22 (= ~t1_pc~0 1)) (.cse29 (= ~t1_st~0 0))) (let ((.cse3 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse25 (< 0 ~t2_pc~0)) (.cse23 (not .cse29)) (.cse27 (not (= 0 ~t2_st~0))) (.cse8 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~t2_st~0 2)) (.cse2 (= ~T2_E~0 1)) (.cse4 (not .cse22)) (.cse26 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse11 (< ~t1_st~0 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse16 (= 1 ~E_1~0)) (.cse14 (= 1 ~E_2~0)) (.cse28 (not .cse24)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0)) (.cse15 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse22 .cse6 .cse15 .cse7 .cse8 .cse23 .cse9 .cse10 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24) (or .cse0 .cse2 .cse25 .cse4 .cse26 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse16 .cse27 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse15) (or .cse0 .cse2 .cse25 .cse3 .cse16 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse27 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24) (or .cse11 (or .cse0 .cse2 .cse4 .cse26 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse16 .cse14 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) .cse15) (or .cse0 .cse15 .cse2 .cse25 .cse22 .cse6 .cse7 .cse8 .cse23 .cse9 .cse12 .cse13 .cse27 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24) (let ((.cse30 (+ ~local~0 2))) (or (not .cse9) .cse0 .cse2 (< .cse30 ~token~0) .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (not (= 0 ~m_st~0)) .cse13 .cse16 .cse14 .cse28 .cse17 .cse18 .cse19 .cse21 .cse15 (< ~token~0 .cse30))) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (< ~token~0 .cse31) .cse13 .cse16 .cse28 .cse17 .cse18 .cse19 (< .cse31 ~token~0) .cse20 .cse21 .cse29)) (or .cse0 .cse1 .cse2 .cse4 .cse26 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15)))) [2018-12-08 08:25:04,273 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-12-08 08:25:04,273 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (< 0 ~t2_pc~0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 ~E_1~0) (not (= 0 |old(~t2_st~0)|)) (= 1 ~E_2~0) (= 0 ~E_1~0) (and (= ~m_st~0 0) (= 0 ~t1_st~0) (= 0 ~t2_st~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 0 ~E_2~0) (= 1 ~m_pc~0)) [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-12-08 08:25:04,273 INFO L448 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-12-08 08:25:04,274 INFO L444 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,274 INFO L444 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (= ~m_i~0 1) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= ~t2_i~0 1) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= ~t1_i~0 1) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,274 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,274 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-12-08 08:25:04,274 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-12-08 08:25:04,274 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-08 08:25:04,274 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-08 08:25:04,274 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-08 08:25:04,274 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-08 08:25:04,274 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-12-08 08:25:04,275 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-08 08:25:04,275 INFO L444 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1))) (let ((.cse7 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse20 (< 0 ~t2_pc~0)) (.cse26 (< |old(~local~0)| |old(~token~0)|)) (.cse24 (not .cse3)) (.cse27 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse13 (= 1 ~E_2~0)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0)) (.cse19 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse23 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (let ((.cse22 (+ ~local~0 2))) (and (= |old(~E_1~0)| ~E_1~0) (<= ~token~0 .cse22) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (<= 2 ~t2_st~0) (= 1 ~m_pc~0) (<= .cse22 ~token~0))) (< .cse23 |old(~token~0)|) .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 (not .cse19) .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse23))) (or .cse0 .cse1 .cse2 .cse26 .cse24 .cse27 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse20 .cse26 .cse24 .cse27 .cse4 .cse5 .cse6 .cse8 .cse25 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2018-12-08 08:25:04,275 INFO L444 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse11 (= ~T1_E~0 1)) (.cse2 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0))) (let ((.cse26 (= ~t1_pc~0 1)) (.cse36 (<= ~token~0 ~local~0)) (.cse30 (= 0 ~t1_st~0)) (.cse37 (<= ~local~0 ~token~0)) (.cse41 (= 1 ~t1_pc~0)) (.cse42 (not .cse5)) (.cse43 (not .cse2)) (.cse44 (not (= ~M_E~0 0))) (.cse39 (= ~m_i~0 1)) (.cse29 (<= 2 ~m_st~0)) (.cse45 (not (= ~E_2~0 1))) (.cse46 (not (= ~M_E~0 1))) (.cse47 (not (= ~E_M~0 1))) (.cse48 (not .cse11)) (.cse40 (= 1 ~t2_pc~0)) (.cse38 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse31 (not (= ~E_1~0 1))) (.cse35 (<= 2 ~t2_st~0)) (.cse49 (not .cse0)) (.cse33 (= 1 ~m_pc~0)) (.cse34 (not (= ~E_1~0 0)))) (let ((.cse16 (and .cse41 .cse42 .cse43 .cse44 .cse39 .cse29 (<= 2 ~t1_st~0) .cse45 .cse46 .cse47 .cse48 .cse40 .cse38 .cse31 .cse35 .cse49 .cse33 .cse34)) (.cse22 (and .cse41 .cse42 .cse43 .cse44 .cse39 .cse29 (not (= ~E_M~0 0)) .cse45 .cse46 .cse36 (= ~t2_i~0 1) (not (= ~E_2~0 0)) .cse47 .cse48 .cse40 (= ~t1_i~0 1) .cse30 .cse31 .cse35 .cse49 .cse33 .cse34 .cse37)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse9 (not .cse40)) (.cse25 (< 0 ~t2_pc~0)) (.cse23 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse26)) (.cse24 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse12 (not .cse39)) (.cse13 (= 1 |old(~E_1~0)|)) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse17 (= 0 |old(~E_1~0)|)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0)) (.cse15 (= 1 |old(~m_pc~0)|)) (.cse32 (= 0 ~t2_st~0))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse3 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< |old(~token~0)| .cse3))) (or .cse0 .cse1 .cse2 .cse23 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse15) (or .cse0 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse27 .cse8 .cse11 .cse12 .cse13 .cse28 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)) (or .cse0 .cse1 .cse2 .cse26 .cse5 (and .cse29 .cse30 .cse31 .cse35 .cse33 .cse34) .cse6 .cse7 .cse27 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15) (or .cse0 .cse2 .cse25 .cse23 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (and .cse29 .cse36 .cse30 .cse31 .cse32 .cse33 .cse34 .cse37) .cse28 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse15 (and .cse29 .cse38 .cse31 .cse32 .cse33 .cse34)))))) [2018-12-08 08:25:04,275 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1))) (let ((.cse7 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse20 (< 0 ~t2_pc~0)) (.cse22 (< |old(~local~0)| |old(~token~0)|)) (.cse23 (not .cse3)) (.cse24 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse13 (= 1 ~E_2~0)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0)) (.cse19 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse23 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse26 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse26 |old(~token~0)|) .cse23 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 (not .cse19) .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse26))) (or .cse0 .cse2 .cse20 .cse22 .cse23 .cse24 .cse4 .cse5 .cse6 .cse8 .cse25 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2018-12-08 08:25:04,276 INFO L444 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1))) (let ((.cse32 (= 0 ~t1_st~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse20 (<= 2 ~t2_st~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse29 (< 0 ~t2_pc~0)) (.cse3 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse30)) (.cse5 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~E_1~0)|)) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 1 ~E_2~0)) (.cse15 (= |old(~E_1~0)| ~E_1~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse33 (= 0 ~t2_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse23 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t1_i~0))) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~E_M~0)) (.cse27 (= 0 ~E_2~0)) (.cse28 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse2 .cse29 .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 (and .cse15 .cse16 .cse32 .cse33) .cse12 .cse13 .cse14 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 .cse32 .cse20) .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse13 .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse36 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (let ((.cse35 (+ ~local~0 2))) (and .cse15 (<= ~token~0 .cse35) .cse18 .cse19 .cse20 (= 1 ~m_pc~0) (<= .cse35 ~token~0))) (< .cse36 |old(~token~0)|) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 (not .cse28) .cse23 .cse24 .cse25 .cse26 .cse27 (< |old(~token~0)| .cse36))) (or .cse0 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse34 .cse22 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse21) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)))) [2018-12-08 08:25:04,276 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1))) (let ((.cse1 (< |old(~t2_st~0)| 2)) (.cse21 (<= 2 ~t2_st~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse29 (= 0 ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse32 (< 0 ~t2_pc~0)) (.cse3 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse30)) (.cse5 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~E_1~0)|)) (.cse33 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 1 ~E_2~0)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse18 (not (= ~m_pc~0 1))) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse34 (= 0 ~t2_st~0)) (.cse22 (not (= ~E_1~0 0))) (.cse23 (<= ~local~0 ~token~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 0 ~E_2~0)) (.cse27 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25 .cse26 .cse27) (let ((.cse28 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse28 |old(~token~0)|) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse19 .cse20 .cse21 (= 1 ~m_pc~0) .cse22 .cse23) .cse15 (not .cse27) .cse16 .cse17 .cse24 .cse25 .cse26 (< |old(~token~0)| .cse28))) (or .cse0 .cse1 .cse2 (and .cse18 .cse29 .cse21 .cse22) .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse32 .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 .cse12 .cse13 .cse14 .cse33 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 (and .cse18 .cse29 .cse34 .cse22) .cse27) (or .cse0 .cse2 .cse32 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse33 .cse15 .cse16 (and .cse18 .cse19 .cse20 .cse34 .cse22 .cse23) .cse17 .cse24 .cse25 .cse26 .cse27)))) [2018-12-08 08:25:04,277 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-12-08 08:25:04,277 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-12-08 08:25:04,278 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1))) (let ((.cse32 (= 0 ~t1_st~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse20 (<= 2 ~t2_st~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse29 (< 0 ~t2_pc~0)) (.cse3 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse30)) (.cse5 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~E_1~0)|)) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 1 ~E_2~0)) (.cse15 (= |old(~E_1~0)| ~E_1~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse33 (= 0 ~t2_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse23 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t1_i~0))) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~E_M~0)) (.cse27 (= 0 ~E_2~0)) (.cse28 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse2 .cse29 .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 (and .cse15 .cse16 .cse32 .cse33) .cse12 .cse13 .cse14 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 .cse32 .cse20) .cse30 .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse13 .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse36 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (let ((.cse35 (+ ~local~0 2))) (and .cse15 (<= ~token~0 .cse35) .cse18 .cse19 .cse20 (= 1 ~m_pc~0) (<= .cse35 ~token~0))) (< .cse36 |old(~token~0)|) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 (not .cse28) .cse23 .cse24 .cse25 .cse26 .cse27 (< |old(~token~0)| .cse36))) (or .cse0 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse34 .cse22 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse21) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)))) [2018-12-08 08:25:04,280 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-12-08 08:25:04,280 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (or (= ~T1_E~0 0) (< ~t2_st~0 2) (= ~T2_E~0 1) (not (= ~t1_pc~0 1)) (< ~m_st~0 2) (= ~T2_E~0 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= 1 ~E_M~0) (not (= 1 ~t2_pc~0)) (< ~t1_st~0 2) (= ~T1_E~0 1) (not (= ~m_i~0 1)) (= 1 ~E_1~0) (= 1 ~E_2~0) (not (= 1 ~m_pc~0)) (= 0 ~E_1~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 0 ~E_2~0) (= |old(~M_E~0)| ~M_E~0)) [2018-12-08 08:25:04,280 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-12-08 08:25:04,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 08:25:04,280 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= ~t1_st~0 |old(~t1_st~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0)) [2018-12-08 08:25:04,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 08:25:04,281 INFO L451 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-12-08 08:25:04,281 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-12-08 08:25:04,281 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-12-08 08:25:04,282 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-12-08 08:25:04,282 INFO L451 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-12-08 08:25:04,282 INFO L448 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-12-08 08:25:04,282 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-12-08 08:25:04,283 INFO L444 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse23 (= |old(~t1_pc~0)| 1)) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse27 (= 1 |old(~E_M~0)|)) (.cse28 (= ~T1_E~0 1)) (.cse29 (not (= ~m_i~0 1))) (.cse5 (= 1 |old(~E_1~0)|)) (.cse6 (= 1 |old(~E_2~0)|)) (.cse35 (= 1 |old(~m_pc~0)|)) (.cse32 (= 0 |old(~E_1~0)|)) (.cse7 (not (= 1 ~t1_i~0))) (.cse33 (not (= 1 ~t2_i~0))) (.cse34 (= 0 |old(~E_M~0)|)) (.cse8 (= 0 |old(~E_2~0)|))) (and (let ((.cse15 (= 1 ~t2_pc~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse20 (= ~token~0 |old(~token~0)|)) (.cse21 (<= ~token~0 ~local~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse10 (not (= ~E_2~0 1))) (.cse16 (not (= ~E_2~0 0))) (.cse11 (<= 2 ~t1_st~0)) (.cse22 (<= ~local~0 ~token~0)) (.cse24 (not (= ~t1_pc~0 1))) (.cse17 (= |old(~E_1~0)| ~E_1~0)) (.cse30 (<= ~t2_pc~0 0)) (.cse18 (not (= ~m_pc~0 1))) (.cse19 (= |old(~E_M~0)| ~E_M~0)) (.cse25 (= |old(~E_2~0)| ~E_2~0)) (.cse26 (= 0 ~t1_st~0)) (.cse31 (= 0 ~t2_st~0)) (.cse13 (= eval_~tmp~0 1))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) .cse2 .cse3 .cse4 (not (= |old(~t1_st~0)| 0)) .cse5 .cse6 .cse7 .cse8 (let ((.cse12 (+ ~local~0 2))) (and .cse9 .cse10 .cse11 (<= .cse12 ~token~0) .cse13 (and .cse14 .cse15 (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (= 1 ~m_pc~0) (not (= ~E_1~0 0)) .cse16 (not (= ~E_M~0 1))) (<= ~token~0 .cse12))) (< |old(~token~0)| |old(~local~0)|) (and (and .cse14 .cse17 .cse18 .cse10 .cse19 .cse16 .cse15 .cse9 .cse13) .cse20 .cse21 .cse11 .cse22) .cse23 (and .cse24 .cse17 .cse18 .cse19 .cse15 .cse25 .cse26 .cse9 .cse13) .cse27 .cse28 (not (= 0 |old(~m_st~0)|)) .cse29 (not (= 0 |old(~t2_st~0)|)) (and .cse20 .cse21 (and .cse14 .cse17 .cse30 .cse18 .cse10 .cse19 .cse16 .cse31 .cse13) .cse11 .cse22) (and .cse24 .cse17 .cse30 .cse18 .cse19 .cse25 .cse26 .cse31 .cse13) .cse32 .cse33 .cse34 .cse35)) (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse23) (< |old(~m_st~0)| 2) .cse2 .cse3 .cse4 .cse27 (not (= 1 |old(~t2_pc~0)|)) (< |old(~t1_st~0)| 2) .cse28 .cse29 .cse5 .cse6 (not .cse35) .cse32 .cse7 .cse33 .cse34 .cse8))) [2018-12-08 08:25:04,283 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-12-08 08:25:04,283 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-12-08 08:25:04,283 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-12-08 08:25:04,283 INFO L444 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse36 (= |old(~t1_pc~0)| 1)) (.cse20 (= 1 ~t1_pc~0)) (.cse6 (= |old(~E_1~0)| ~E_1~0)) (.cse19 (<= 2 ~m_st~0)) (.cse10 (= |old(~E_M~0)| ~E_M~0)) (.cse28 (= 1 ~t2_pc~0)) (.cse11 (= |old(~E_2~0)| ~E_2~0)) (.cse27 (<= 2 ~t2_st~0)) (.cse23 (= 1 ~m_pc~0)) (.cse2 (= ~T2_E~0 0)) (.cse15 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse37 (= 1 |old(~E_M~0)|)) (.cse38 (= ~T1_E~0 1)) (.cse39 (not (= ~m_i~0 1))) (.cse17 (= 1 |old(~E_1~0)|)) (.cse18 (= 1 |old(~E_2~0)|)) (.cse44 (= 1 |old(~m_pc~0)|)) (.cse41 (= 0 |old(~E_1~0)|)) (.cse32 (not (= 1 ~t1_i~0))) (.cse42 (not (= 1 ~t2_i~0))) (.cse43 (= 0 |old(~E_M~0)|)) (.cse33 (= 0 |old(~E_2~0)|))) (and (let ((.cse5 (not (= ~t1_pc~0 1))) (.cse13 (= 0 ~t1_st~0)) (.cse8 (<= ~t2_pc~0 0)) (.cse12 (= 0 ~t2_st~0)) (.cse29 (not (= ~E_M~0 0))) (.cse21 (not (= ~E_1~0 1))) (.cse24 (not (= ~E_1~0 0))) (.cse31 (not (= 0 eval_~tmp~0))) (.cse30 (not (= ~E_M~0 1))) (.cse3 (= ~token~0 |old(~token~0)|)) (.cse4 (<= ~token~0 ~local~0)) (.cse34 (<= 2 ~t1_st~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (not (= ~m_pc~0 1))) (.cse22 (not (= ~E_2~0 1))) (.cse25 (not (= ~E_2~0 0))) (.cse26 (= eval_~tmp~0 1)) (.cse14 (<= ~local~0 ~token~0))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) .cse2 (and .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) .cse15 .cse16 (not (= |old(~t1_st~0)| 0)) .cse17 .cse18 (and .cse4 .cse19 (and .cse20 .cse21 .cse12 .cse22 .cse23 .cse24 .cse10 .cse25) .cse13 .cse26 .cse8 .cse14) (and (and (and .cse27 (and .cse20 .cse28 .cse29 .cse21 .cse22 .cse23 .cse24 .cse25 .cse30) .cse19 .cse31) .cse13) .cse4 .cse14) .cse32 .cse33 (and .cse34 (and .cse20 .cse19 .cse8 .cse22 .cse10 .cse25 .cse21 .cse12 .cse23 .cse24 .cse26)) (and .cse5 .cse19 .cse8 .cse10 .cse11 .cse13 .cse21 .cse12 .cse23 .cse24 .cse26) (let ((.cse35 (+ ~local~0 2))) (and (and .cse20 .cse28 .cse7 .cse29 .cse21 .cse27 .cse22 .cse23 .cse24 .cse31 .cse25 .cse30) .cse34 (<= .cse35 ~token~0) (<= ~token~0 .cse35))) (< |old(~token~0)| |old(~local~0)|) .cse36 (and .cse5 .cse6 .cse7 .cse9 .cse4 .cse10 .cse28 .cse3 .cse11 .cse13 .cse27 .cse26 .cse14) (and .cse5 .cse19 .cse10 .cse28 .cse11 .cse13 .cse21 .cse27 .cse23 .cse24 .cse26) .cse37 .cse38 (not (= 0 |old(~m_st~0)|)) .cse39 (not (= 0 |old(~t2_st~0)|)) (let ((.cse40 (+ ~local~0 1))) (and (<= ~token~0 .cse40) (<= .cse40 ~token~0) (and .cse22 .cse19 (and .cse20 .cse28 .cse29 .cse12 .cse23 .cse24 .cse25 .cse30) .cse21 .cse31) .cse34)) (and .cse3 .cse4 .cse34 .cse14 (and .cse20 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse25 .cse12 .cse26)) .cse41 (and .cse34 (and .cse20 .cse28 .cse19 .cse29 .cse21 .cse27 .cse22 .cse23 .cse24 .cse31 .cse25 .cse30)) (and .cse3 .cse4 .cse34 (and .cse20 .cse6 .cse7 .cse9 .cse22 .cse10 .cse25 .cse28 .cse27 .cse26) .cse14) .cse42 .cse43 .cse44)) (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse36) (and (= ~t1_st~0 |old(~t1_st~0)|) (and .cse20 .cse6 .cse19 .cse10 .cse28 .cse11 .cse27 .cse23)) (< |old(~m_st~0)| 2) .cse2 .cse15 .cse16 .cse37 (not (= 1 |old(~t2_pc~0)|)) (< |old(~t1_st~0)| 2) .cse38 .cse39 .cse17 .cse18 (not .cse44) .cse41 .cse32 .cse42 .cse43 .cse33))) [2018-12-08 08:25:04,284 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-12-08 08:25:04,284 INFO L448 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-12-08 08:25:04,284 INFO L444 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse36 (= |old(~t1_pc~0)| 1)) (.cse20 (= 1 ~t1_pc~0)) (.cse6 (= |old(~E_1~0)| ~E_1~0)) (.cse19 (<= 2 ~m_st~0)) (.cse10 (= |old(~E_M~0)| ~E_M~0)) (.cse28 (= 1 ~t2_pc~0)) (.cse11 (= |old(~E_2~0)| ~E_2~0)) (.cse27 (<= 2 ~t2_st~0)) (.cse23 (= 1 ~m_pc~0)) (.cse2 (= ~T2_E~0 0)) (.cse15 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse37 (= 1 |old(~E_M~0)|)) (.cse38 (= ~T1_E~0 1)) (.cse39 (not (= ~m_i~0 1))) (.cse17 (= 1 |old(~E_1~0)|)) (.cse18 (= 1 |old(~E_2~0)|)) (.cse44 (= 1 |old(~m_pc~0)|)) (.cse41 (= 0 |old(~E_1~0)|)) (.cse32 (not (= 1 ~t1_i~0))) (.cse42 (not (= 1 ~t2_i~0))) (.cse43 (= 0 |old(~E_M~0)|)) (.cse33 (= 0 |old(~E_2~0)|))) (and (let ((.cse5 (not (= ~t1_pc~0 1))) (.cse13 (= 0 ~t1_st~0)) (.cse8 (<= ~t2_pc~0 0)) (.cse12 (= 0 ~t2_st~0)) (.cse29 (not (= ~E_M~0 0))) (.cse21 (not (= ~E_1~0 1))) (.cse24 (not (= ~E_1~0 0))) (.cse31 (not (= 0 eval_~tmp~0))) (.cse30 (not (= ~E_M~0 1))) (.cse3 (= ~token~0 |old(~token~0)|)) (.cse4 (<= ~token~0 ~local~0)) (.cse34 (<= 2 ~t1_st~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (not (= ~m_pc~0 1))) (.cse22 (not (= ~E_2~0 1))) (.cse25 (not (= ~E_2~0 0))) (.cse26 (= eval_~tmp~0 1)) (.cse14 (<= ~local~0 ~token~0))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) .cse2 (and .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) .cse15 .cse16 (not (= |old(~t1_st~0)| 0)) .cse17 .cse18 (and .cse4 .cse19 (and .cse20 .cse21 .cse12 .cse22 .cse23 .cse24 .cse10 .cse25) .cse13 .cse26 .cse8 .cse14) (and (and (and .cse27 (and .cse20 .cse28 .cse29 .cse21 .cse22 .cse23 .cse24 .cse25 .cse30) .cse19 .cse31) .cse13) .cse4 .cse14) .cse32 .cse33 (and .cse34 (and .cse20 .cse19 .cse8 .cse22 .cse10 .cse25 .cse21 .cse12 .cse23 .cse24 .cse26)) (and .cse5 .cse19 .cse8 .cse10 .cse11 .cse13 .cse21 .cse12 .cse23 .cse24 .cse26) (let ((.cse35 (+ ~local~0 2))) (and (and .cse20 .cse28 .cse7 .cse29 .cse21 .cse27 .cse22 .cse23 .cse24 .cse31 .cse25 .cse30) .cse34 (<= .cse35 ~token~0) (<= ~token~0 .cse35))) (< |old(~token~0)| |old(~local~0)|) .cse36 (and .cse5 .cse6 .cse7 .cse9 .cse4 .cse10 .cse28 .cse3 .cse11 .cse13 .cse27 .cse26 .cse14) (and .cse5 .cse19 .cse10 .cse28 .cse11 .cse13 .cse21 .cse27 .cse23 .cse24 .cse26) .cse37 .cse38 (not (= 0 |old(~m_st~0)|)) .cse39 (not (= 0 |old(~t2_st~0)|)) (let ((.cse40 (+ ~local~0 1))) (and (<= ~token~0 .cse40) (<= .cse40 ~token~0) (and .cse22 .cse19 (and .cse20 .cse28 .cse29 .cse12 .cse23 .cse24 .cse25 .cse30) .cse21 .cse31) .cse34)) (and .cse3 .cse4 .cse34 .cse14 (and .cse20 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse25 .cse12 .cse26)) .cse41 (and .cse34 (and .cse20 .cse28 .cse19 .cse29 .cse21 .cse27 .cse22 .cse23 .cse24 .cse31 .cse25 .cse30)) (and .cse3 .cse4 .cse34 (and .cse20 .cse6 .cse7 .cse9 .cse22 .cse10 .cse25 .cse28 .cse27 .cse26) .cse14) .cse42 .cse43 .cse44)) (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse36) (and (= ~t1_st~0 |old(~t1_st~0)|) (and .cse20 .cse6 .cse19 .cse10 .cse28 .cse11 .cse27 .cse23)) (< |old(~m_st~0)| 2) .cse2 .cse15 .cse16 .cse37 (not (= 1 |old(~t2_pc~0)|)) (< |old(~t1_st~0)| 2) .cse38 .cse39 .cse17 .cse18 (not .cse44) .cse41 .cse32 .cse42 .cse43 .cse33))) [2018-12-08 08:25:04,285 INFO L444 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse33 (= 1 |old(~E_M~0)|)) (.cse34 (= ~T1_E~0 1)) (.cse35 (not (= ~m_i~0 1))) (.cse25 (= 1 |old(~E_1~0)|)) (.cse26 (= 1 |old(~E_2~0)|)) (.cse39 (= 1 |old(~m_pc~0)|)) (.cse36 (= 0 |old(~E_1~0)|)) (.cse27 (not (= 1 ~t1_i~0))) (.cse37 (not (= 1 ~t2_i~0))) (.cse38 (= 0 |old(~E_M~0)|)) (.cse28 (= 0 |old(~E_2~0)|))) (and (let ((.cse16 (not (= ~t1_pc~0 1))) (.cse17 (= |old(~E_1~0)| ~E_1~0)) (.cse18 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse22 (= ~token~0 |old(~token~0)|)) (.cse9 (= |old(~E_2~0)| ~E_2~0)) (.cse15 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse21 (= 1 ~t2_pc~0)) (.cse20 (<= ~token~0 ~local~0)) (.cse24 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~m_st~0)) (.cse30 (= 1 ~t1_pc~0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (= 0 ~t2_st~0)) (.cse31 (not (= ~E_2~0 1))) (.cse12 (= 1 ~m_pc~0)) (.cse13 (not (= ~E_1~0 0))) (.cse7 (= |old(~E_M~0)| ~E_M~0)) (.cse32 (not (= ~E_2~0 0))) (.cse14 (= eval_~tmp~0 1)) (.cse6 (<= ~t2_pc~0 0)) (.cse8 (not (= ~t1_st~0 0)))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) .cse2 .cse3 .cse4 (not (= |old(~t1_st~0)| 0)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse7 .cse8 .cse21 .cse22 .cse9 .cse23 .cse14 .cse15 .cse24) .cse25 .cse26 .cse27 .cse28 (and .cse16 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse23 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse22 .cse9 .cse11 .cse14 .cse15 .cse24) (< |old(~token~0)| |old(~local~0)|) .cse29 (and (and (and .cse23 (and .cse30 .cse21 (not (= ~E_M~0 0)) .cse10 .cse31 .cse12 .cse13 .cse32 (not (= ~E_M~0 1))) .cse5 (not (= 0 eval_~tmp~0))) .cse8) .cse20 .cse24) (and .cse5 (and .cse30 .cse10 .cse11 .cse31 .cse12 .cse13 .cse7 .cse32) .cse14 .cse6 .cse8) .cse33 .cse34 (not (= 0 |old(~m_st~0)|)) .cse35 (not (= 0 |old(~t2_st~0)|)) .cse36 .cse37 .cse38 .cse39)) (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse29) (< |old(~m_st~0)| 2) .cse2 .cse3 .cse4 .cse33 (not (= 1 |old(~t2_pc~0)|)) (< |old(~t1_st~0)| 2) .cse34 .cse35 .cse25 .cse26 (not .cse39) .cse36 .cse27 .cse37 .cse38 .cse28))) [2018-12-08 08:25:04,287 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse10 (= 1 |old(~E_2~0)|)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse17 (= |old(~E_1~0)| ~E_1~0)) (.cse18 (= |old(~E_M~0)| ~E_M~0)) (.cse19 (= |old(~E_2~0)| ~E_2~0)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse11 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse2) (< |old(~m_st~0)| 2) .cse3 .cse4 .cse5 .cse6 (not (= 1 |old(~t2_pc~0)|)) (< |old(~t1_st~0)| 2) .cse7 .cse8 .cse9 .cse10 (not .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 (and (= 1 ~t1_pc~0) .cse17 (<= 2 ~m_st~0) .cse18 (= 1 ~t2_pc~0) .cse19 (= ~t1_st~0 |old(~t1_st~0)|) (<= 2 ~t2_st~0) (= 1 ~m_pc~0))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse2 .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 (not (= 0 |old(~t2_st~0)|)) .cse10 .cse12 (and (not (= ~t1_pc~0 1)) .cse17 (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (<= ~token~0 ~local~0) .cse18 (= ~token~0 |old(~token~0)|) .cse19 (= 0 ~t1_st~0) (= 0 ~t2_st~0) (<= ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 .cse11))) [2018-12-08 08:25:04,287 INFO L448 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-12-08 08:25:04,287 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-12-08 08:25:04,289 INFO L444 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse10 (= 1 |old(~E_2~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse16 (= 0 |old(~E_2~0)|)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse8 (not (= ~m_i~0 1))) (.cse12 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse11 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse2) (< |old(~m_st~0)| 2) .cse3 .cse4 .cse5 .cse6 (not (= 1 |old(~t2_pc~0)|)) (< |old(~t1_st~0)| 2) .cse7 .cse8 .cse9 .cse10 (not .cse11) .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse31 (not (= ~t1_pc~0 1))) (.cse25 (<= 2 ~m_st~0)) (.cse36 (= |old(~E_2~0)| ~E_2~0)) (.cse26 (= 0 ~t1_st~0)) (.cse18 (not (= ~E_1~0 1))) (.cse20 (= 1 ~m_pc~0)) (.cse21 (not (= ~E_1~0 0))) (.cse35 (= ~token~0 |old(~token~0)|)) (.cse24 (<= ~token~0 ~local~0)) (.cse30 (<= 2 ~t1_st~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse32 (= |old(~E_1~0)| ~E_1~0)) (.cse33 (= ~m_st~0 0)) (.cse28 (<= ~t2_pc~0 0)) (.cse34 (not (= ~m_pc~0 1))) (.cse19 (not (= ~E_2~0 1))) (.cse22 (= |old(~E_M~0)| ~E_M~0)) (.cse23 (not (= ~E_2~0 0))) (.cse27 (= eval_~tmp~0 1)) (.cse29 (<= ~local~0 ~token~0))) (or .cse0 (and (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse1 (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) (and (and .cse17 .cse25 .cse28 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23) .cse30) .cse9 (and .cse31 .cse32 .cse33 .cse28 .cse34 .cse24 .cse22 .cse35 .cse36 .cse26 .cse27 .cse29) .cse10 (let ((.cse37 (+ ~local~0 1))) (and (<= ~token~0 .cse37) (<= .cse37 ~token~0) .cse30 (and .cse19 (= 1 ~t2_pc~0) .cse25 (and .cse17 (not (= ~E_M~0 0)) .cse20 .cse21 .cse23 (not (= ~E_M~0 1))) .cse18 (not (= 0 eval_~tmp~0))))) .cse13 .cse16 (< |old(~token~0)| |old(~local~0)|) .cse2 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) (and .cse31 .cse25 .cse28 .cse22 .cse36 .cse26 .cse18 .cse20 .cse21 .cse27) .cse8 (not (= 0 |old(~t2_st~0)|)) (and .cse35 .cse24 .cse30 (and .cse17 .cse32 .cse33 .cse28 .cse34 .cse19 .cse22 .cse23 .cse27) .cse29) .cse12 .cse14 .cse15 .cse11)))) [2018-12-08 08:25:04,289 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-12-08 08:25:04,289 INFO L448 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-12-08 08:25:04,289 INFO L444 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse9 (= |old(~t1_pc~0)| 1)) (.cse2 (= ~T2_E~0 0)) (.cse10 (= 1 ~t1_pc~0)) (.cse12 (<= 2 ~m_st~0)) (.cse11 (= 1 ~t2_pc~0)) (.cse13 (<= 2 ~t2_st~0)) (.cse14 (= 1 ~m_pc~0)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse15 (= 1 |old(~E_M~0)|)) (.cse16 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse5 (= 1 |old(~E_1~0)|)) (.cse6 (= 1 |old(~E_2~0)|)) (.cse21 (= 1 |old(~m_pc~0)|)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse7 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|)) (.cse8 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) .cse2 .cse3 .cse4 (not (= |old(~t1_st~0)| 0)) .cse5 .cse6 .cse7 .cse8 (< |old(~token~0)| |old(~local~0)|) .cse9 (and .cse10 .cse11 .cse12 (not (= ~E_M~0 0)) (<= 2 ~t1_st~0) (not (= ~E_1~0 1)) .cse13 (not (= ~E_2~0 1)) .cse14 (not (= ~E_1~0 0)) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))) .cse15 .cse16 (not (= 0 |old(~m_st~0)|)) .cse17 (not (= 0 |old(~t2_st~0)|)) .cse18 .cse19 .cse20 .cse21) (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse9) (< |old(~m_st~0)| 2) .cse2 (and .cse10 (= |old(~E_1~0)| ~E_1~0) .cse12 (= |old(~E_M~0)| ~E_M~0) .cse11 (= |old(~E_2~0)| ~E_2~0) (= ~t1_st~0 |old(~t1_st~0)|) .cse13 .cse14) .cse3 .cse4 .cse15 (not (= 1 |old(~t2_pc~0)|)) (< |old(~t1_st~0)| 2) .cse16 .cse17 .cse5 .cse6 (not .cse21) .cse18 .cse7 .cse19 .cse20 .cse8))) [2018-12-08 08:25:04,290 INFO L448 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-12-08 08:25:04,290 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-12-08 08:25:04,291 INFO L444 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse22 (= ~t1_pc~0 1)) (.cse20 (= 1 ~m_pc~0)) (.cse31 (= ~t1_st~0 0)) (.cse28 (= 1 ~E_1~0))) (let ((.cse3 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse11 (not .cse28)) (.cse8 (not .cse31)) (.cse2 (< 0 ~t2_pc~0)) (.cse13 (not (= 0 ~t2_st~0))) (.cse27 (< ~m_st~0 2)) (.cse29 (not .cse20)) (.cse25 (< ~t1_st~0 2)) (.cse15 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse21 (< ~t2_st~0 2)) (.cse14 (= 1 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse26 (not .cse22)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse23 (not (= 1 ~t2_pc~0))) (.cse10 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse24 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse15 .cse10 .cse12 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse25 (or .cse0 .cse1 .cse26 .cse27 .cse5 .cse6 .cse7 .cse23 .cse10 .cse12 .cse28 .cse14 .cse29 .cse24 .cse16 .cse17 .cse18 .cse19) .cse15) (or .cse0 .cse21 .cse1 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse15 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19) (or .cse15 .cse0 .cse21 .cse1 .cse26 .cse27 .cse5 .cse6 .cse9 .cse23 .cse25 .cse10 .cse12 .cse28 .cse14 .cse29 .cse24 .cse16 .cse17 .cse18 .cse19) (or .cse25 .cse15 .cse14 .cse2 (or .cse0 .cse1 .cse26 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse0 .cse1 .cse2 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse30 (+ ~local~0 2))) (or (not .cse9) .cse0 .cse1 (< .cse30 ~token~0) .cse26 .cse5 .cse6 .cse7 .cse23 .cse25 .cse10 (not (= 0 ~m_st~0)) .cse12 .cse28 .cse14 .cse29 .cse24 .cse16 .cse17 .cse19 .cse15 (< ~token~0 .cse30))) (or .cse0 .cse1 .cse2 .cse26 .cse15 .cse27 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse28 .cse13 .cse29 .cse24 .cse16 .cse17 .cse18 .cse19 .cse31) (let ((.cse32 (+ ~local~0 1))) (or .cse0 .cse21 .cse1 .cse26 .cse27 .cse5 .cse6 .cse14 .cse7 .cse9 .cse23 .cse10 (< ~token~0 .cse32) .cse12 .cse28 .cse29 .cse24 .cse16 .cse17 (< .cse32 ~token~0) .cse18 .cse19 .cse31 .cse15)) (or .cse25 .cse15 .cse21 .cse14 (or .cse0 .cse1 .cse26 .cse5 .cse6 .cse7 .cse9 .cse23 .cse10 .cse12 .cse24 .cse16 .cse17 .cse18 .cse19))))) [2018-12-08 08:25:04,293 INFO L451 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-12-08 08:25:04,293 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-12-08 08:25:04,293 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-12-08 08:25:04,294 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-12-08 08:25:04,294 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= |old(~T2_E~0)| 0)) (.cse4 (= 0 |old(~M_E~0)|)) (.cse5 (= 1 |old(~M_E~0)|)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse10 (= 1 |old(~E_2~0)|)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse17 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse11 (= 1 ~m_pc~0))) (and (or .cse0 (< ~t2_st~0 2) .cse1 (not .cse2) (< ~m_st~0 2) .cse3 .cse4 .cse5 .cse6 (not (= 1 ~t2_pc~0)) (< ~t1_st~0 2) .cse7 .cse8 .cse9 .cse10 (not .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 (< 0 ~t2_pc~0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 (not (= 0 ~m_st~0)) .cse8 .cse9 (not (= 0 ~t2_st~0)) .cse10 .cse12 .cse17 .cse13 .cse14 .cse15 .cse16 .cse11))) [2018-12-08 08:25:04,296 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-12-08 08:25:04,296 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-12-08 08:25:04,296 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-12-08 08:25:04,296 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-12-08 08:25:04,296 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-12-08 08:25:04,296 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-12-08 08:25:04,296 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-12-08 08:25:04,296 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse2 (= |old(~T2_E~0)| ~T2_E~0)) (.cse0 (not (= ~M_E~0 1))) (.cse1 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (and (not (= ~t1_pc~0 1)) (= ~m_st~0 0) .cse0 .cse1 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) (= ~t1_st~0 |old(~t1_st~0)|) (<= ~t2_pc~0 0) .cse2 .cse3 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and .cse2 (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) .cse0 (= 1 ~m_pc~0) .cse1) .cse3 (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-12-08 08:25:04,296 INFO L444 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,299 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-12-08 08:25:04,299 INFO L444 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,299 INFO L444 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (= 1 ~m_pc~0) (and (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_M~0 1))))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,299 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-12-08 08:25:04,299 INFO L444 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,303 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-08 08:25:04,303 INFO L444 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,304 INFO L444 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (not (= ~M_E~0 0)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,304 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,304 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-08 08:25:04,304 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-12-08 08:25:04,304 INFO L448 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-12-08 08:25:04,307 INFO L444 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,307 INFO L444 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,307 INFO L444 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,307 INFO L444 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,308 INFO L444 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (= 1 ~m_pc~0) (and (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_M~0 1))))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,309 INFO L444 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,309 INFO L444 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,309 INFO L444 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,310 INFO L444 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (= 1 |old(~m_pc~0)|)) [2018-12-08 08:25:04,310 INFO L448 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-12-08 08:25:04,311 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse2 (= |old(~T2_E~0)| ~T2_E~0)) (.cse0 (not (= ~M_E~0 1))) (.cse1 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< 0 |old(~t2_pc~0)|) (< |old(~local~0)| |old(~token~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (and (not (= ~t1_pc~0 1)) (= ~m_st~0 0) .cse0 .cse1 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) (= ~t1_st~0 |old(~t1_st~0)|) (<= ~t2_pc~0 0) .cse2 .cse3 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and .cse2 (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) .cse0 (= 1 ~m_pc~0) .cse1) .cse3 (not (= ~E_M~0 1)))) (<= 2 ~t1_st~0)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-12-08 08:25:04,311 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-12-08 08:25:04,311 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-12-08 08:25:04,311 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-12-08 08:25:04,311 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-12-08 08:25:04,311 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-12-08 08:25:04,311 INFO L448 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-12-08 08:25:04,311 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-12-08 08:25:04,311 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-12-08 08:25:04,311 INFO L444 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse19 (= 1 ~m_pc~0)) (.cse3 (= ~t1_pc~0 1)) (.cse31 (= ~t1_st~0 0))) (let ((.cse8 (not .cse31)) (.cse28 (< ~local~0 ~token~0)) (.cse29 (< ~token~0 ~local~0)) (.cse27 (< ~t2_st~0 2)) (.cse23 (not (= 1 ~t2_pc~0))) (.cse24 (< ~t1_st~0 2)) (.cse13 (= 1 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< 0 ~t2_pc~0)) (.cse21 (not .cse3)) (.cse22 (< ~m_st~0 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse4 (= 0 is_master_triggered_~__retres1~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse25 (= 1 ~E_1~0)) (.cse12 (not (= 0 ~t2_st~0))) (.cse26 (not .cse19)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse20 (+ ~local~0 2))) (or .cse0 .cse1 (< .cse20 ~token~0) .cse21 .cse9 .cse22 .cse5 .cse6 .cse7 .cse23 .cse24 .cse10 .cse11 .cse25 .cse13 .cse26 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~token~0 .cse20))) (or .cse0 .cse27 .cse1 .cse28 .cse21 .cse29 .cse5 .cse6 .cse7 .cse9 .cse23 .cse24 .cse10 .cse4 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse30 (+ ~local~0 1))) (or .cse0 .cse27 .cse1 .cse21 .cse22 .cse5 .cse6 .cse7 .cse9 .cse23 .cse10 .cse4 (< ~token~0 .cse30) .cse11 .cse25 .cse26 .cse14 .cse15 .cse16 (< .cse30 ~token~0) .cse17 .cse18 .cse31)) (or .cse0 .cse27 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse13 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse4 .cse0 .cse1 .cse2 .cse28 .cse21 .cse29 .cse5 .cse6 .cse7 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse27 .cse1 .cse21 .cse22 .cse5 .cse6 .cse9 .cse23 .cse24 .cse10 .cse11 .cse25 .cse13 .cse26 .cse14 .cse15 .cse4 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse21 .cse22 .cse5 .cse6 .cse7 .cse4 .cse9 .cse10 .cse11 .cse25 .cse12 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31)))) [2018-12-08 08:25:04,313 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-12-08 08:25:04,313 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 08:25:04,313 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (not (= ~T1_E~0 1)) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~T2_E~0 1)) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (= 0 ~t1_st~0) (<= ~t2_pc~0 0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (= 0 ~t2_st~0) (not (= ~E_2~0 1)) (not (= ~T1_E~0 0)) (not (= ~m_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~M_E~0 1)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (<= ~local~0 ~token~0) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))) [2018-12-08 08:25:04,313 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 08:25:04,313 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 08:25:04,313 INFO L448 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-12-08 08:25:04,313 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-12-08 08:25:04,313 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-12-08 08:25:04,313 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-12-08 08:25:04,313 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-12-08 08:25:04,313 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< ~t2_st~0 2) (= |old(~T2_E~0)| 1) (not (= ~t1_pc~0 1)) (< ~m_st~0 2) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0)) (= 1 |old(~E_M~0)|) (not (= 1 ~t2_pc~0)) (< ~t1_st~0 2) (= |old(~T1_E~0)| 1) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~m_pc~0)) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|)) [2018-12-08 08:25:04,315 INFO L448 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-12-08 08:25:04,315 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-12-08 08:25:04,315 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-12-08 08:25:04,315 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-12-08 08:25:04,315 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: (or (= ~T1_E~0 0) (= 1 |old(~t2_i~0)|) (= ~T2_E~0 1) (< 0 ~t2_pc~0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (= |old(~m_i~0)| 1) (not (= ~t1_st~0 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (= 1 ~E_1~0) (not (= 0 ~t2_st~0)) (= 1 ~E_2~0) (= 0 ~E_1~0) (= 0 ~E_M~0) (= 0 ~E_2~0) (and (not (= ~t1_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~m_i~0 1))) (= 1 ~m_pc~0)) [2018-12-08 08:25:04,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:25:04 BoogieIcfgContainer [2018-12-08 08:25:04,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 08:25:04,366 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:25:04,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:25:04,366 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:25:04,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:24:20" (3/4) ... [2018-12-08 08:25:04,369 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 08:25:04,373 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-12-08 08:25:04,373 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-08 08:25:04,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-12-08 08:25:04,375 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-12-08 08:25:04,375 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-08 08:25:04,380 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-08 08:25:04,380 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 08:25:04,398 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || ((((((((((\old(E_1) == E_1 && token == \old(token)) && \old(E_2) == E_2) && ((((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && t1_st == \old(t1_st)) && t2_pc <= 0) && \old(T2_E) == T2_E) && \old(T1_E) == T1_E) && token <= local) && local <= token) && \old(E_M) == E_M)) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((2 <= t2_st && 2 <= m_st) && (!(E_2 == 1) && !(E_1 == 1)) && ((\old(T2_E) == T2_E && (((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(T1_E) == T1_E) && !(E_M == 1)) && 2 <= t1_st)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc) [2018-12-08 08:25:04,398 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || !(M_E == 0)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) [2018-12-08 08:25:04,398 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || T2_E == 0) || ((((token == \old(token) && token <= local) && ((((((!(t1_pc == 1) && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t2_st) && 0 == t1_st) && local <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((((token <= local && 2 <= m_st) && ((((((1 == t1_pc && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && 0 == t1_st) && tmp == 1) && t2_pc <= 0) && local <= token)) || ((((((2 <= t2_st && (((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && !(E_1 == 1)) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= m_st) && !(0 == tmp)) && 0 == t1_st) && token <= local) && local <= token)) || !(1 == t1_i)) || 0 == \old(E_2)) || (2 <= t1_st && (((((((((1 == t1_pc && 2 <= m_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && tmp == 1)) || ((((((((((!(t1_pc == 1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && tmp == 1)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(E_M == 0)) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(0 == tmp)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || ((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && tmp == 1) && local <= token)) || ((((((((((!(t1_pc == 1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0)) && tmp == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((token <= local + 1 && local + 1 <= token) && (((!(E_2 == 1) && 2 <= m_st) && ((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(0 == tmp)) && 2 <= t1_st)) || ((((token == \old(token) && token <= local) && 2 <= t1_st) && local <= token) && ((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && 0 == t2_st) && tmp == 1)) || 0 == \old(E_1)) || (2 <= t1_st && ((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(0 == tmp)) && !(E_2 == 0)) && !(E_M == 1))) || ((((token == \old(token) && token <= local) && 2 <= t1_st) && ((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && 2 <= t2_st) && tmp == 1) && local <= token)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || (t1_st == \old(t1_st) && ((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) [2018-12-08 08:25:04,398 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) [2018-12-08 08:25:04,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 0 == t2_st)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 2 <= t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-12-08 08:25:04,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || (((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || \old(token) < \old(local) + 2) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || (((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) [2018-12-08 08:25:04,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-12-08 08:25:04,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((2 <= m_st && t1_st == \old(t1_st)) && 0 == t2_st) && !(E_2 == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || (((((\old(E_2) == E_2 && t1_st == \old(t1_st)) && 0 == t2_st) && token <= local) && ((((!(T1_E == 0) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && local <= token)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || ((((2 <= m_st && t1_st == \old(t1_st)) && 2 <= t2_st) && !(E_2 == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || ((((((2 <= m_st && t1_st == \old(t1_st)) && 0 == t2_st) && !(E_2 == 1)) && token <= \old(token) + 1) && local + 1 <= token) && (((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(E_2) == E_2) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((2 <= m_st && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || (((((\old(E_2) == E_2 && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && ((((!(T1_E == 0) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) [2018-12-08 08:25:04,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || (((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && 0 == t2_st) && local + 1 <= token)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t2_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st)) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(E_2) == E_2) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || ((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && \old(E_2) == E_2) && 2 <= t2_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) [2018-12-08 08:25:04,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || ((((1 == t1_pc && 2 <= m_st) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || \old(t1_st) == 0) [2018-12-08 08:25:04,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || ((((1 == t2_pc && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_M == 0)) && !(E_M == 1))) || \old(m_st) < 2) || T2_E == 0) || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && local + 2 <= token)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((((((2 <= m_st && t2_pc <= 0) && \old(E_M) == E_M) && 0 == t1_st) || T1_E == 0) || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || (((2 <= m_st && t1_st == \old(t1_st)) && t2_pc <= 0) && \old(E_M) == E_M)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || (((((2 <= m_st && t2_pc <= 0) && token <= local) && 0 == t1_st) && local <= token) && \old(E_M) == E_M)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((m_st == 0 && t1_st == \old(t1_st)) && t2_pc <= 0) && token <= local) && local <= token) && \old(E_M) == E_M)) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || ((((t2_pc <= 0 && token <= local) && m_st == 0 && 0 == t1_st) && local <= token) && \old(E_M) == E_M)) || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) [2018-12-08 08:25:04,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && (((((((((((((((((((((((((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) || T1_E == 0) || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && 0 == t1_st) && 2 <= t2_st)) || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) [2018-12-08 08:25:04,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st))) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) [2018-12-08 08:25:04,427 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_900b7b0e-17a4-4b45-8c02-f8602f1dee15/bin-2019/uautomizer/witness.graphml [2018-12-08 08:25:04,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:25:04,427 INFO L168 Benchmark]: Toolchain (without parser) took 44638.60 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 960.3 MB in the beginning and 862.9 MB in the end (delta: 97.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-08 08:25:04,428 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:25:04,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-12-08 08:25:04,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.73 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 08:25:04,428 INFO L168 Benchmark]: Boogie Preprocessor took 20.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:25:04,428 INFO L168 Benchmark]: RCFGBuilder took 283.48 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-08 08:25:04,429 INFO L168 Benchmark]: TraceAbstraction took 44029.83 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 862.9 MB in the end (delta: 218.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-08 08:25:04,429 INFO L168 Benchmark]: Witness Printer took 60.80 ms. Allocated memory is still 3.1 GB. Free memory is still 862.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:25:04,430 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.73 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 283.48 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44029.83 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 862.9 MB in the end (delta: 218.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 60.80 ms. Allocated memory is still 3.1 GB. Free memory is still 862.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || ((((1 == t2_pc && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_M == 0)) && !(E_M == 1))) || \old(m_st) < 2) || T2_E == 0) || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && local + 2 <= token)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((((((2 <= m_st && t2_pc <= 0) && \old(E_M) == E_M) && 0 == t1_st) || T1_E == 0) || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || (((2 <= m_st && t1_st == \old(t1_st)) && t2_pc <= 0) && \old(E_M) == E_M)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || (((((2 <= m_st && t2_pc <= 0) && token <= local) && 0 == t1_st) && local <= token) && \old(E_M) == E_M)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((m_st == 0 && t1_st == \old(t1_st)) && t2_pc <= 0) && token <= local) && local <= token) && \old(E_M) == E_M)) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || ((((t2_pc <= 0 && token <= local) && m_st == 0 && 0 == t1_st) && local <= token) && \old(E_M) == E_M)) || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((t1_st < 2 || ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || 0 == __retres1) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((t1_st < 2 || 0 == __retres1) || 1 == E_2) || 0 < t2_pc) || ((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || 0 == __retres1) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_2) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1)) && ((((t1_st < 2 || 0 == __retres1) || t2_st < 2) || 1 == E_2) || (((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || (((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && 0 == t2_st) && local + 1 <= token)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t2_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st)) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(E_2) == E_2) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || ((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && \old(E_2) == E_2) && 2 <= t2_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || ((((1 == t1_pc && 2 <= m_st) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || \old(t1_st) == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((2 <= m_st && t1_st == \old(t1_st)) && 0 == t2_st) && !(E_2 == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || (((((\old(E_2) == E_2 && t1_st == \old(t1_st)) && 0 == t2_st) && token <= local) && ((((!(T1_E == 0) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && local <= token)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || ((((2 <= m_st && t1_st == \old(t1_st)) && 2 <= t2_st) && !(E_2 == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || ((((((2 <= m_st && t1_st == \old(t1_st)) && 0 == t2_st) && !(E_2 == 1)) && token <= \old(token) + 1) && local + 1 <= token) && (((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(E_2) == E_2) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((2 <= m_st && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || (((((\old(E_2) == E_2 && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && ((((!(T1_E == 0) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || !(M_E == 0)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 0 == __retres1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == __retres1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == __retres1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 0 == t2_st)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 2 <= t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || ((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || (((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || \old(token) < \old(local) + 2) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || (((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == __retres1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || 1 == E_1) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((t1_st < 2 || ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || 0 == __retres1) || token < local + 2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((T1_E == 0 || t2_st < 2) || __retres1 == 1) || T2_E == 1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 1) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || __retres1 == 1) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 1) || token < local + 2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || __retres1 == 1) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || __retres1 == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || __retres1 == 1) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((__retres1 == 1 || T1_E == 0) || T2_E == 1) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 1) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || token < local) || __retres1 == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && (((((((((((((((((((((((((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) || T1_E == 0) || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && 0 == t1_st) && 2 <= t2_st)) || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st))) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || T2_E == 0) || ((((token == \old(token) && token <= local) && ((((((!(t1_pc == 1) && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t2_st) && 0 == t1_st) && local <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((((token <= local && 2 <= m_st) && ((((((1 == t1_pc && !(E_1 == 1)) && 0 == t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && \old(E_M) == E_M) && !(E_2 == 0)) && 0 == t1_st) && tmp == 1) && t2_pc <= 0) && local <= token)) || ((((((2 <= t2_st && (((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && !(E_1 == 1)) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= m_st) && !(0 == tmp)) && 0 == t1_st) && token <= local) && local <= token)) || !(1 == t1_i)) || 0 == \old(E_2)) || (2 <= t1_st && (((((((((1 == t1_pc && 2 <= m_st) && t2_pc <= 0) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && tmp == 1)) || ((((((((((!(t1_pc == 1) && 2 <= m_st) && t2_pc <= 0) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && tmp == 1)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(E_M == 0)) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(0 == tmp)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || ((((((((((((!(t1_pc == 1) && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && tmp == 1) && local <= token)) || ((((((((((!(t1_pc == 1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0)) && tmp == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || (((token <= local + 1 && local + 1 <= token) && (((!(E_2 == 1) && 2 <= m_st) && ((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(0 == tmp)) && 2 <= t1_st)) || ((((token == \old(token) && token <= local) && 2 <= t1_st) && local <= token) && ((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && 0 == t2_st) && tmp == 1)) || 0 == \old(E_1)) || (2 <= t1_st && ((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(0 == tmp)) && !(E_2 == 0)) && !(E_M == 1))) || ((((token == \old(token) && token <= local) && 2 <= t1_st) && ((((((((1 == t1_pc && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && !(E_2 == 1)) && \old(E_M) == E_M) && !(E_2 == 0)) && 1 == t2_pc) && 2 <= t2_st) && tmp == 1) && local <= token)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || (t1_st == \old(t1_st) && ((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 2 <= t2_st) && 1 == m_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || 0 < \old(t2_pc)) || \old(local) < \old(token)) || ((((((((((\old(E_1) == E_1 && token == \old(token)) && \old(E_2) == E_2) && ((((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && t1_st == \old(t1_st)) && t2_pc <= 0) && \old(T2_E) == T2_E) && \old(T1_E) == T1_E) && token <= local) && local <= token) && \old(E_M) == E_M)) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((2 <= t2_st && 2 <= m_st) && (!(E_2 == 1) && !(E_1 == 1)) && ((\old(T2_E) == T2_E && (((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(T1_E) == T1_E) && !(E_M == 1)) && 2 <= t1_st)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 43.9s OverallTime, 26 OverallIterations, 7 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 29.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 6591 SDtfs, 8323 SDslu, 9096 SDs, 0 SdLazy, 5065 SolverSat, 2146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1905 GetRequests, 1731 SyntacticMatches, 40 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6114occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 2376 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 22861 PreInvPairs, 23060 NumberOfFragments, 21877 HoareAnnotationTreeSize, 22861 FomulaSimplifications, 73268 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 71 FomulaSimplificationsInter, 69284 FormulaSimplificationTreeSizeReductionInter, 27.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 5690 NumberOfCodeBlocks, 5690 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5656 ConstructedInterpolants, 0 QuantifiedInterpolants, 1423310 SizeOfPredicates, 6 NumberOfNonLiveVariables, 7330 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 34 InterpolantComputations, 26 PerfectInterpolantSequences, 2952/3064 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...