./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_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan --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 Taipan --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-09 09:13:18,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:13:18,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:13:18,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:13:18,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:13:18,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:13:18,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:13:18,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:13:18,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:13:18,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:13:18,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:13:18,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:13:18,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:13:18,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:13:18,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:13:18,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:13:18,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:13:18,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:13:18,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:13:18,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:13:18,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:13:18,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:13:18,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:13:18,378 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:13:18,378 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:13:18,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:13:18,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:13:18,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:13:18,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:13:18,380 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:13:18,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:13:18,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:13:18,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:13:18,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:13:18,381 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:13:18,381 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:13:18,382 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:13:18,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:13:18,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:13:18,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:13:18,389 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:13:18,389 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:13:18,389 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:13:18,389 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:13:18,390 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:13:18,390 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:13:18,390 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:13:18,390 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:13:18,390 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:13:18,390 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:13:18,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:13:18,390 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:13:18,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:13:18,391 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:13:18,391 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:13:18,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:13:18,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:13:18,392 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:13:18,392 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:13:18,392 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:13:18,392 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:13:18,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:13:18,392 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:13:18,392 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan 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 -> Taipan 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-09 09:13:18,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:13:18,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:13:18,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:13:18,418 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:13:18,418 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:13:18,419 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-09 09:13:18,454 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/data/004c33f2e/026e197fe47e42c6a718b57601d3478a/FLAG5f73affc4 [2018-12-09 09:13:18,748 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:13:18,748 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-09 09:13:18,754 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/data/004c33f2e/026e197fe47e42c6a718b57601d3478a/FLAG5f73affc4 [2018-12-09 09:13:18,762 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/data/004c33f2e/026e197fe47e42c6a718b57601d3478a [2018-12-09 09:13:18,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:13:18,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:13:18,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:13:18,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:13:18,768 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:13:18,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c40e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18, skipping insertion in model container [2018-12-09 09:13:18,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:13:18,790 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:13:18,897 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:13:18,900 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:13:18,922 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:13:18,932 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:13:18,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18 WrapperNode [2018-12-09 09:13:18,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:13:18,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:13:18,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:13:18,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:13:18,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:13:18,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:13:18,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:13:18,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:13:18,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... [2018-12-09 09:13:18,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:13:18,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:13:18,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:13:18,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:13:18,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:13:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-09 09:13:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-09 09:13:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-12-09 09:13:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-12-09 09:13:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:13:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:13:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-09 09:13:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-09 09:13:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-09 09:13:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-09 09:13:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-12-09 09:13:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-12-09 09:13:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-09 09:13:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-09 09:13:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-09 09:13:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-09 09:13:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-09 09:13:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-09 09:13:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-09 09:13:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-09 09:13:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-09 09:13:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-09 09:13:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-09 09:13:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-09 09:13:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-09 09:13:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-09 09:13:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-09 09:13:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-09 09:13:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-09 09:13:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-09 09:13:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-09 09:13:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-09 09:13:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-09 09:13:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-09 09:13:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:13:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:13:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-09 09:13:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-09 09:13:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-09 09:13:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-09 09:13:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-09 09:13:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-09 09:13:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:13:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:13:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-09 09:13:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-09 09:13:19,288 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:13:19,288 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 09:13:19,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:13:19 BoogieIcfgContainer [2018-12-09 09:13:19,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:13:19,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:13:19,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:13:19,291 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:13:19,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:13:18" (1/3) ... [2018-12-09 09:13:19,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e9bb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:13:19, skipping insertion in model container [2018-12-09 09:13:19,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:13:18" (2/3) ... [2018-12-09 09:13:19,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e9bb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:13:19, skipping insertion in model container [2018-12-09 09:13:19,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:13:19" (3/3) ... [2018-12-09 09:13:19,293 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-09 09:13:19,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:13:19,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:13:19,312 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:13:19,331 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:13:19,331 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:13:19,331 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:13:19,332 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:13:19,332 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:13:19,332 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:13:19,332 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:13:19,332 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:13:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-12-09 09:13:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:13:19,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:19,350 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-09 09:13:19,352 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:19,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash -698129678, now seen corresponding path program 1 times [2018-12-09 09:13:19,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:19,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:19,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:19,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:19,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:19,539 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-09 09:13:19,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:19,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:13:19,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:19,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:13:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:13:19,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:13:19,555 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2018-12-09 09:13:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:19,843 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2018-12-09 09:13:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:13:19,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 09:13:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:19,852 INFO L225 Difference]: With dead ends: 361 [2018-12-09 09:13:19,853 INFO L226 Difference]: Without dead ends: 195 [2018-12-09 09:13:19,855 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-09 09:13:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-09 09:13:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-12-09 09:13:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-09 09:13:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2018-12-09 09:13:19,896 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2018-12-09 09:13:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:19,896 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2018-12-09 09:13:19,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:13:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2018-12-09 09:13:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:13:19,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:19,898 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-09 09:13:19,899 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:19,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1190755852, now seen corresponding path program 1 times [2018-12-09 09:13:19,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:19,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:19,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:19,960 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-09 09:13:19,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:19,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:13:19,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:19,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:13:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:13:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:13:19,962 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2018-12-09 09:13:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:20,209 INFO L93 Difference]: Finished difference Result 340 states and 474 transitions. [2018-12-09 09:13:20,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:13:20,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 09:13:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:20,211 INFO L225 Difference]: With dead ends: 340 [2018-12-09 09:13:20,211 INFO L226 Difference]: Without dead ends: 195 [2018-12-09 09:13:20,212 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-09 09:13:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-09 09:13:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-12-09 09:13:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-09 09:13:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2018-12-09 09:13:20,225 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2018-12-09 09:13:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:20,225 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2018-12-09 09:13:20,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:13:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2018-12-09 09:13:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:13:20,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:20,226 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-09 09:13:20,227 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:20,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash -236815694, now seen corresponding path program 1 times [2018-12-09 09:13:20,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:20,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:20,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:20,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:20,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:20,287 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-09 09:13:20,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:20,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:13:20,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:20,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:13:20,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:13:20,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:13:20,288 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2018-12-09 09:13:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:20,497 INFO L93 Difference]: Finished difference Result 338 states and 468 transitions. [2018-12-09 09:13:20,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:13:20,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 09:13:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:20,499 INFO L225 Difference]: With dead ends: 338 [2018-12-09 09:13:20,499 INFO L226 Difference]: Without dead ends: 193 [2018-12-09 09:13:20,500 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-09 09:13:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-09 09:13:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2018-12-09 09:13:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-09 09:13:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2018-12-09 09:13:20,512 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2018-12-09 09:13:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:20,512 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2018-12-09 09:13:20,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:13:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2018-12-09 09:13:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:13:20,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:20,520 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-09 09:13:20,520 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:20,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1452969420, now seen corresponding path program 1 times [2018-12-09 09:13:20,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:20,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:20,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:20,564 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-09 09:13:20,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:20,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:13:20,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:20,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:13:20,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:13:20,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:13:20,565 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2018-12-09 09:13:20,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:20,739 INFO L93 Difference]: Finished difference Result 355 states and 494 transitions. [2018-12-09 09:13:20,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:13:20,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 09:13:20,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:20,741 INFO L225 Difference]: With dead ends: 355 [2018-12-09 09:13:20,741 INFO L226 Difference]: Without dead ends: 210 [2018-12-09 09:13:20,741 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-09 09:13:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-09 09:13:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2018-12-09 09:13:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-09 09:13:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2018-12-09 09:13:20,753 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2018-12-09 09:13:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:20,753 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2018-12-09 09:13:20,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:13:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2018-12-09 09:13:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:13:20,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:20,754 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-09 09:13:20,754 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:20,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:20,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2110030450, now seen corresponding path program 1 times [2018-12-09 09:13:20,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:20,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:20,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:20,797 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-09 09:13:20,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:20,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:13:20,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:20,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:13:20,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:13:20,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:13:20,798 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2018-12-09 09:13:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:20,986 INFO L93 Difference]: Finished difference Result 349 states and 483 transitions. [2018-12-09 09:13:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:13:20,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 09:13:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:20,987 INFO L225 Difference]: With dead ends: 349 [2018-12-09 09:13:20,987 INFO L226 Difference]: Without dead ends: 204 [2018-12-09 09:13:20,987 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-09 09:13:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-09 09:13:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2018-12-09 09:13:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-09 09:13:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2018-12-09 09:13:20,999 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2018-12-09 09:13:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:20,999 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2018-12-09 09:13:20,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:13:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2018-12-09 09:13:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:13:21,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:21,000 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-09 09:13:21,000 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:21,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:21,000 INFO L82 PathProgramCache]: Analyzing trace with hash 423850612, now seen corresponding path program 1 times [2018-12-09 09:13:21,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:21,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:21,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:21,047 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-09 09:13:21,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:21,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:13:21,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:21,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:13:21,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:13:21,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:13:21,048 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 5 states. [2018-12-09 09:13:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:21,258 INFO L93 Difference]: Finished difference Result 351 states and 482 transitions. [2018-12-09 09:13:21,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:13:21,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 09:13:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:21,259 INFO L225 Difference]: With dead ends: 351 [2018-12-09 09:13:21,260 INFO L226 Difference]: Without dead ends: 206 [2018-12-09 09:13:21,260 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-09 09:13:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-09 09:13:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2018-12-09 09:13:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-09 09:13:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2018-12-09 09:13:21,273 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2018-12-09 09:13:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:21,273 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2018-12-09 09:13:21,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:13:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2018-12-09 09:13:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:13:21,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:21,274 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-09 09:13:21,274 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:21,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:21,274 INFO L82 PathProgramCache]: Analyzing trace with hash 369457714, now seen corresponding path program 1 times [2018-12-09 09:13:21,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:21,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:21,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:21,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:21,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:21,310 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-09 09:13:21,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:21,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:13:21,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:21,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:13:21,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:13:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:13:21,311 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 4 states. [2018-12-09 09:13:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:21,435 INFO L93 Difference]: Finished difference Result 445 states and 612 transitions. [2018-12-09 09:13:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:13:21,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 09:13:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:21,437 INFO L225 Difference]: With dead ends: 445 [2018-12-09 09:13:21,437 INFO L226 Difference]: Without dead ends: 301 [2018-12-09 09:13:21,437 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-09 09:13:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-09 09:13:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-12-09 09:13:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-09 09:13:21,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 393 transitions. [2018-12-09 09:13:21,458 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 393 transitions. Word has length 91 [2018-12-09 09:13:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:21,458 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 393 transitions. [2018-12-09 09:13:21,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:13:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-12-09 09:13:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 09:13:21,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:21,459 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-09 09:13:21,460 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:21,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash -515079540, now seen corresponding path program 1 times [2018-12-09 09:13:21,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:21,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:21,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:21,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:21,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:21,519 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-09 09:13:21,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:13:21,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:13:21,521 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-12-09 09:13:21,522 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [39], [42], [47], [50], [54], [56], [86], [89], [103], [104], [107], [113], [119], [125], [131], [137], [141], [142], [145], [148], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [278], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:13:21,546 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:13:21,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:13:21,652 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:13:21,653 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Performed 385 root evaluator evaluations with a maximum evaluation depth of 3. Performed 385 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-09 09:13:21,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:21,663 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:13:21,752 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 69.09% of their original sizes. [2018-12-09 09:13:21,752 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:13:21,797 INFO L418 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-12-09 09:13:21,797 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:13:21,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:13:21,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-09 09:13:21,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:21,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:13:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:13:21,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:13:21,799 INFO L87 Difference]: Start difference. First operand 300 states and 393 transitions. Second operand 10 states. [2018-12-09 09:13:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:22,630 INFO L93 Difference]: Finished difference Result 689 states and 918 transitions. [2018-12-09 09:13:22,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:13:22,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2018-12-09 09:13:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:22,632 INFO L225 Difference]: With dead ends: 689 [2018-12-09 09:13:22,632 INFO L226 Difference]: Without dead ends: 404 [2018-12-09 09:13:22,633 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:13:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-12-09 09:13:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2018-12-09 09:13:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-09 09:13:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-12-09 09:13:22,669 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 145 [2018-12-09 09:13:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:22,669 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-12-09 09:13:22,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:13:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-12-09 09:13:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 09:13:22,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:22,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:13:22,672 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:22,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1214533374, now seen corresponding path program 1 times [2018-12-09 09:13:22,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:22,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:22,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 09:13:22,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:13:22,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:13:22,718 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-12-09 09:13:22,718 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [47], [50], [54], [56], [59], [75], [77], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [265], [278], [282], [285], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:13:22,721 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:13:22,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:13:22,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:13:22,739 INFO L272 AbstractInterpreter]: Visited 52 different actions 52 times. Never merged. Never widened. Performed 437 root evaluator evaluations with a maximum evaluation depth of 3. Performed 437 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-09 09:13:22,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:22,746 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:13:22,782 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 67.8% of their original sizes. [2018-12-09 09:13:22,782 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:13:22,878 INFO L418 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2018-12-09 09:13:22,878 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:13:22,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:13:22,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-12-09 09:13:22,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:22,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 09:13:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 09:13:22,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:13:22,880 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 15 states. [2018-12-09 09:13:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:24,052 INFO L93 Difference]: Finished difference Result 777 states and 1004 transitions. [2018-12-09 09:13:24,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:13:24,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2018-12-09 09:13:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:24,054 INFO L225 Difference]: With dead ends: 777 [2018-12-09 09:13:24,054 INFO L226 Difference]: Without dead ends: 402 [2018-12-09 09:13:24,055 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-12-09 09:13:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-09 09:13:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2018-12-09 09:13:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-12-09 09:13:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2018-12-09 09:13:24,075 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 164 [2018-12-09 09:13:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:24,075 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2018-12-09 09:13:24,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 09:13:24,075 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2018-12-09 09:13:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 09:13:24,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:24,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:13:24,077 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:24,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1162528349, now seen corresponding path program 1 times [2018-12-09 09:13:24,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:24,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:24,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 09:13:24,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:13:24,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:13:24,127 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2018-12-09 09:13:24,127 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [50], [54], [56], [59], [75], [77], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [278], [282], [285], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:13:24,130 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:13:24,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:13:24,156 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:13:24,156 INFO L272 AbstractInterpreter]: Visited 62 different actions 62 times. Never merged. Never widened. Performed 486 root evaluator evaluations with a maximum evaluation depth of 3. Performed 486 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-09 09:13:24,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:24,157 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:13:24,214 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 66.11% of their original sizes. [2018-12-09 09:13:24,214 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:13:24,350 INFO L418 sIntCurrentIteration]: We unified 164 AI predicates to 164 [2018-12-09 09:13:24,350 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:13:24,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:13:24,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-12-09 09:13:24,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:24,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 09:13:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 09:13:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:13:24,351 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand 19 states. [2018-12-09 09:13:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:26,177 INFO L93 Difference]: Finished difference Result 775 states and 990 transitions. [2018-12-09 09:13:26,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 09:13:26,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 165 [2018-12-09 09:13:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:26,178 INFO L225 Difference]: With dead ends: 775 [2018-12-09 09:13:26,178 INFO L226 Difference]: Without dead ends: 402 [2018-12-09 09:13:26,179 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 09:13:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-09 09:13:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2018-12-09 09:13:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-12-09 09:13:26,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2018-12-09 09:13:26,198 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 165 [2018-12-09 09:13:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:26,198 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2018-12-09 09:13:26,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 09:13:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2018-12-09 09:13:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 09:13:26,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:26,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:13:26,200 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:26,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:26,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2051811056, now seen corresponding path program 1 times [2018-12-09 09:13:26,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:26,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:26,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:26,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 09:13:26,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:13:26,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:26,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:13:26,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:13:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:13:26,246 INFO L87 Difference]: Start difference. First operand 394 states and 498 transitions. Second operand 6 states. [2018-12-09 09:13:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:26,282 INFO L93 Difference]: Finished difference Result 685 states and 906 transitions. [2018-12-09 09:13:26,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:13:26,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-12-09 09:13:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:26,283 INFO L225 Difference]: With dead ends: 685 [2018-12-09 09:13:26,283 INFO L226 Difference]: Without dead ends: 407 [2018-12-09 09:13:26,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:13:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-12-09 09:13:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 399. [2018-12-09 09:13:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-09 09:13:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 502 transitions. [2018-12-09 09:13:26,315 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 502 transitions. Word has length 165 [2018-12-09 09:13:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:26,316 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 502 transitions. [2018-12-09 09:13:26,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:13:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 502 transitions. [2018-12-09 09:13:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 09:13:26,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:26,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:13:26,318 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:26,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:26,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1240585105, now seen corresponding path program 1 times [2018-12-09 09:13:26,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:26,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:26,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:26,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:26,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 09:13:26,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:13:26,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:13:26,347 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-12-09 09:13:26,347 INFO L205 CegarAbsIntRunner]: [29], [31], [36], [39], [42], [44], [47], [50], [52], [54], [56], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [278], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:13:26,349 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:13:26,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:13:26,376 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:13:26,376 INFO L272 AbstractInterpreter]: Visited 102 different actions 134 times. Never merged. Never widened. Performed 900 root evaluator evaluations with a maximum evaluation depth of 3. Performed 900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-09 09:13:26,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:26,382 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:13:26,444 INFO L227 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 79.84% of their original sizes. [2018-12-09 09:13:26,444 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:13:26,965 INFO L418 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-12-09 09:13:26,965 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:13:26,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:13:26,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [4] total 56 [2018-12-09 09:13:26,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:26,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-09 09:13:26,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-09 09:13:26,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2563, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 09:13:26,966 INFO L87 Difference]: Start difference. First operand 399 states and 502 transitions. Second operand 54 states. [2018-12-09 09:13:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:35,507 INFO L93 Difference]: Finished difference Result 1798 states and 2515 transitions. [2018-12-09 09:13:35,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-09 09:13:35,507 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 145 [2018-12-09 09:13:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:35,512 INFO L225 Difference]: With dead ends: 1798 [2018-12-09 09:13:35,512 INFO L226 Difference]: Without dead ends: 1421 [2018-12-09 09:13:35,516 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6417 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1662, Invalid=16970, Unknown=0, NotChecked=0, Total=18632 [2018-12-09 09:13:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-12-09 09:13:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1359. [2018-12-09 09:13:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2018-12-09 09:13:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1800 transitions. [2018-12-09 09:13:35,585 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1800 transitions. Word has length 145 [2018-12-09 09:13:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:35,586 INFO L480 AbstractCegarLoop]: Abstraction has 1359 states and 1800 transitions. [2018-12-09 09:13:35,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-09 09:13:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1800 transitions. [2018-12-09 09:13:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 09:13:35,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:35,587 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, 1, 1, 1, 1, 1] [2018-12-09 09:13:35,588 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:35,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash 321546296, now seen corresponding path program 1 times [2018-12-09 09:13:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:35,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:35,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:35,631 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-09 09:13:35,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:13:35,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:13:35,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:35,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:13:35,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:13:35,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:13:35,632 INFO L87 Difference]: Start difference. First operand 1359 states and 1800 transitions. Second operand 5 states. [2018-12-09 09:13:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:36,084 INFO L93 Difference]: Finished difference Result 3262 states and 4615 transitions. [2018-12-09 09:13:36,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:13:36,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2018-12-09 09:13:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:36,091 INFO L225 Difference]: With dead ends: 3262 [2018-12-09 09:13:36,091 INFO L226 Difference]: Without dead ends: 2104 [2018-12-09 09:13:36,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:13:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-12-09 09:13:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2040. [2018-12-09 09:13:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-12-09 09:13:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2753 transitions. [2018-12-09 09:13:36,187 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2753 transitions. Word has length 152 [2018-12-09 09:13:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:36,188 INFO L480 AbstractCegarLoop]: Abstraction has 2040 states and 2753 transitions. [2018-12-09 09:13:36,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:13:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2753 transitions. [2018-12-09 09:13:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 09:13:36,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:36,190 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, 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] [2018-12-09 09:13:36,190 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:36,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash 348520683, now seen corresponding path program 1 times [2018-12-09 09:13:36,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:36,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:36,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:36,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 09:13:36,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:13:36,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:13:36,241 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-12-09 09:13:36,241 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [269], [272], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:13:36,242 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:13:36,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:13:36,270 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:13:36,271 INFO L272 AbstractInterpreter]: Visited 114 different actions 147 times. Never merged. Never widened. Performed 1000 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1000 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-09 09:13:36,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:36,272 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:13:36,341 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 76.11% of their original sizes. [2018-12-09 09:13:36,342 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:13:36,857 INFO L418 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-12-09 09:13:36,857 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:13:36,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:13:36,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2018-12-09 09:13:36,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:36,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-09 09:13:36,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-09 09:13:36,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 09:13:36,859 INFO L87 Difference]: Start difference. First operand 2040 states and 2753 transitions. Second operand 54 states. [2018-12-09 09:13:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:43,994 INFO L93 Difference]: Finished difference Result 4234 states and 6031 transitions. [2018-12-09 09:13:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-09 09:13:43,995 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 196 [2018-12-09 09:13:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:44,004 INFO L225 Difference]: With dead ends: 4234 [2018-12-09 09:13:44,004 INFO L226 Difference]: Without dead ends: 2888 [2018-12-09 09:13:44,011 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 258 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4417 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1185, Invalid=12387, Unknown=0, NotChecked=0, Total=13572 [2018-12-09 09:13:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2018-12-09 09:13:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2783. [2018-12-09 09:13:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2783 states. [2018-12-09 09:13:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 3756 transitions. [2018-12-09 09:13:44,141 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 3756 transitions. Word has length 196 [2018-12-09 09:13:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:44,141 INFO L480 AbstractCegarLoop]: Abstraction has 2783 states and 3756 transitions. [2018-12-09 09:13:44,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-09 09:13:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3756 transitions. [2018-12-09 09:13:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-09 09:13:44,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:44,144 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, 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] [2018-12-09 09:13:44,144 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:44,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash 272949603, now seen corresponding path program 1 times [2018-12-09 09:13:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:44,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:44,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-09 09:13:44,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:13:44,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:13:44,219 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-12-09 09:13:44,219 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:13:44,220 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:13:44,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:13:44,265 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:13:44,265 INFO L272 AbstractInterpreter]: Visited 118 different actions 166 times. Merged at 6 different actions 6 times. Never widened. Performed 1344 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1344 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-09 09:13:44,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:44,270 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:13:44,362 INFO L227 lantSequenceWeakener]: Weakened 161 states. On average, predicates are now at 76.92% of their original sizes. [2018-12-09 09:13:44,362 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:13:45,106 INFO L418 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2018-12-09 09:13:45,106 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:13:45,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:13:45,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [10] total 73 [2018-12-09 09:13:45,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:45,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-09 09:13:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-09 09:13:45,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=3675, Unknown=0, NotChecked=0, Total=4160 [2018-12-09 09:13:45,108 INFO L87 Difference]: Start difference. First operand 2783 states and 3756 transitions. Second operand 65 states. [2018-12-09 09:13:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:13:56,785 INFO L93 Difference]: Finished difference Result 5229 states and 7150 transitions. [2018-12-09 09:13:56,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-09 09:13:56,785 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 209 [2018-12-09 09:13:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:13:56,792 INFO L225 Difference]: With dead ends: 5229 [2018-12-09 09:13:56,792 INFO L226 Difference]: Without dead ends: 2866 [2018-12-09 09:13:56,800 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 289 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7225 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1728, Invalid=19442, Unknown=0, NotChecked=0, Total=21170 [2018-12-09 09:13:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2018-12-09 09:13:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2824. [2018-12-09 09:13:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-12-09 09:13:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3772 transitions. [2018-12-09 09:13:56,941 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3772 transitions. Word has length 209 [2018-12-09 09:13:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:13:56,941 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3772 transitions. [2018-12-09 09:13:56,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-09 09:13:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3772 transitions. [2018-12-09 09:13:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 09:13:56,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:13:56,944 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, 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] [2018-12-09 09:13:56,945 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:13:56,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:56,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1614110952, now seen corresponding path program 1 times [2018-12-09 09:13:56,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:13:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:56,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:13:56,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:13:56,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:13:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:13:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-09 09:13:56,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:13:56,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:13:56,975 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-09 09:13:56,975 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [91], [94], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [265], [269], [275], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:13:56,977 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:13:56,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:13:57,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:13:57,007 INFO L272 AbstractInterpreter]: Visited 116 different actions 167 times. Merged at 11 different actions 11 times. Never widened. Performed 1177 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-09 09:13:57,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:13:57,010 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:13:57,117 INFO L227 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 76.3% of their original sizes. [2018-12-09 09:13:57,117 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:13:57,880 INFO L418 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-12-09 09:13:57,880 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:13:57,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:13:57,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [3] total 65 [2018-12-09 09:13:57,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:13:57,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-09 09:13:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-09 09:13:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=3644, Unknown=0, NotChecked=0, Total=4032 [2018-12-09 09:13:57,882 INFO L87 Difference]: Start difference. First operand 2824 states and 3772 transitions. Second operand 64 states. [2018-12-09 09:14:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:11,299 INFO L93 Difference]: Finished difference Result 3998 states and 5427 transitions. [2018-12-09 09:14:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-09 09:14:11,300 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 211 [2018-12-09 09:14:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:11,305 INFO L225 Difference]: With dead ends: 3998 [2018-12-09 09:14:11,306 INFO L226 Difference]: Without dead ends: 1888 [2018-12-09 09:14:11,311 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5306 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1387, Invalid=14113, Unknown=0, NotChecked=0, Total=15500 [2018-12-09 09:14:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-12-09 09:14:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1804. [2018-12-09 09:14:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2018-12-09 09:14:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2374 transitions. [2018-12-09 09:14:11,407 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2374 transitions. Word has length 211 [2018-12-09 09:14:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:11,407 INFO L480 AbstractCegarLoop]: Abstraction has 1804 states and 2374 transitions. [2018-12-09 09:14:11,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-09 09:14:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2374 transitions. [2018-12-09 09:14:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 09:14:11,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:11,409 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] [2018-12-09 09:14:11,410 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:11,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:11,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1529868180, now seen corresponding path program 1 times [2018-12-09 09:14:11,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:11,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:11,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-09 09:14:11,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:11,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:11,457 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-09 09:14:11,458 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:11,459 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:11,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:11,551 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:11,551 INFO L272 AbstractInterpreter]: Visited 118 different actions 284 times. Merged at 13 different actions 25 times. Never widened. Performed 3433 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3433 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-09 09:14:11,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:11,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:11,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:11,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:14:11,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:11,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:11,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 09:14:11,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-09 09:14:11,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:11,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-12-09 09:14:11,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:11,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:14:11,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:14:11,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:14:11,823 INFO L87 Difference]: Start difference. First operand 1804 states and 2374 transitions. Second operand 3 states. [2018-12-09 09:14:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:11,955 INFO L93 Difference]: Finished difference Result 4313 states and 6134 transitions. [2018-12-09 09:14:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:14:11,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-12-09 09:14:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:11,965 INFO L225 Difference]: With dead ends: 4313 [2018-12-09 09:14:11,965 INFO L226 Difference]: Without dead ends: 2723 [2018-12-09 09:14:11,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:14:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2018-12-09 09:14:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2696. [2018-12-09 09:14:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-12-09 09:14:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3673 transitions. [2018-12-09 09:14:12,097 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3673 transitions. Word has length 211 [2018-12-09 09:14:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:12,098 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 3673 transitions. [2018-12-09 09:14:12,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:14:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3673 transitions. [2018-12-09 09:14:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 09:14:12,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:12,101 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, 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] [2018-12-09 09:14:12,101 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:12,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash 850721705, now seen corresponding path program 1 times [2018-12-09 09:14:12,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:12,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:12,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-09 09:14:12,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:12,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:12,172 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-09 09:14:12,173 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [275], [282], [285], [288], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:12,173 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:12,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:12,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:12,297 INFO L272 AbstractInterpreter]: Visited 124 different actions 407 times. Merged at 31 different actions 83 times. Never widened. Performed 3870 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3870 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 5 different actions. Largest state had 42 variables. [2018-12-09 09:14:12,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:12,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:12,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:12,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:14:12,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:12,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:12,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 09:14:12,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 09:14:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:14:12,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2018-12-09 09:14:12,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:12,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:14:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:14:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:14:12,529 INFO L87 Difference]: Start difference. First operand 2696 states and 3673 transitions. Second operand 3 states. [2018-12-09 09:14:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:12,658 INFO L93 Difference]: Finished difference Result 5205 states and 7516 transitions. [2018-12-09 09:14:12,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:14:12,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-12-09 09:14:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:12,664 INFO L225 Difference]: With dead ends: 5205 [2018-12-09 09:14:12,664 INFO L226 Difference]: Without dead ends: 2839 [2018-12-09 09:14:12,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 416 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:14:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2018-12-09 09:14:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2688. [2018-12-09 09:14:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2688 states. [2018-12-09 09:14:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 3583 transitions. [2018-12-09 09:14:12,787 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 3583 transitions. Word has length 211 [2018-12-09 09:14:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:12,787 INFO L480 AbstractCegarLoop]: Abstraction has 2688 states and 3583 transitions. [2018-12-09 09:14:12,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:14:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 3583 transitions. [2018-12-09 09:14:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 09:14:12,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:12,789 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, 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] [2018-12-09 09:14:12,789 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:12,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash 73236914, now seen corresponding path program 1 times [2018-12-09 09:14:12,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:12,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:12,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 09:14:12,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:12,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:12,865 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-12-09 09:14:12,865 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [288], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:12,865 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:12,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:12,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:12,958 INFO L272 AbstractInterpreter]: Visited 124 different actions 392 times. Merged at 30 different actions 76 times. Never widened. Performed 4034 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4034 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 5 different actions. Largest state had 42 variables. [2018-12-09 09:14:12,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:12,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:12,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:12,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:14:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:12,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:13,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 09:14:13,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 09:14:13,173 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:14:13,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-12-09 09:14:13,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:13,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:14:13,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:14:13,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:14:13,174 INFO L87 Difference]: Start difference. First operand 2688 states and 3583 transitions. Second operand 3 states. [2018-12-09 09:14:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:13,328 INFO L93 Difference]: Finished difference Result 6009 states and 8558 transitions. [2018-12-09 09:14:13,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:14:13,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-09 09:14:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:13,337 INFO L225 Difference]: With dead ends: 6009 [2018-12-09 09:14:13,337 INFO L226 Difference]: Without dead ends: 3563 [2018-12-09 09:14:13,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:14:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-12-09 09:14:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3532. [2018-12-09 09:14:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2018-12-09 09:14:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4685 transitions. [2018-12-09 09:14:13,511 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4685 transitions. Word has length 210 [2018-12-09 09:14:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:13,511 INFO L480 AbstractCegarLoop]: Abstraction has 3532 states and 4685 transitions. [2018-12-09 09:14:13,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:14:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4685 transitions. [2018-12-09 09:14:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 09:14:13,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:13,514 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, 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] [2018-12-09 09:14:13,514 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:13,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash -390076486, now seen corresponding path program 1 times [2018-12-09 09:14:13,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:13,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:13,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:13,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:13,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-09 09:14:13,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:13,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:13,577 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-09 09:14:13,577 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [288], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:13,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:13,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:13,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:13,670 INFO L272 AbstractInterpreter]: Visited 125 different actions 424 times. Merged at 31 different actions 89 times. Never widened. Performed 3862 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3862 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 13 fixpoints after 6 different actions. Largest state had 42 variables. [2018-12-09 09:14:13,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:13,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:13,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:13,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:14:13,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:13,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:13,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-09 09:14:13,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-09 09:14:13,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:13,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10, 4] total 12 [2018-12-09 09:14:13,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:13,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:14:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:14:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:14:13,979 INFO L87 Difference]: Start difference. First operand 3532 states and 4685 transitions. Second operand 3 states. [2018-12-09 09:14:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:14,119 INFO L93 Difference]: Finished difference Result 4599 states and 6095 transitions. [2018-12-09 09:14:14,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:14:14,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-12-09 09:14:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:14,127 INFO L225 Difference]: With dead ends: 4599 [2018-12-09 09:14:14,127 INFO L226 Difference]: Without dead ends: 3543 [2018-12-09 09:14:14,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 414 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:14:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2018-12-09 09:14:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3532. [2018-12-09 09:14:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2018-12-09 09:14:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4563 transitions. [2018-12-09 09:14:14,278 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4563 transitions. Word has length 211 [2018-12-09 09:14:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:14,279 INFO L480 AbstractCegarLoop]: Abstraction has 3532 states and 4563 transitions. [2018-12-09 09:14:14,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:14:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4563 transitions. [2018-12-09 09:14:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 09:14:14,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:14,281 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, 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] [2018-12-09 09:14:14,281 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:14,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:14,281 INFO L82 PathProgramCache]: Analyzing trace with hash 559872640, now seen corresponding path program 1 times [2018-12-09 09:14:14,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:14,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:14,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:14,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:14,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 09:14:14,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:14,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:14,354 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-12-09 09:14:14,354 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:14,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:14,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:14,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:14,482 INFO L272 AbstractInterpreter]: Visited 134 different actions 564 times. Merged at 38 different actions 98 times. Never widened. Performed 5860 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5860 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 15 fixpoints after 7 different actions. Largest state had 42 variables. [2018-12-09 09:14:14,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:14,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:14,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:14,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:14:14,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:14,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:14,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 09:14:14,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-09 09:14:14,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:14,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2018-12-09 09:14:14,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:14,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:14:14,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:14:14,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:14:14,755 INFO L87 Difference]: Start difference. First operand 3532 states and 4563 transitions. Second operand 4 states. [2018-12-09 09:14:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:15,075 INFO L93 Difference]: Finished difference Result 7343 states and 10470 transitions. [2018-12-09 09:14:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:14:15,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2018-12-09 09:14:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:15,085 INFO L225 Difference]: With dead ends: 7343 [2018-12-09 09:14:15,085 INFO L226 Difference]: Without dead ends: 4174 [2018-12-09 09:14:15,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 421 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:14:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2018-12-09 09:14:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 3723. [2018-12-09 09:14:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3723 states. [2018-12-09 09:14:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 4701 transitions. [2018-12-09 09:14:15,262 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 4701 transitions. Word has length 217 [2018-12-09 09:14:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:15,262 INFO L480 AbstractCegarLoop]: Abstraction has 3723 states and 4701 transitions. [2018-12-09 09:14:15,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:14:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 4701 transitions. [2018-12-09 09:14:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 09:14:15,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:15,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:14:15,264 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:15,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 925553302, now seen corresponding path program 1 times [2018-12-09 09:14:15,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:15,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:15,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:15,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:15,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-09 09:14:15,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:14:15,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:14:15,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:15,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:14:15,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:14:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:14:15,309 INFO L87 Difference]: Start difference. First operand 3723 states and 4701 transitions. Second operand 4 states. [2018-12-09 09:14:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:15,536 INFO L93 Difference]: Finished difference Result 6584 states and 8582 transitions. [2018-12-09 09:14:15,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:14:15,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-12-09 09:14:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:15,543 INFO L225 Difference]: With dead ends: 6584 [2018-12-09 09:14:15,543 INFO L226 Difference]: Without dead ends: 3224 [2018-12-09 09:14:15,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09 09:14:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2018-12-09 09:14:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3222. [2018-12-09 09:14:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2018-12-09 09:14:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 3940 transitions. [2018-12-09 09:14:15,702 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 3940 transitions. Word has length 211 [2018-12-09 09:14:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:15,702 INFO L480 AbstractCegarLoop]: Abstraction has 3222 states and 3940 transitions. [2018-12-09 09:14:15,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:14:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 3940 transitions. [2018-12-09 09:14:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-09 09:14:15,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:15,704 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, 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] [2018-12-09 09:14:15,704 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:15,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash 467873814, now seen corresponding path program 1 times [2018-12-09 09:14:15,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:15,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:15,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:15,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:15,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-09 09:14:15,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:15,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:15,744 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-12-09 09:14:15,744 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [300], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:15,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:15,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:15,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:15,841 INFO L272 AbstractInterpreter]: Visited 125 different actions 416 times. Merged at 39 different actions 81 times. Never widened. Performed 4147 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 42 variables. [2018-12-09 09:14:15,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:15,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:15,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:15,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:14:15,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:15,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:15,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 09:14:15,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 09:14:16,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:16,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2018-12-09 09:14:16,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:16,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:14:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:14:16,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:14:16,097 INFO L87 Difference]: Start difference. First operand 3222 states and 3940 transitions. Second operand 4 states. [2018-12-09 09:14:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:16,438 INFO L93 Difference]: Finished difference Result 6519 states and 8319 transitions. [2018-12-09 09:14:16,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:14:16,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-12-09 09:14:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:16,447 INFO L225 Difference]: With dead ends: 6519 [2018-12-09 09:14:16,447 INFO L226 Difference]: Without dead ends: 3919 [2018-12-09 09:14:16,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:14:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2018-12-09 09:14:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3800. [2018-12-09 09:14:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3800 states. [2018-12-09 09:14:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 4792 transitions. [2018-12-09 09:14:16,635 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 4792 transitions. Word has length 213 [2018-12-09 09:14:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:16,636 INFO L480 AbstractCegarLoop]: Abstraction has 3800 states and 4792 transitions. [2018-12-09 09:14:16,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:14:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 4792 transitions. [2018-12-09 09:14:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 09:14:16,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:16,638 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, 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] [2018-12-09 09:14:16,638 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:16,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash -627441356, now seen corresponding path program 1 times [2018-12-09 09:14:16,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:16,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:16,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:16,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:16,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-09 09:14:16,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:16,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:16,702 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-12-09 09:14:16,702 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [275], [282], [285], [297], [300], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:16,703 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:16,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:16,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:16,883 INFO L272 AbstractInterpreter]: Visited 136 different actions 758 times. Merged at 47 different actions 154 times. Never widened. Performed 6186 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6186 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 32 fixpoints after 8 different actions. Largest state had 42 variables. [2018-12-09 09:14:16,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:16,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:16,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:16,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:14:16,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:16,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:16,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 09:14:16,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 20 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-09 09:14:17,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:17,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 4] total 14 [2018-12-09 09:14:17,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:17,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:14:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:14:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:14:17,165 INFO L87 Difference]: Start difference. First operand 3800 states and 4792 transitions. Second operand 4 states. [2018-12-09 09:14:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:17,520 INFO L93 Difference]: Finished difference Result 7456 states and 9578 transitions. [2018-12-09 09:14:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:14:17,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-12-09 09:14:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:17,529 INFO L225 Difference]: With dead ends: 7456 [2018-12-09 09:14:17,529 INFO L226 Difference]: Without dead ends: 4046 [2018-12-09 09:14:17,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:14:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4046 states. [2018-12-09 09:14:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4046 to 3907. [2018-12-09 09:14:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3907 states. [2018-12-09 09:14:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 4767 transitions. [2018-12-09 09:14:17,736 INFO L78 Accepts]: Start accepts. Automaton has 3907 states and 4767 transitions. Word has length 220 [2018-12-09 09:14:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:17,736 INFO L480 AbstractCegarLoop]: Abstraction has 3907 states and 4767 transitions. [2018-12-09 09:14:17,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:14:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 4767 transitions. [2018-12-09 09:14:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-09 09:14:17,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:17,738 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, 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] [2018-12-09 09:14:17,738 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:17,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1992903186, now seen corresponding path program 1 times [2018-12-09 09:14:17,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:17,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:17,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-09 09:14:17,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:17,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:17,788 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-12-09 09:14:17,788 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [297], [300], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:17,788 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:17,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:17,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:17,891 INFO L272 AbstractInterpreter]: Visited 136 different actions 504 times. Merged at 44 different actions 95 times. Never widened. Performed 4586 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4586 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 20 fixpoints after 9 different actions. Largest state had 42 variables. [2018-12-09 09:14:17,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:17,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:17,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:17,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/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-09 09:14:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:17,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:17,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 09:14:17,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-09 09:14:18,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:18,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2018-12-09 09:14:18,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:18,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:14:18,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:14:18,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:14:18,125 INFO L87 Difference]: Start difference. First operand 3907 states and 4767 transitions. Second operand 6 states. [2018-12-09 09:14:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:18,327 INFO L93 Difference]: Finished difference Result 6519 states and 8123 transitions. [2018-12-09 09:14:18,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:14:18,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2018-12-09 09:14:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:18,335 INFO L225 Difference]: With dead ends: 6519 [2018-12-09 09:14:18,335 INFO L226 Difference]: Without dead ends: 3997 [2018-12-09 09:14:18,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 433 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:14:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2018-12-09 09:14:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3954. [2018-12-09 09:14:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3954 states. [2018-12-09 09:14:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 4815 transitions. [2018-12-09 09:14:18,537 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 4815 transitions. Word has length 219 [2018-12-09 09:14:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:18,537 INFO L480 AbstractCegarLoop]: Abstraction has 3954 states and 4815 transitions. [2018-12-09 09:14:18,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:14:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 4815 transitions. [2018-12-09 09:14:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 09:14:18,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:18,539 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, 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] [2018-12-09 09:14:18,539 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:18,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1673241968, now seen corresponding path program 1 times [2018-12-09 09:14:18,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:18,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:18,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:18,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-09 09:14:18,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:18,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:18,581 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-12-09 09:14:18,581 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [297], [300], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:18,582 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:18,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:18,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:18,708 INFO L272 AbstractInterpreter]: Visited 135 different actions 579 times. Merged at 43 different actions 98 times. Never widened. Performed 5755 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5755 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 18 fixpoints after 9 different actions. Largest state had 42 variables. [2018-12-09 09:14:18,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:18,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:18,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:18,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:14:18,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:18,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:18,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 09:14:18,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-09 09:14:18,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:18,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-12-09 09:14:18,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:18,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:14:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:14:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:14:18,880 INFO L87 Difference]: Start difference. First operand 3954 states and 4815 transitions. Second operand 3 states. [2018-12-09 09:14:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:19,050 INFO L93 Difference]: Finished difference Result 6289 states and 7809 transitions. [2018-12-09 09:14:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:14:19,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-12-09 09:14:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:19,057 INFO L225 Difference]: With dead ends: 6289 [2018-12-09 09:14:19,057 INFO L226 Difference]: Without dead ends: 3643 [2018-12-09 09:14:19,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 441 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-09 09:14:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2018-12-09 09:14:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3560. [2018-12-09 09:14:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2018-12-09 09:14:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 4259 transitions. [2018-12-09 09:14:19,229 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 4259 transitions. Word has length 220 [2018-12-09 09:14:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:19,230 INFO L480 AbstractCegarLoop]: Abstraction has 3560 states and 4259 transitions. [2018-12-09 09:14:19,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:14:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 4259 transitions. [2018-12-09 09:14:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-09 09:14:19,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:19,232 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:14:19,232 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:19,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2051851918, now seen corresponding path program 1 times [2018-12-09 09:14:19,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:19,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:19,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 29 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-09 09:14:19,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:19,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:19,284 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-12-09 09:14:19,284 INFO L205 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [275], [282], [285], [297], [300], [303], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [405], [407], [409], [411], [412], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:19,285 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:19,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:19,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:19,384 INFO L272 AbstractInterpreter]: Visited 132 different actions 447 times. Merged at 40 different actions 83 times. Never widened. Performed 4399 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4399 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 42 variables. [2018-12-09 09:14:19,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:19,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:19,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:19,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:14:19,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:19,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:19,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 128 proven. 62 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 09:14:19,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-09 09:14:19,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:19,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-12-09 09:14:19,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:19,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:14:19,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:14:19,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:14:19,690 INFO L87 Difference]: Start difference. First operand 3560 states and 4259 transitions. Second operand 5 states. [2018-12-09 09:14:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:20,060 INFO L93 Difference]: Finished difference Result 5603 states and 6746 transitions. [2018-12-09 09:14:20,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:14:20,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2018-12-09 09:14:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:20,067 INFO L225 Difference]: With dead ends: 5603 [2018-12-09 09:14:20,067 INFO L226 Difference]: Without dead ends: 2734 [2018-12-09 09:14:20,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 510 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:14:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2018-12-09 09:14:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2714. [2018-12-09 09:14:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2018-12-09 09:14:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3242 transitions. [2018-12-09 09:14:20,211 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3242 transitions. Word has length 259 [2018-12-09 09:14:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:20,212 INFO L480 AbstractCegarLoop]: Abstraction has 2714 states and 3242 transitions. [2018-12-09 09:14:20,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:14:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3242 transitions. [2018-12-09 09:14:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-09 09:14:20,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:20,214 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-09 09:14:20,214 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:20,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:20,214 INFO L82 PathProgramCache]: Analyzing trace with hash -614304329, now seen corresponding path program 1 times [2018-12-09 09:14:20,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:20,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:20,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:20,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:20,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-09 09:14:20,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:20,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:14:20,270 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-12-09 09:14:20,270 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [282], [285], [297], [300], [303], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [405], [407], [409], [411], [412], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-09 09:14:20,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:14:20,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:14:20,398 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:14:20,398 INFO L272 AbstractInterpreter]: Visited 143 different actions 590 times. Merged at 48 different actions 110 times. Never widened. Performed 4976 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4976 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 19 fixpoints after 10 different actions. Largest state had 42 variables. [2018-12-09 09:14:20,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:20,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:14:20,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:14:20,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:14:20,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:20,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:14:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:20,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:14:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 09:14:20,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:14:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-09 09:14:20,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:14:20,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-12-09 09:14:20,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:20,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:14:20,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:14:20,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:14:20,661 INFO L87 Difference]: Start difference. First operand 2714 states and 3242 transitions. Second operand 6 states. [2018-12-09 09:14:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:20,770 INFO L93 Difference]: Finished difference Result 4161 states and 5023 transitions. [2018-12-09 09:14:20,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:14:20,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-12-09 09:14:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:20,773 INFO L225 Difference]: With dead ends: 4161 [2018-12-09 09:14:20,773 INFO L226 Difference]: Without dead ends: 1827 [2018-12-09 09:14:20,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 527 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:14:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2018-12-09 09:14:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1825. [2018-12-09 09:14:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-12-09 09:14:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2074 transitions. [2018-12-09 09:14:20,868 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2074 transitions. Word has length 265 [2018-12-09 09:14:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:20,868 INFO L480 AbstractCegarLoop]: Abstraction has 1825 states and 2074 transitions. [2018-12-09 09:14:20,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:14:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2074 transitions. [2018-12-09 09:14:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-09 09:14:20,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:20,869 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, 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-09 09:14:20,869 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:20,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash -553144647, now seen corresponding path program 2 times [2018-12-09 09:14:20,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:20,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:14:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:20,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-12-09 09:14:20,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:14:20,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:14:20,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:20,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:14:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:14:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:14:20,920 INFO L87 Difference]: Start difference. First operand 1825 states and 2074 transitions. Second operand 6 states. [2018-12-09 09:14:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:21,002 INFO L93 Difference]: Finished difference Result 2597 states and 3000 transitions. [2018-12-09 09:14:21,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:14:21,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-12-09 09:14:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:21,004 INFO L225 Difference]: With dead ends: 2597 [2018-12-09 09:14:21,005 INFO L226 Difference]: Without dead ends: 712 [2018-12-09 09:14:21,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:14:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-12-09 09:14:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 702. [2018-12-09 09:14:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-12-09 09:14:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 771 transitions. [2018-12-09 09:14:21,057 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 771 transitions. Word has length 265 [2018-12-09 09:14:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:21,057 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 771 transitions. [2018-12-09 09:14:21,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:14:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 771 transitions. [2018-12-09 09:14:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-09 09:14:21,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:14:21,058 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-09 09:14:21,058 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:14:21,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:14:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1370083387, now seen corresponding path program 3 times [2018-12-09 09:14:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:14:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:21,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:14:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:14:21,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:14:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:14:21,146 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-09 09:14:21,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:14:21,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:14:21,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:14:21,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:14:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:14:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:14:21,146 INFO L87 Difference]: Start difference. First operand 702 states and 771 transitions. Second operand 7 states. [2018-12-09 09:14:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:14:21,666 INFO L93 Difference]: Finished difference Result 704 states and 775 transitions. [2018-12-09 09:14:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:14:21,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2018-12-09 09:14:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:14:21,667 INFO L225 Difference]: With dead ends: 704 [2018-12-09 09:14:21,667 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:14:21,668 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-09 09:14:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:14:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:14:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:14:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:14:21,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2018-12-09 09:14:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:14:21,668 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:14:21,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:14:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:14:21,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:14:21,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 09:14:21,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:21,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:22,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:23,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:23,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:23,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:23,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:14:23,968 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 109 [2018-12-09 09:14:25,070 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 184 DAG size of output: 114 [2018-12-09 09:14:25,457 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 109 [2018-12-09 09:14:27,042 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 145 DAG size of output: 104 [2018-12-09 09:14:29,102 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 212 DAG size of output: 131 [2018-12-09 09:14:29,980 WARN L180 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 141 [2018-12-09 09:14:30,155 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 82 [2018-12-09 09:14:30,570 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 124 [2018-12-09 09:14:30,692 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 85 [2018-12-09 09:14:30,794 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2018-12-09 09:14:30,953 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 85 [2018-12-09 09:14:31,290 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2018-12-09 09:14:31,848 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 117 [2018-12-09 09:14:32,075 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 109 [2018-12-09 09:14:32,354 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 105 [2018-12-09 09:14:32,623 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 124 [2018-12-09 09:14:33,526 WARN L180 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 138 [2018-12-09 09:14:34,731 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 168 DAG size of output: 121 [2018-12-09 09:14:35,187 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 85 [2018-12-09 09:14:37,275 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 163 DAG size of output: 117 [2018-12-09 09:14:39,497 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 200 DAG size of output: 141 [2018-12-09 09:14:39,949 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2018-12-09 09:14:40,966 WARN L180 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 138 [2018-12-09 09:14:41,848 WARN L180 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 130 [2018-12-09 09:14:41,959 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2018-12-09 09:14:42,176 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 109 [2018-12-09 09:14:42,578 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 112 [2018-12-09 09:14:43,243 WARN L180 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 120 [2018-12-09 09:14:43,551 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 107 [2018-12-09 09:14:43,833 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2018-12-09 09:14:44,442 WARN L180 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 161 [2018-12-09 09:14:45,448 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 188 DAG size of output: 113 [2018-12-09 09:14:45,563 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 85 [2018-12-09 09:14:45,685 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 85 [2018-12-09 09:14:46,514 WARN L180 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 163 [2018-12-09 09:14:46,624 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2018-12-09 09:14:46,847 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 109 [2018-12-09 09:14:47,581 WARN L180 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 103 [2018-12-09 09:14:48,010 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 112 [2018-12-09 09:14:48,519 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2018-12-09 09:14:49,126 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 99 [2018-12-09 09:14:49,611 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 138 [2018-12-09 09:14:49,887 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2018-12-09 09:14:50,271 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 116 [2018-12-09 09:14:51,246 WARN L180 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 130 [2018-12-09 09:14:51,480 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2018-12-09 09:14:51,692 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 1 [2018-12-09 09:14:52,665 WARN L180 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 143 [2018-12-09 09:14:52,817 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 85 [2018-12-09 09:14:59,944 WARN L180 SmtUtils]: Spent 7.12 s on a formula simplification. DAG size of input: 291 DAG size of output: 193 [2018-12-09 09:15:00,551 WARN L180 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2018-12-09 09:15:01,160 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 124 [2018-12-09 09:15:01,405 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 109 [2018-12-09 09:15:02,629 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 196 DAG size of output: 120 [2018-12-09 09:15:02,856 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2018-12-09 09:15:03,085 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 109 [2018-12-09 09:15:03,997 WARN L180 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 120 [2018-12-09 09:15:05,845 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 214 DAG size of output: 152 [2018-12-09 09:15:09,739 WARN L180 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 291 DAG size of output: 193 [2018-12-09 09:15:09,742 INFO L444 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse27 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse32 (= 0 |old(~m_st~0)|)) (.cse35 (= 1 ~m_pc~0))) (let ((.cse23 (not .cse35)) (.cse19 (not (= 2 |old(~m_st~0)|))) (.cse9 (not .cse32)) (.cse13 (not (= 0 ~m_pc~0))) (.cse21 (and .cse27 (= ~m_st~0 2) (and (not .cse1) (not .cse4) .cse35 (not (= ~M_E~0 0)) (not (= ~E_M~0 0))))) (.cse34 (= 1 ~t2_pc~0))) (let ((.cse20 (not (= |old(~t1_pc~0)| 1))) (.cse22 (<= 2 ~E_2~0)) (.cse8 (not (= |old(~token~0)| 0))) (.cse3 (not (= 0 ~local~0))) (.cse16 (= ~token~0 0)) (.cse0 (< ~E_1~0 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse7 (not .cse34)) (.cse14 (<= ~t1_pc~0 0)) (.cse24 (and .cse34 .cse21 (<= 2 ~E_1~0))) (.cse15 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse12 (< 0 |old(~t1_pc~0)|)) (.cse29 (= ~t1_pc~0 0)) (.cse17 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse28 (= ~t2_st~0 0)) (.cse18 (<= |old(~E_2~0)| ~E_2~0)) (.cse5 (= 0 ~M_E~0)) (.cse25 (let ((.cse33 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse33 .cse23 .cse19) (or .cse9 .cse33 .cse13)))) (.cse6 (= 1 ~E_M~0)) (.cse26 (not (= |old(~t1_pc~0)| 0))) (.cse30 (not (= 2 ~E_1~0))) (.cse10 (< |old(~E_2~0)| 2)) (.cse11 (= 0 ~E_M~0)) (.cse31 (not (= 0 ~t2_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 (= ~m_st~0 0) .cse17 .cse18)) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse19 .cse20 (and (= 1 ~t1_pc~0) .cse21 .cse22) .cse4 .cse5 .cse6 .cse23 .cse10 .cse11) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse19 (and (and .cse24 .cse22) (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0)) .cse20 (< |old(~token~0)| ~local~0) .cse4 .cse5 .cse6 .cse7 .cse23 (and .cse24 .cse15 .cse22) .cse10 .cse11) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse25 .cse26 (not (= 1 ~t1_i~0)) (or .cse8 .cse3 .cse13) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (and .cse27 .cse28 .cse16 (= ~E_2~0 2) .cse29 .cse17) (not (= ~m_i~0 1)) .cse30 (not (= 1 ~t2_i~0)) .cse31 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse23 .cse10 .cse11 (and .cse14 .cse24 .cse15 .cse17 .cse18) .cse12) (or (and .cse29 .cse17 (and .cse27 .cse28) .cse18) .cse1 .cse4 .cse5 .cse25 .cse6 .cse26 .cse30 .cse10 .cse11 .cse32 .cse31))))) [2018-12-09 09:15:09,742 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-12-09 09:15:09,743 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse30 (= 0 |old(~m_st~0)|))) (let ((.cse18 (not (= 1 ~m_pc~0))) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse31 (not .cse30)) (.cse9 (not (= 0 ~m_pc~0)))) (let ((.cse1 (= ~t2_st~0 0)) (.cse3 (= ~t1_pc~0 0)) (.cse5 (let ((.cse32 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse32 .cse18 .cse13) (or .cse31 .cse32 .cse9)))) (.cse6 (not (= |old(~t1_pc~0)| 0))) (.cse10 (not (= 2 ~E_1~0))) (.cse11 (not (= 0 ~t2_pc~0))) (.cse22 (not (= |old(~t1_pc~0)| 1))) (.cse23 (= 1 ~t1_pc~0)) (.cse25 (= ~m_st~0 2)) (.cse21 (< ~E_1~0 2)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse24 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse26 (= |old(~E_2~0)| ~E_2~0)) (.cse2 (= ~token~0 0)) (.cse4 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~T1_E~0 0)) (.cse28 (< |old(~t2_st~0)| 2)) (.cse8 (not (= 0 ~local~0))) (.cse14 (= ~T2_E~0 0)) (.cse15 (= 0 ~M_E~0)) (.cse16 (= 1 ~E_M~0)) (.cse17 (not (= 1 ~t2_pc~0))) (.cse7 (not (= |old(~token~0)| 0))) (.cse19 (< |old(~E_2~0)| 2)) (.cse20 (= 0 ~E_M~0)) (.cse29 (< 0 |old(~t1_pc~0)|))) (and (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse0 .cse1 .cse2 (= ~E_2~0 2) .cse3 .cse4) .cse5 .cse6 (not (= 1 ~t1_i~0)) (or .cse7 .cse8 .cse9) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse10 (not (= 1 ~t2_i~0)) .cse11 (not (= 2 ~M_E~0))) (or .cse12 .cse13 (and (= ~t2_st~0 2) .cse3) .cse14 (or .cse6 .cse10 (not (= 2 |old(~t2_st~0)|))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse12 (< 0 ~t2_pc~0) .cse13 .cse22 .cse14 .cse15 .cse16 .cse18 (and .cse23 .cse24 .cse25 .cse26 .cse4) .cse19 .cse20) (or (and .cse27 .cse24 .cse25 .cse26 .cse4) .cse21 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse12 (and .cse25 .cse26 .cse1 .cse3 .cse4) .cse14 .cse15 .cse5 .cse16 .cse6 .cse10 .cse19 .cse20 .cse30 .cse11) (or .cse21 .cse12 .cse28 (< ~local~0 |old(~token~0)|) .cse13 .cse22 (< |old(~token~0)| ~local~0) .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse23 .cse24 (= ~token~0 |old(~token~0)|) .cse25 .cse26 .cse4) .cse19 .cse20) (or .cse21 (and .cse27 .cse0 .cse24 .cse26 .cse2 .cse4) .cse12 .cse28 .cse8 .cse14 .cse15 .cse16 .cse17 .cse7 .cse31 .cse19 .cse20 .cse29 .cse9))))) [2018-12-09 09:15:09,743 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-09 09:15:09,743 INFO L444 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse24 (= 0 |old(~m_st~0)|))) (let ((.cse14 (not (= 1 ~m_pc~0))) (.cse8 (not (= 2 |old(~m_st~0)|))) (.cse25 (not .cse24)) (.cse26 (not (= 0 ~m_pc~0)))) (let ((.cse17 (let ((.cse27 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse27 .cse14 .cse8) (or .cse25 .cse27 .cse26)))) (.cse18 (not (= |old(~t1_pc~0)| 0))) (.cse21 (not (= 2 ~E_1~0))) (.cse22 (not (= 0 ~t2_pc~0))) (.cse7 (< |old(~t2_st~0)| 2)) (.cse20 (not (= 0 ~local~0))) (.cse13 (not (= 1 ~t2_pc~0))) (.cse19 (not (= |old(~token~0)| 0))) (.cse23 (< 0 |old(~t1_pc~0)|)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse9 (not (= |old(~t1_pc~0)| 1))) (.cse10 (= ~T2_E~0 0)) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 ~E_M~0)) (.cse15 (< |old(~E_2~0)| 2)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse4 (= ~m_st~0 2)) (.cse5 (= |old(~E_2~0)| ~E_2~0)) (.cse6 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= 0 ~E_M~0))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= ~token~0 |old(~token~0)|) .cse4 .cse5 .cse6) .cse7 (< ~local~0 |old(~token~0)|) .cse8 .cse9 (< |old(~token~0)| ~local~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse17 .cse18 (not (= 1 ~t1_i~0)) (or .cse19 .cse20) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse21 (not (= 1 ~t2_i~0)) .cse22 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23) (or .cse1 .cse10 .cse11 .cse17 .cse12 .cse18 .cse21 .cse15 .cse16 .cse24 .cse22) (or .cse0 .cse1 .cse7 .cse20 .cse10 .cse11 .cse12 .cse13 .cse19 .cse25 .cse15 .cse16 .cse23 .cse26) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse16))))) [2018-12-09 09:15:09,743 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-12-09 09:15:09,744 INFO L444 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse32 (= 0 |old(~m_st~0)|))) (let ((.cse11 (not (= 1 ~m_pc~0))) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse22 (not .cse32)) (.cse24 (not (= 0 ~m_pc~0)))) (let ((.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (= ~token~0 0)) (.cse21 (not (= |old(~token~0)| 0))) (.cse15 (not (= 0 ~local~0))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse7 (<= 2 ~E_2~0)) (.cse27 (= ~t1_pc~0 1)) (.cse28 (= ~t1_st~0 2)) (.cse29 (= ~t2_st~0 0)) (.cse25 (let ((.cse33 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse33 .cse11 .cse2) (or .cse22 .cse33 .cse24)))) (.cse26 (not (= |old(~t1_pc~0)| 0))) (.cse30 (not (= 2 ~E_1~0))) (.cse31 (not (= 0 ~t2_pc~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse4 (= 1 ~t1_pc~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse17 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse5 (= ~m_st~0 2)) (.cse19 (<= |old(~E_2~0)| ~E_2~0)) (.cse14 (< |old(~t2_st~0)| 2)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse20 (not (= 1 ~t2_pc~0))) (.cse12 (< |old(~E_2~0)| 2)) (.cse13 (= 0 ~E_M~0)) (.cse23 (< 0 |old(~t1_pc~0)|))) (and (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse15 (and .cse4 .cse6 .cse16 .cse17 .cse18 .cse19) .cse8 .cse9 .cse10 .cse20 .cse21 .cse22 .cse12 .cse13 .cse23 .cse24) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse25 .cse26 (and .cse27 .cse16 .cse28 .cse29 .cse18 .cse19) (not (= 1 ~t1_i~0)) (or .cse21 .cse15 .cse24) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse30 (not (= 1 ~t2_i~0)) .cse31 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse14 (< ~local~0 |old(~token~0)|) .cse2 .cse3 (< |old(~token~0)| ~local~0) .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 (and .cse4 .cse6 (<= ~token~0 (+ |old(~token~0)| 1)) .cse7 .cse5 (<= (+ ~local~0 1) ~token~0)) .cse13 (and .cse4 .cse6 .cse7 .cse17 .cse5)) (or .cse1 .cse8 .cse9 (and .cse27 .cse5 .cse28 .cse29 .cse19) .cse25 .cse10 .cse26 .cse30 .cse12 .cse13 .cse32 .cse31) (or .cse0 .cse1 (and .cse4 .cse6 .cse17 .cse5 .cse19) .cse14 .cse2 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse23))))) [2018-12-09 09:15:09,744 INFO L444 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse24 (= 0 |old(~m_st~0)|))) (let ((.cse15 (not (= 1 ~m_pc~0))) (.cse9 (not (= 2 |old(~m_st~0)|))) (.cse25 (not .cse24)) (.cse26 (not (= 0 ~m_pc~0)))) (let ((.cse0 (let ((.cse27 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse27 .cse15 .cse9) (or .cse25 .cse27 .cse26)))) (.cse1 (not (= |old(~t1_pc~0)| 0))) (.cse4 (not (= 2 ~E_1~0))) (.cse5 (not (= 0 ~t2_pc~0))) (.cse16 (= 1 ~t1_pc~0)) (.cse18 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse19 (= ~m_st~0 2)) (.cse20 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (not (= ~E_2~0 0))) (.cse10 (not (= |old(~t1_pc~0)| 1))) (.cse6 (< ~E_1~0 2)) (.cse7 (= ~T1_E~0 0)) (.cse8 (< |old(~t2_st~0)| 2)) (.cse3 (not (= 0 ~local~0))) (.cse11 (= ~T2_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse14 (not (= 1 ~t2_pc~0))) (.cse2 (not (= |old(~token~0)| 0))) (.cse21 (< |old(~E_2~0)| 2)) (.cse22 (= 0 ~E_M~0)) (.cse23 (< 0 |old(~t1_pc~0)|))) (and (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse0 .cse1 (not (= 1 ~t1_i~0)) (or .cse2 .cse3) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse4 (not (= 1 ~t2_i~0)) .cse5 (not (= 2 ~M_E~0))) (or .cse6 .cse7 .cse8 (< ~local~0 |old(~token~0)|) .cse9 .cse10 (< |old(~token~0)| ~local~0) .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 (<= ~token~0 (+ |old(~token~0)| 1)) .cse17 .cse18 .cse19 (<= (+ ~local~0 1) ~token~0) .cse20) .cse21 .cse22) (or .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse22 .cse23) (or .cse7 .cse11 .cse12 .cse0 .cse13 .cse1 .cse4 .cse21 .cse22 .cse24 .cse5) (or .cse6 .cse7 (< 0 ~t2_pc~0) (and .cse16 .cse18 .cse19 .cse20 .cse17) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse22) (or .cse6 .cse7 .cse8 .cse3 .cse11 .cse12 .cse13 .cse14 .cse2 .cse25 .cse21 .cse22 .cse23 .cse26))))) [2018-12-09 09:15:09,744 INFO L448 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-12-09 09:15:09,744 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-12-09 09:15:09,744 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse36 (= 1 ~m_pc~0)) (.cse21 (= 0 |old(~m_st~0)|)) (.cse37 (+ ~local~0 2)) (.cse28 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse29 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse27 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= ~t1_st~0 0)) (.cse38 (+ ~local~0 1))) (let ((.cse10 (< ~token~0 .cse38)) (.cse13 (< .cse38 ~token~0)) (.cse23 (and .cse27 .cse30 (= ~t2_st~0 0))) (.cse18 (not (= ~t1_pc~0 0))) (.cse24 (not (= 0 ~m_pc~0))) (.cse20 (not (= 0 |old(~t2_st~0)|))) (.cse22 (not (= 0 ~t2_pc~0))) (.cse31 (< ~local~0 ~token~0)) (.cse32 (< ~token~0 ~local~0)) (.cse35 (< 0 ~t2_pc~0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse6 (and .cse28 (= ~m_st~0 2) .cse29)) (.cse16 (= 0 ~E_2~0)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse19 (not (= 1 ~E_1~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse15 (< |old(~t2_st~0)| 2)) (.cse25 (< .cse37 ~token~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< |old(~t1_st~0)| 2)) (.cse33 (not .cse21)) (.cse11 (not .cse36)) (.cse34 (and .cse27 .cse28 .cse29)) (.cse12 (< ~E_2~0 2)) (.cse14 (= 0 ~E_M~0)) (.cse26 (< ~token~0 .cse37))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse6 .cse10 .cse11 .cse13 .cse14 .cse16) (or .cse1 .cse4 .cse5 .cse17 .cse7 .cse18 .cse19 .cse20 .cse12 .cse14 .cse21 .cse22 .cse23 .cse24) (or .cse0 (not .cse7) .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse8 .cse9 .cse6 .cse11 .cse12 .cse26) (or (or (and (<= 2 ~t1_st~0) .cse27 .cse28 .cse29) (and .cse27 .cse28 .cse30 .cse29)) .cse31 .cse32 (and (or .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse19 .cse12 .cse14 .cse21) (or .cse1 .cse15 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse19 .cse11 .cse12 .cse14 .cse21))) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) .cse23 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse18 .cse33 (not (= 0 ~local~0)) .cse24 .cse17) (not (= ~m_i~0 1)) .cse20 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse22 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse6 .cse14) (or .cse1 .cse34 .cse35 .cse31 .cse3 .cse32 .cse4 .cse5 .cse7 .cse9 .cse19 .cse12 .cse14 .cse21 .cse36) (or .cse0 .cse1 .cse35 .cse2 .cse6 .cse3 .cse4 .cse5 .cse7 .cse11 .cse14 .cse16) (or .cse1 .cse15 .cse4 .cse5 .cse17 .cse7 .cse8 .cse19 (and .cse27 .cse28 .cse30) .cse12 .cse14 .cse21 (< 0 ~t1_pc~0) .cse36) (or .cse0 .cse1 .cse15 .cse25 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse33 .cse11 .cse34 .cse12 .cse14 .cse26)))) [2018-12-09 09:15:09,745 INFO L444 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse16 (= 1 ~m_pc~0)) (.cse24 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse27 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= 0 |old(~m_st~0)|)) (.cse38 (+ ~local~0 2)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= activate_threads_~tmp~1 0)) (.cse25 (= ~t1_st~0 0)) (.cse39 (+ ~local~0 1))) (let ((.cse20 (< ~token~0 .cse39)) (.cse22 (< .cse39 ~token~0)) (.cse26 (= ~m_st~0 0)) (.cse2 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse29 (and .cse11 .cse12 .cse25 (= ~t2_st~0 0))) (.cse30 (not (= ~t1_pc~0 0))) (.cse33 (not (= 0 |old(~t2_st~0)|))) (.cse34 (not (= 0 ~t2_pc~0))) (.cse32 (not (= 0 ~m_pc~0))) (.cse35 (< .cse38 ~token~0)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse31 (not .cse15)) (.cse36 (< ~token~0 .cse38)) (.cse17 (< ~E_1~0 2)) (.cse37 (< 0 ~t2_pc~0)) (.cse18 (not (= 2 |old(~m_st~0)|))) (.cse19 (and .cse24 (= ~m_st~0 2) .cse27)) (.cse3 (not (= ~t1_pc~0 1))) (.cse21 (not .cse16)) (.cse23 (= 0 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse28 (not (= |old(~t1_st~0)| 0))) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (not (= 1 ~E_1~0))) (.cse13 (< ~E_2~0 2)) (.cse14 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse18 .cse3 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse20 .cse21 .cse13 .cse22 .cse14) (or .cse17 .cse0 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse19 .cse20 .cse21 .cse22 .cse14 .cse23) (or (or (and .cse24 (or (and .cse11 .cse25) (and .cse26 .cse25)) .cse27) (and .cse24 (<= 2 ~t1_st~0) (or .cse11 .cse26) .cse27)) .cse2 .cse4 (and (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse28 .cse7 .cse8 .cse10 .cse21 .cse13 .cse14 .cse15))) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) .cse29 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse30 .cse31 (not (= 0 ~local~0)) .cse32 .cse28) (not (= ~m_i~0 1)) .cse33 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse34 (not (= 2 ~M_E~0))) (or .cse17 (not .cse7) .cse0 .cse18 .cse35 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse21 (and .cse26 .cse24 .cse27) .cse13 .cse36) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse5 (and .cse11 .cse24 .cse12 .cse27) .cse6 .cse7 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16) (or .cse29 .cse0 .cse5 .cse6 .cse28 .cse7 .cse30 .cse10 .cse33 .cse13 .cse14 .cse15 .cse34 .cse32) (or .cse17 .cse0 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse13 .cse19 .cse14) (or .cse17 .cse0 .cse1 .cse35 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse21 .cse13 .cse14 (and .cse11 .cse24 .cse27) .cse36) (or .cse17 .cse0 .cse37 .cse18 .cse19 .cse3 .cse5 .cse6 .cse7 .cse21 .cse14 .cse23) (or .cse0 .cse1 (and .cse11 .cse24 .cse12 .cse25) .cse5 .cse6 .cse28 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 (< 0 ~t1_pc~0) .cse16)))) [2018-12-09 09:15:09,745 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-09 09:15:09,745 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-12-09 09:15:09,745 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse36 (= 1 ~m_pc~0)) (.cse21 (= 0 |old(~m_st~0)|)) (.cse37 (+ ~local~0 2)) (.cse28 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse29 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse27 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= ~t1_st~0 0)) (.cse38 (+ ~local~0 1))) (let ((.cse10 (< ~token~0 .cse38)) (.cse13 (< .cse38 ~token~0)) (.cse23 (and .cse27 .cse30 (= ~t2_st~0 0))) (.cse18 (not (= ~t1_pc~0 0))) (.cse24 (not (= 0 ~m_pc~0))) (.cse20 (not (= 0 |old(~t2_st~0)|))) (.cse22 (not (= 0 ~t2_pc~0))) (.cse31 (< ~local~0 ~token~0)) (.cse32 (< ~token~0 ~local~0)) (.cse35 (< 0 ~t2_pc~0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse6 (and .cse28 (= ~m_st~0 2) .cse29)) (.cse16 (= 0 ~E_2~0)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse19 (not (= 1 ~E_1~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse15 (< |old(~t2_st~0)| 2)) (.cse25 (< .cse37 ~token~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< |old(~t1_st~0)| 2)) (.cse33 (not .cse21)) (.cse11 (not .cse36)) (.cse34 (and .cse27 .cse28 .cse29)) (.cse12 (< ~E_2~0 2)) (.cse14 (= 0 ~E_M~0)) (.cse26 (< ~token~0 .cse37))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse6 .cse10 .cse11 .cse13 .cse14 .cse16) (or .cse1 .cse4 .cse5 .cse17 .cse7 .cse18 .cse19 .cse20 .cse12 .cse14 .cse21 .cse22 .cse23 .cse24) (or .cse0 (not .cse7) .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse8 .cse9 .cse6 .cse11 .cse12 .cse26) (or (or (and (<= 2 ~t1_st~0) .cse27 .cse28 .cse29) (and .cse27 .cse28 .cse30 .cse29)) .cse31 .cse32 (and (or .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse19 .cse12 .cse14 .cse21) (or .cse1 .cse15 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse19 .cse11 .cse12 .cse14 .cse21))) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) .cse23 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse18 .cse33 (not (= 0 ~local~0)) .cse24 .cse17) (not (= ~m_i~0 1)) .cse20 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse22 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse6 .cse14) (or .cse1 .cse34 .cse35 .cse31 .cse3 .cse32 .cse4 .cse5 .cse7 .cse9 .cse19 .cse12 .cse14 .cse21 .cse36) (or .cse0 .cse1 .cse35 .cse2 .cse6 .cse3 .cse4 .cse5 .cse7 .cse11 .cse14 .cse16) (or .cse1 .cse15 .cse4 .cse5 .cse17 .cse7 .cse8 .cse19 (and .cse27 .cse28 .cse30) .cse12 .cse14 .cse21 (< 0 ~t1_pc~0) .cse36) (or .cse0 .cse1 .cse15 .cse25 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse33 .cse11 .cse34 .cse12 .cse14 .cse26)))) [2018-12-09 09:15:09,745 INFO L448 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-12-09 09:15:09,746 INFO L448 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-12-09 09:15:09,746 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-12-09 09:15:09,746 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-12-09 09:15:09,746 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-09 09:15:09,746 INFO L444 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse24 (= 1 ~m_pc~0)) (.cse16 (= activate_threads_~tmp___0~0 0)) (.cse26 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (= 0 |old(~m_st~0)|)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse19 (= activate_threads_~tmp~1 0)) (.cse20 (= ~t1_st~0 0)) (.cse40 (+ ~local~0 1)) (.cse41 (+ ~local~0 2))) (let ((.cse27 (< .cse41 ~token~0)) (.cse28 (< ~token~0 .cse41)) (.cse10 (< ~token~0 .cse40)) (.cse13 (< .cse40 ~token~0)) (.cse25 (= ~m_st~0 0)) (.cse15 (< |old(~t2_st~0)| 2)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse33 (and .cse17 .cse18 .cse19 .cse20)) (.cse31 (< ~local~0 ~token~0)) (.cse32 (< ~token~0 ~local~0)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse29 (not .cse23)) (.cse0 (< ~E_1~0 2)) (.cse34 (< 0 ~t2_pc~0)) (.cse2 (and .cse16 .cse18 (= ~m_st~0 2) .cse26)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse11 (not .cse24)) (.cse30 (= 0 ~E_2~0)) (.cse1 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse7 (= 1 ~E_M~0)) (.cse36 (not (= ~t1_pc~0 0))) (.cse22 (not (= 1 ~E_1~0))) (.cse35 (and .cse16 .cse17 .cse19 .cse20 (= ~t2_st~0 0))) (.cse38 (not (= 0 |old(~t2_st~0)|))) (.cse12 (< ~E_2~0 2)) (.cse14 (= 0 ~E_M~0)) (.cse39 (not (= 0 ~t2_pc~0))) (.cse37 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14) (or .cse1 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20) .cse5 .cse6 .cse21 .cse7 .cse8 .cse22 .cse12 .cse14 .cse23 (< 0 ~t1_pc~0) .cse24) (or (and .cse25 .cse16 .cse18 .cse26) .cse0 (not .cse7) .cse1 .cse3 .cse2 .cse27 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse28) (or .cse0 (and .cse16 .cse17 .cse18 .cse26) .cse1 .cse15 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse11 .cse12 .cse14 .cse28) (or .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse10 .cse11 .cse13 .cse14 .cse30) (or .cse1 .cse15 .cse31 .cse4 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse33 .cse12 .cse14 .cse23 .cse24) (or .cse31 .cse32 (and .cse18 (or (and .cse17 .cse20) (and .cse25 .cse20))) (and (or .cse1 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse12 .cse14 .cse23) (or .cse1 .cse15 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse22 .cse11 .cse12 .cse14 .cse23))) (or .cse1 .cse34 .cse33 .cse31 .cse4 .cse32 .cse5 .cse6 .cse7 .cse9 .cse22 .cse12 .cse14 .cse23 .cse24) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse35 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse36 .cse29 (not (= 0 ~local~0)) .cse37 .cse21) (not (= ~m_i~0 1)) .cse38 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse39 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse14 .cse30) (or .cse1 .cse5 .cse6 .cse21 .cse7 .cse36 .cse22 .cse35 .cse38 .cse12 .cse14 .cse23 .cse39 .cse37)))) [2018-12-09 09:15:09,746 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-12-09 09:15:09,747 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse27 (= 1 ~m_pc~0)) (.cse22 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse23 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse24 (< ~local~0 ~token~0)) (.cse25 (< ~token~0 ~local~0)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse0 (< ~E_1~0 2)) (.cse26 (< 0 ~t2_pc~0)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse9 (and .cse22 (= ~m_st~0 2) .cse23)) (.cse4 (not (= ~t1_pc~0 1))) (.cse11 (not .cse27)) (.cse13 (= 0 ~E_2~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse15 (not (= 1 ~E_1~0))) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= ~t1_st~0 0)) (.cse16 (< ~E_2~0 2)) (.cse12 (= 0 ~E_M~0)) (.cse17 (= 0 |old(~m_st~0)|))) (and (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse10) .cse11 (< .cse10 ~token~0) .cse12 .cse13)) (or .cse1 .cse5 .cse6 .cse14 .cse7 (not (= ~t1_pc~0 0)) .cse15 (not (= 0 |old(~t2_st~0)|)) .cse16 .cse12 .cse17 (not (= 0 ~t2_pc~0)) (and .cse18 .cse19 (= ~t2_st~0 0)) (not (= 0 ~m_pc~0))) (let ((.cse20 (+ ~local~0 2))) (or .cse0 (not .cse7) .cse1 .cse3 (< .cse20 ~token~0) .cse4 .cse5 .cse6 .cse8 .cse21 .cse9 .cse11 .cse16 (< ~token~0 .cse20))) (or (or (and (<= 2 ~t1_st~0) .cse18 .cse22 .cse23) (and .cse18 .cse22 .cse19 .cse23)) .cse24 .cse25 (and (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse15 .cse16 .cse12 .cse17) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse15 .cse11 .cse16 .cse12 .cse17))) (or .cse1 (and .cse18 .cse22 .cse23) .cse26 .cse24 .cse4 .cse25 .cse5 .cse6 .cse7 .cse21 .cse15 .cse16 .cse12 .cse17 .cse27) (or .cse0 .cse1 .cse26 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse5 .cse6 .cse14 .cse7 .cse8 .cse15 (and .cse18 .cse22 .cse19) .cse16 .cse12 .cse17 (< 0 ~t1_pc~0) .cse27)))) [2018-12-09 09:15:09,747 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-12-09 09:15:09,747 INFO L444 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse13 (not (= ~t1_pc~0 0))) (.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse9 (not (= 1 ~m_pc~0))) (.cse1 (= ~T1_E~0 0)) (.cse15 (not (= 0 ~local~0))) (.cse18 (not (= 2 ~E_1~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse19 (not (= 0 |old(~t2_pc~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse14 (not (= |old(~token~0)| 0))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse10 (< ~E_2~0 2)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse16 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse12 .cse13 (not (= 1 ~t1_i~0)) (or .cse14 .cse15 .cse16) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) .cse17 (not (= ~m_i~0 1)) .cse18 (not (= 1 ~t2_i~0)) .cse19 (not (= 2 ~M_E~0))) (or .cse7 .cse13 (or .cse1 .cse11 .cse5 .cse6) .cse9 .cse3 .cse18 .cse10 .cse19 .cse12) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (and (= |old(~E_M~0)| ~E_M~0) (= 1 ~t2_pc~0) (<= |old(~t2_st~0)| ~t2_st~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 2) (<= |old(~t1_st~0)| ~t1_st~0)) .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 (< |old(~token~0)| .cse20) .cse9 .cse10 (< .cse20 |old(~token~0)|) .cse11)) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) .cse5 .cse6 .cse12 .cse7 .cse9 .cse10 .cse11) (or .cse1 (or .cse15 .cse18 .cse4 .cse19) .cse5 .cse6 .cse7 .cse14 .cse8 .cse17 .cse10 .cse11 .cse16))) [2018-12-09 09:15:09,747 INFO L444 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse15 (not (= ~E_M~0 0))) (.cse16 (not (= ~E_M~0 1))) (.cse17 (= 1 ~t2_pc~0)) (.cse18 (= ~m_st~0 2)) (.cse22 (<= 2 ~t2_st~0)) (.cse29 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (< 0 |old(~t2_pc~0)|)) (.cse19 (= ~t1_st~0 0)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse14 (not (= ~t1_pc~0 0))) (.cse26 (not (= 0 ~local~0))) (.cse20 (not (= 2 ~E_1~0))) (.cse21 (not (= 0 |old(~t2_pc~0)|))) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse24 (= ~token~0 0)) (.cse25 (not (= |old(~token~0)| 0))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse27 (not (= 0 ~m_pc~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse6 (and .cse15 .cse16 .cse17 .cse18 .cse22 .cse29)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< ~E_2~0 2)) (.cse12 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (or .cse1 .cse12 .cse5 .cse7) .cse3 .cse13 .cse8 .cse14 .cse10 (and .cse15 .cse16 .cse17 .cse18 (= ~t2_st~0 2) .cse19) .cse20 .cse11 .cse21) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) (and .cse15 .cse16 .cse17 (= ~token~0 |old(~token~0)|) .cse18 .cse22 .cse19) .cse5 .cse7 .cse13 .cse8 .cse10 .cse11 .cse12) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (and .cse15 .cse16 .cse17 .cse23 .cse22 .cse19 .cse24) .cse13 .cse14 (not (= 1 ~t1_i~0)) (or .cse25 .cse26 .cse27) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) .cse28 (not (= ~m_i~0 1)) .cse20 (not (= 1 ~t2_i~0)) .cse21 (not (= 2 ~M_E~0))) (or .cse1 (or .cse26 .cse20 .cse4 .cse21) (and .cse15 .cse16 .cse17 .cse23 .cse22 .cse24 .cse29) .cse5 .cse7 .cse8 .cse25 .cse9 .cse28 .cse11 .cse12 .cse27) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse1 (let ((.cse30 (+ ~local~0 2))) (and (= ~m_st~0 0) .cse15 .cse16 (<= ~token~0 .cse30) .cse17 .cse22 (<= .cse30 ~token~0) .cse29)) .cse6 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= 1 |old(~t2_pc~0)|)) .cse9 (< |old(~token~0)| .cse31) .cse10 .cse11 (< .cse31 |old(~token~0)|) .cse12))))) [2018-12-09 09:15:09,747 INFO L448 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-12-09 09:15:09,748 INFO L444 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse13 (not (= ~t1_pc~0 0))) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse15 (not (= 0 ~local~0))) (.cse18 (not (= 2 ~E_1~0))) (.cse19 (not (= 0 |old(~t2_pc~0)|))) (.cse14 (not (= |old(~token~0)| 0))) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse16 (not (= 0 ~m_pc~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse9 (not (= 1 ~m_pc~0))) (.cse10 (< ~E_2~0 2)) (.cse11 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse12 .cse13 (not (= 1 ~t1_i~0)) (or .cse14 .cse15 .cse16) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) .cse17 (not (= ~m_i~0 1)) .cse18 (not (= 1 ~t2_i~0)) .cse19 (not (= 2 ~M_E~0))) (or .cse7 .cse13 (or .cse1 .cse11 .cse5 .cse6) .cse9 .cse3 .cse18 .cse10 .cse19 .cse12) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) .cse5 .cse6 .cse12 .cse7 .cse9 .cse10 .cse11) (or .cse1 (or .cse15 .cse18 .cse4 .cse19) .cse5 .cse6 .cse7 .cse14 .cse8 .cse17 .cse10 .cse11 .cse16) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 (< |old(~token~0)| .cse20) .cse9 (let ((.cse21 (+ ~local~0 2))) (and (<= ~token~0 .cse21) (= 1 ~t2_pc~0) (<= |old(~t2_st~0)| ~t2_st~0) (= ~m_st~0 2) (<= .cse21 ~token~0) (<= |old(~t1_st~0)| ~t1_st~0) (= 1 ~E_M~0))) .cse10 (< .cse20 |old(~token~0)|) .cse11)))) [2018-12-09 09:15:09,748 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-12-09 09:15:09,748 INFO L444 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse34 (not .cse5)) (.cse35 (not (= ~M_E~0 0))) (.cse18 (= ~m_st~0 2)) (.cse15 (not (= ~E_M~0 0))) (.cse33 (not .cse1)) (.cse36 (= 1 ~m_pc~0)) (.cse16 (not (= ~E_M~0 1))) (.cse24 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (< 0 |old(~t2_pc~0)|)) (.cse0 (< ~E_1~0 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse10 (and (and (and (= 1 ~t1_pc~0) (and .cse34 (= ~m_st~0 |old(~m_st~0)|) .cse35 .cse18 .cse15 .cse33 .cse36) (<= 2 ~E_1~0)) .cse16) .cse24)) (.cse9 (not .cse36)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse14 (not (= ~t1_pc~0 0))) (.cse19 (= ~t1_st~0 0)) (.cse27 (not (= 0 ~local~0))) (.cse20 (not (= 2 ~E_1~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse21 (not (= 0 |old(~t2_pc~0)|))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse26 (not (= |old(~token~0)| 0))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse11 (< ~E_2~0 2)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse17 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse29 (<= ~t2_pc~0 0)) (.cse22 (= ~m_st~0 0)) (.cse30 (and .cse33 .cse34 .cse35 .cse15)) (.cse31 (= ~token~0 0)) (.cse28 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (or .cse1 .cse12 .cse5 .cse6) .cse3 .cse13 .cse7 .cse14 .cse9 (and .cse15 .cse16 .cse17 .cse18 (= ~t2_pc~0 0) .cse19) .cse20 .cse11 .cse21) (or .cse0 (and .cse17 (<= ~token~0 ~local~0) (and (and .cse15 .cse19) .cse18) (<= ~local~0 ~token~0) .cse16) .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) .cse5 .cse6 .cse13 .cse7 .cse9 .cse11 .cse12) (let ((.cse25 (+ ~local~0 1))) (or .cse0 (let ((.cse23 (+ ~local~0 2))) (and .cse22 .cse15 .cse16 (<= ~token~0 .cse23) (= 1 ~t2_pc~0) (<= .cse23 ~token~0) .cse24)) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 (< |old(~token~0)| .cse25) .cse10 .cse9 .cse11 (< .cse25 |old(~token~0)|) .cse12)) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse13 .cse14 (not (= 1 ~t1_i~0)) (or .cse26 .cse27 .cse28) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) (and .cse17 .cse29 (and (and .cse19 .cse30) (and .cse22 .cse31)) .cse16) .cse32 (not (= ~m_i~0 1)) .cse20 (not (= 1 ~t2_i~0)) .cse21 (not (= 2 ~M_E~0))) (or .cse1 (or .cse27 .cse20 .cse4 .cse21) .cse5 .cse6 .cse7 .cse26 .cse8 .cse32 .cse11 .cse12 (and .cse17 .cse29 (and .cse22 .cse30) .cse31 .cse24 .cse16) .cse28))))) [2018-12-09 09:15:09,748 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-12-09 09:15:09,748 INFO L444 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse20 (not (= 0 ~local~0))) (.cse19 (not (= |old(~token~0)| 0))) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse24 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (= ~token~0 0)) (.cse21 (not (= 0 ~m_pc~0))) (.cse11 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (< |old(~t1_st~0)| 2)) (.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse4 (not (= ~t1_pc~0 1))) (.cse7 (<= ~t2_pc~0 0)) (.cse29 (= ~token~0 |old(~token~0)|)) (.cse1 (= ~T1_E~0 0)) (.cse16 (= 0 |old(~E_M~0)|)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse10 (= ~m_st~0 2)) (.cse25 (= ~t2_pc~0 0)) (.cse26 (= ~t1_st~0 0)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse12 (= 1 |old(~E_M~0)|)) (.cse18 (not (= ~t1_pc~0 0))) (.cse14 (not (= 1 ~m_pc~0))) (.cse23 (not (= 2 ~E_1~0))) (.cse15 (< ~E_2~0 2)) (.cse28 (not (= 0 |old(~t2_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse17 .cse18 (not (= 1 ~t1_i~0)) (or .cse19 .cse20 .cse21) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) .cse22 (not (= ~m_i~0 1)) .cse23 (not (= 1 ~t2_i~0)) (and .cse24 .cse9 (= ~E_M~0 2) .cse25 .cse26 .cse27) .cse28 (not (= 2 ~M_E~0))) (or .cse1 (or .cse20 .cse23 .cse4 .cse28) .cse5 .cse6 .cse12 .cse19 .cse13 .cse22 .cse15 (and .cse8 .cse24 .cse9 .cse25 .cse27 .cse11) .cse16 .cse21) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse25 .cse14 .cse23 .cse15 .cse16 .cse28) (let ((.cse30 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (and .cse8 (= 1 ~t2_pc~0) .cse9 .cse29 .cse10 .cse11) .cse12 (not (= 1 |old(~t2_pc~0)|)) .cse13 (< |old(~token~0)| .cse30) .cse14 .cse15 (< .cse30 |old(~token~0)|) .cse16)) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) .cse5 .cse6 .cse17 .cse12 .cse14 .cse15 .cse16 (and .cse7 .cse8 .cse9 .cse29 .cse10 .cse26)) (or (or .cse1 .cse16 .cse5 .cse6) (and .cse8 .cse9 .cse10 .cse25 .cse26) .cse3 .cse17 .cse12 .cse18 .cse14 .cse23 .cse15 .cse28))) [2018-12-09 09:15:09,749 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-09 09:15:09,749 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-12-09 09:15:09,749 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-12-09 09:15:09,749 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-12-09 09:15:09,749 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-12-09 09:15:09,749 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-12-09 09:15:09,749 INFO L444 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse26 (= 0 ~m_st~0))) (let ((.cse11 (not .cse26)) (.cse14 (not (= 0 ~m_pc~0))) (.cse22 (not (= 0 ~t2_st~0))) (.cse17 (not (= 1 ~m_pc~0))) (.cse15 (not (= 2 ~m_st~0))) (.cse24 (not (= 0 ~t2_pc~0)))) (let ((.cse21 (not (= ~t1_pc~0 0))) (.cse19 (< ~local~0 ~token~0)) (.cse20 (< ~token~0 ~local~0)) (.cse0 (< ~E_1~0 2)) (.cse2 (< ~t2_st~0 2)) (.cse16 (not (= ~t1_st~0 0))) (.cse9 (not (= 1 ~t2_pc~0))) (.cse18 (< 0 ~t1_pc~0)) (.cse25 (let ((.cse27 (not (= ~t1_st~0 2)))) (and (or .cse11 .cse27 .cse22 .cse24 .cse14) (or .cse27 .cse22 .cse17 .cse15 .cse24)))) (.cse1 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= exists_runnable_thread_~__retres1~3 1)) (.cse8 (= 1 ~E_M~0)) (.cse12 (< ~E_2~0 2)) (.cse13 (= 0 ~E_M~0)) (.cse10 (not (= ~token~0 0))) (.cse3 (not (= 0 ~local~0))) (.cse23 (not (= 2 ~E_1~0))) (.cse4 (not (= ~t1_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~t1_st~0 2) .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse15 .cse7 .cse5 .cse6 .cse16 .cse8 .cse9 .cse17 .cse12 .cse13 .cse18) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse19 .cse15 .cse4 .cse20 .cse5 .cse6 .cse7 .cse16 .cse8 .cse17 .cse12 .cse13) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) .cse7 (not (= 2 ~E_M~0)) (or .cse10 .cse21 .cse11 .cse3 .cse14 .cse16) (not (= ~m_i~0 1)) .cse22 .cse23 (not (= 1 ~t2_i~0)) .cse24 (not (= 2 ~M_E~0))) (or .cse1 .cse5 .cse6 .cse8 (or .cse21 .cse22 .cse17 .cse15 .cse16) .cse23 .cse12 .cse13 .cse24 .cse7) (or .cse25 .cse1 .cse4 .cse5 .cse6 .cse8 .cse7 .cse23 .cse12 .cse13 .cse26) (or .cse0 .cse1 .cse2 .cse19 .cse15 .cse4 .cse20 .cse5 .cse6 .cse16 .cse8 .cse9 .cse17 .cse12 .cse13 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse7 .cse18 .cse14) (or .cse25 .cse1 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 (or .cse10 .cse3 .cse23 .cse4)))))) [2018-12-09 09:15:09,749 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-12-09 09:15:09,749 INFO L448 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-12-09 09:15:09,750 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse16 (= |old(~T1_E~0)| ~T1_E~0)) (.cse17 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse2 (< ~t2_st~0 2)) (.cse15 (not (= 0 ~m_st~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse3 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse12 (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) .cse16 .cse17)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< ~t1_st~0 2)) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< |old(~E_2~0)| 2)) (.cse13 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse14 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse12 .cse11 .cse13 (< ~token~0 .cse14))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~E_1~0 2) (= ~E_M~0 2) (= ~T2_E~0 2) .cse16 (= ~E_2~0 2) .cse17) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse15 (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= ~t1_st~0 0))) (not (= ~m_i~0 1)) (not (= 0 ~t2_st~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 |old(~M_E~0)|))) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse9 .cse10 .cse11 .cse13) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 (< ~token~0 .cse18) .cse10 .cse11 (< .cse18 ~token~0) .cse13))))) [2018-12-09 09:15:09,750 INFO L448 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-12-09 09:15:09,750 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-12-09 09:15:09,750 INFO L448 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-12-09 09:15:09,750 INFO L448 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-12-09 09:15:09,750 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-12-09 09:15:09,750 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-12-09 09:15:09,750 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-12-09 09:15:09,750 INFO L444 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse27 (= 0 ~m_st~0)) (.cse28 (= 1 ~m_pc~0)) (.cse33 (+ ~local~0 1)) (.cse14 (= 1 ~E_M~0)) (.cse34 (+ ~local~0 2))) (let ((.cse22 (< .cse34 ~token~0)) (.cse24 (< ~token~0 .cse34)) (.cse21 (not .cse14)) (.cse15 (= 0 ~E_2~0)) (.cse13 (< 0 ~t2_pc~0)) (.cse0 (< ~E_1~0 2)) (.cse3 (not (= 2 ~m_st~0))) (.cse25 (< ~token~0 .cse33)) (.cse10 (not .cse28)) (.cse26 (< .cse33 ~token~0)) (.cse19 (< ~local~0 ~token~0)) (.cse4 (not (= ~t1_pc~0 1))) (.cse20 (< ~token~0 ~local~0)) (.cse18 (<= 1 is_transmit1_triggered_~__retres1~1)) (.cse9 (< ~t1_st~0 2)) (.cse23 (not .cse27)) (.cse2 (< ~t2_st~0 2)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse1 (= ~T1_E~0 0)) (.cse6 (= ~T2_E~0 0)) (.cse5 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse7 (= 0 ~M_E~0)) (.cse17 (not (= ~t1_st~0 0))) (.cse29 (not (= ~t1_pc~0 0))) (.cse16 (not (= 1 ~E_1~0))) (.cse31 (not (= 0 ~t2_st~0))) (.cse11 (< ~E_2~0 2)) (.cse12 (= 0 ~E_M~0)) (.cse32 (not (= 0 ~t2_pc~0))) (.cse30 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse7 .cse14 .cse10 .cse12 .cse15 .cse5) (or (and (or .cse14 .cse16 .cse9 .cse2 (or .cse8 .cse1 .cse10 .cse12 .cse6 .cse7) .cse4 .cse11) (or .cse14 .cse16 .cse2 .cse4 .cse11 (or .cse8 .cse1 .cse10 .cse12 .cse6 .cse7 .cse17))) .cse18 .cse19 .cse20) (or .cse5 .cse0 .cse21 .cse1 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse24) (or .cse0 .cse1 .cse2 .cse5 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse12 .cse24) (or .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse14 .cse8 .cse5 .cse25 .cse10 .cse26 .cse12 .cse15) (or .cse1 .cse13 .cse19 .cse4 .cse20 .cse18 .cse6 .cse7 .cse14 .cse9 .cse16 .cse11 .cse12 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse26 .cse12 .cse5) (or .cse1 .cse2 .cse19 .cse4 .cse20 .cse18 .cse6 .cse7 .cse14 .cse8 .cse9 .cse16 .cse11 .cse12 .cse27) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse5 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse29 .cse23 (not (= 0 ~local~0)) .cse30 .cse17) (not (= ~m_i~0 1)) .cse31 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse32 (not (= 2 ~M_E~0))) (or .cse1 .cse2 .cse6 .cse7 .cse17 .cse14 .cse8 .cse16 .cse11 .cse12 .cse27 (< 0 ~t1_pc~0) .cse5 .cse28) (or .cse1 .cse6 .cse5 .cse7 .cse17 .cse14 .cse29 .cse16 .cse31 .cse11 .cse12 .cse27 .cse32 .cse30)))) [2018-12-09 09:15:09,751 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 0) (= ~t2_st~0 0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L448 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-12-09 09:15:09,751 INFO L444 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,752 INFO L444 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_i~0 1) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~t2_i~0 1) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t1_i~0 1) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,752 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,752 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-12-09 09:15:09,752 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-12-09 09:15:09,752 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-09 09:15:09,752 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-09 09:15:09,752 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-09 09:15:09,752 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-09 09:15:09,752 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-12-09 09:15:09,752 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-09 09:15:09,753 INFO L444 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse10 (= ~T1_E~0 0)) (.cse11 (not (= 0 |old(~local~0)|))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 |old(~m_st~0)|)) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 0 ~M_E~0))) (let ((.cse5 (not (= 1 ~t2_pc~0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (or .cse10 .cse11 (= 0 |old(~E_1~0)|) .cse15 .cse16 .cse12 .cse13)) (.cse4 (= 1 ~E_M~0)) (.cse6 (not (= |old(~token~0)| 0))) (.cse7 (< |old(~t1_st~0)| 2)) (.cse8 (< ~E_2~0 2)) (.cse9 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse14 .cse4 .cse5 .cse6 .cse8 .cse15 .cse16 (< 0 ~t1_pc~0) .cse9) (let ((.cse24 (+ |old(~local~0)| 2))) (or (let ((.cse17 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse4 .cse5 .cse0 .cse7 .cse1 (or .cse10 .cse17 .cse15 .cse16 .cse12 .cse13) .cse2 .cse8) (or .cse4 .cse5 .cse0 .cse1 .cse2 .cse8 (or .cse10 .cse17 .cse15 .cse16 .cse12 .cse13 .cse14)))) (let ((.cse18 (+ ~local~0 2))) (and (= ~token~0 |old(~token~0)|) (<= .cse18 ~token~0) (let ((.cse19 (= |old(~E_1~0)| ~E_1~0)) (.cse20 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (= 1 ~m_pc~0)) (.cse23 (<= |old(~t1_st~0)| ~t1_st~0))) (or (and .cse19 (<= 2 ~t1_st~0) .cse20 .cse21 .cse22 .cse23) (and .cse19 .cse20 .cse21 (= ~t1_st~0 0) .cse22 .cse23))) (<= ~token~0 .cse18))) (< .cse24 |old(~token~0)|) (< |old(~token~0)| .cse24))) (or (not (= 2 ~E_2~0)) .cse11 (not (= ~T1_E~0 2)) .cse14 .cse6 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse9 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse16 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 (< 0 ~t2_pc~0) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9)))) [2018-12-09 09:15:09,753 INFO L444 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= 2 ~E_1~0)) (.cse27 (= 1 ~t2_pc~0)) (.cse8 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse9 (= ~m_st~0 2)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= 1 ~m_pc~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse18 (= ~T1_E~0 0)) (.cse19 (not (= 0 |old(~local~0)|))) (.cse23 (= 0 ~E_M~0)) (.cse24 (= 0 |old(~m_st~0)|)) (.cse20 (= ~T2_E~0 0)) (.cse21 (= 0 ~M_E~0))) (let ((.cse2 (or .cse18 .cse19 (= 0 |old(~E_1~0)|) .cse23 .cse24 .cse20 .cse21)) (.cse15 (and (= 1 ~t1_pc~0) (not .cse20) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (<= 2 ~E_2~0) .cse6 .cse7 (not (= ~E_M~0 1)) .cse27 .cse8 .cse9 (<= 2 ~t2_st~0) (not .cse18) .cse10 .cse11 .cse12)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse3 (= 1 ~E_M~0)) (.cse17 (not .cse27)) (.cse0 (< |old(~E_1~0)| 2)) (.cse16 (< |old(~t2_st~0)| 2)) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (< ~E_2~0 2)) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= |old(~token~0)| 0))) (.cse14 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 (< 0 ~t2_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) (or .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse13 .cse14) (or .cse0 .cse18 .cse16 (and .cse8 .cse9 .cse10 .cse11 .cse7) .cse19 .cse20 .cse21 .cse22 .cse3 .cse17 .cse4 .cse13 .cse23 .cse24 (< 0 ~t1_pc~0) .cse14) (let ((.cse26 (+ |old(~local~0)| 2))) (or .cse15 (let ((.cse25 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse3 .cse17 .cse0 .cse5 .cse16 (or .cse18 .cse25 .cse23 .cse24 .cse20 .cse21) .cse1 .cse13) (or .cse3 .cse17 .cse0 .cse16 .cse1 .cse13 (or .cse18 .cse25 .cse23 .cse24 .cse20 .cse21 .cse22)))) (< .cse26 |old(~token~0)|) (< |old(~token~0)| .cse26))) (or (not (= 2 ~E_2~0)) .cse19 (not (= ~T1_E~0 2)) (and (= ~E_1~0 2) .cse9 .cse10 (= ~t2_st~0 0) .cse11) .cse22 .cse4 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse14 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse24 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0)))))) [2018-12-09 09:15:09,753 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse10 (= ~T1_E~0 0)) (.cse11 (not (= 0 |old(~local~0)|))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 |old(~m_st~0)|)) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 0 ~M_E~0))) (let ((.cse5 (not (= 1 ~t2_pc~0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (or .cse10 .cse11 (= 0 |old(~E_1~0)|) .cse15 .cse16 .cse12 .cse13)) (.cse4 (= 1 ~E_M~0)) (.cse6 (not (= |old(~token~0)| 0))) (.cse7 (< |old(~t1_st~0)| 2)) (.cse8 (< ~E_2~0 2)) (.cse9 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse14 .cse4 .cse5 .cse6 .cse8 .cse15 .cse16 (< 0 ~t1_pc~0) .cse9) (let ((.cse18 (+ |old(~local~0)| 2))) (or (let ((.cse17 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse4 .cse5 .cse0 .cse7 .cse1 (or .cse10 .cse17 .cse15 .cse16 .cse12 .cse13) .cse2 .cse8) (or .cse4 .cse5 .cse0 .cse1 .cse2 .cse8 (or .cse10 .cse17 .cse15 .cse16 .cse12 .cse13 .cse14)))) (< .cse18 |old(~token~0)|) (< |old(~token~0)| .cse18))) (or (not (= 2 ~E_2~0)) .cse11 (not (= ~T1_E~0 2)) .cse14 .cse6 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse9 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse16 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 (< 0 ~t2_pc~0) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9)))) [2018-12-09 09:15:09,754 INFO L444 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse11 (not (= 0 |old(~local~0)|))) (.cse16 (= 0 ~E_M~0)) (.cse17 (= 0 |old(~m_st~0)|)) (.cse13 (= 0 ~M_E~0)) (.cse22 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse24 (= ~token~0 |old(~token~0)|)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse12 (= ~T2_E~0 0)) (.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~T1_E~0 0)) (.cse27 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse14 (not (= |old(~t1_st~0)| 0))) (.cse20 (= ~t1_st~0 0)) (.cse0 (< |old(~E_1~0)| 2)) (.cse10 (< |old(~t2_st~0)| 2)) (.cse1 (not (= ~t1_pc~0 1))) (.cse7 (and .cse22 .cse24 (<= ~token~0 ~local~0) (and .cse18 (not .cse12) .cse21 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~m_st~0 0)) .cse19 (not .cse9) (not (= ~E_2~0 0))) .cse27 (<= ~local~0 ~token~0))) (.cse2 (or .cse9 .cse11 (= 0 |old(~E_1~0)|) .cse16 .cse17 .cse12 .cse13)) (.cse3 (= 1 ~E_M~0)) (.cse15 (not (= 1 ~t2_pc~0))) (.cse4 (not (= |old(~token~0)| 0))) (.cse5 (< |old(~t1_st~0)| 2)) (.cse6 (< ~E_2~0 2)) (.cse8 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 (< 0 ~t2_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 .cse6 .cse16 .cse17 (and (and (and .cse18 .cse19 .cse20) .cse21) .cse22) (< 0 ~t1_pc~0) .cse8) (or (not (= 2 ~E_2~0)) .cse11 (not (= ~T1_E~0 2)) .cse14 .cse4 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse8 (not (= ~T2_E~0 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) .cse21 .cse20 (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse17 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (let ((.cse28 (+ |old(~local~0)| 2))) (or (let ((.cse23 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse3 .cse15 .cse0 .cse5 .cse10 (or .cse9 .cse23 .cse16 .cse17 .cse12 .cse13) .cse1 .cse6) (or .cse3 .cse15 .cse0 .cse10 .cse1 .cse6 (or .cse9 .cse23 .cse16 .cse17 .cse12 .cse13 .cse14)))) (let ((.cse25 (+ ~local~0 2))) (and .cse24 (<= .cse25 ~token~0) (let ((.cse26 (= 1 ~m_pc~0))) (or (and .cse18 (<= 2 ~t1_st~0) .cse22 .cse21 .cse26 .cse27) (and .cse18 .cse22 .cse21 .cse20 .cse26 .cse27))) (<= ~token~0 .cse25))) (< .cse28 |old(~token~0)|) (< |old(~token~0)| .cse28))) (or .cse0 .cse10 .cse1 .cse7 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse8)))) [2018-12-09 09:15:09,754 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse5 (= ~T1_E~0 0)) (.cse27 (not (= 0 |old(~local~0)|))) (.cse7 (= 0 ~E_M~0)) (.cse8 (= 0 |old(~m_st~0)|)) (.cse9 (= ~T2_E~0 0)) (.cse10 (= 0 ~M_E~0)) (.cse28 (not (= ~m_pc~0 1))) (.cse17 (= ~E_1~0 1)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse20 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (<= ~local~0 ~token~0))) (let ((.cse2 (< |old(~E_1~0)| 2)) (.cse4 (< |old(~t2_st~0)| 2)) (.cse11 (not (= ~t1_pc~0 1))) (.cse23 (and .cse28 .cse17 .cse14 .cse15 .cse16 .cse20 .cse21)) (.cse24 (or .cse5 .cse27 (= 0 |old(~E_1~0)|) .cse7 .cse8 .cse9 .cse10)) (.cse0 (= 1 ~E_M~0)) (.cse1 (not (= 1 ~t2_pc~0))) (.cse3 (< |old(~t1_st~0)| 2)) (.cse12 (< ~E_2~0 2)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse25 (not (= |old(~token~0)| 0))) (.cse26 (not (= 0 |old(~m_pc~0)|))) (.cse18 (= ~t1_st~0 0))) (and (let ((.cse22 (+ |old(~local~0)| 2))) (or (let ((.cse6 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse4 .cse11 .cse12 (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13)))) (and .cse14 (let ((.cse19 (= 1 ~m_pc~0))) (or (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse16 (<= 2 ~t1_st~0) .cse17 .cse19 .cse20))) .cse21) (< .cse22 |old(~token~0)|) (< |old(~token~0)| .cse22))) (or .cse2 .cse23 (< 0 ~t2_pc~0) .cse11 .cse24 .cse0 .cse25 .cse3 .cse12 .cse26) (or .cse2 .cse5 .cse4 .cse27 .cse9 .cse10 .cse13 .cse0 .cse1 .cse25 .cse12 .cse7 .cse8 (and .cse15 .cse16 .cse28 .cse17 .cse18) (< 0 ~t1_pc~0) .cse26) (or .cse2 .cse4 .cse11 .cse23 .cse24 .cse0 .cse1 .cse25 .cse3 .cse12 .cse26) (or (not (= 2 ~E_2~0)) .cse27 (not (= ~T1_E~0 2)) .cse13 .cse25 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse26 (not (= ~T2_E~0 2)) (and (= ~m_pc~0 0) .cse17 .cse15 .cse18 (= ~t2_st~0 0)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse8 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0)))))) [2018-12-09 09:15:09,754 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-12-09 09:15:09,754 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-12-09 09:15:09,754 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse11 (= ~T1_E~0 0)) (.cse0 (not (= 0 |old(~local~0)|))) (.cse18 (= 0 ~E_M~0)) (.cse9 (= 0 |old(~m_st~0)|)) (.cse13 (= ~T2_E~0 0)) (.cse14 (= 0 ~M_E~0)) (.cse19 (= |old(~E_1~0)| ~E_1~0)) (.cse4 (= ~m_pc~0 0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse7 (= ~token~0 0)) (.cse8 (= ~local~0 0)) (.cse26 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (not (= |old(~t1_st~0)| 0))) (.cse6 (= ~t1_st~0 0)) (.cse10 (< |old(~E_1~0)| 2)) (.cse28 (and .cse19 .cse4 .cse5 .cse20 .cse7 .cse8 .cse26)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse23 (not (= ~t1_pc~0 1))) (.cse29 (or .cse11 .cse0 (= 0 |old(~E_1~0)|) .cse18 .cse9 .cse13 .cse14)) (.cse15 (= 1 ~E_M~0)) (.cse16 (not (= 1 ~t2_pc~0))) (.cse2 (not (= |old(~token~0)| 0))) (.cse21 (< |old(~t1_st~0)| 2)) (.cse17 (< ~E_2~0 2)) (.cse3 (not (= 0 |old(~m_pc~0)|)))) (and (or (not (= 2 ~E_2~0)) .cse0 (not (= ~T1_E~0 2)) .cse1 .cse2 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse3 (and .cse4 (= ~E_1~0 2) .cse5 .cse6 (= ~t2_st~0 0) .cse7 .cse8) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse9 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse1 .cse15 .cse16 .cse2 .cse17 .cse18 .cse9 (and .cse19 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8) (< 0 ~t1_pc~0) .cse3) (let ((.cse27 (+ |old(~local~0)| 2))) (or (let ((.cse22 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse15 .cse16 .cse10 .cse21 .cse12 (or .cse11 .cse22 .cse18 .cse9 .cse13 .cse14) .cse23 .cse17) (or .cse15 .cse16 .cse10 .cse12 .cse23 .cse17 (or .cse11 .cse22 .cse18 .cse9 .cse13 .cse14 .cse1)))) (let ((.cse24 (+ ~local~0 2))) (and (= ~token~0 |old(~token~0)|) (<= .cse24 ~token~0) (let ((.cse25 (= 1 ~m_pc~0))) (or (and .cse19 (<= 2 ~t1_st~0) .cse20 .cse5 .cse25 .cse26) (and .cse19 .cse20 .cse5 .cse6 .cse25 .cse26))) (<= ~token~0 .cse24))) (< .cse27 |old(~token~0)|) (< |old(~token~0)| .cse27))) (or .cse10 (< 0 ~t2_pc~0) .cse23 .cse28 .cse29 .cse15 .cse2 .cse21 .cse17 .cse3) (or .cse10 .cse28 .cse12 .cse23 .cse29 .cse15 .cse16 .cse2 .cse21 .cse17 .cse3)))) [2018-12-09 09:15:09,755 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-12-09 09:15:09,755 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse14 (< ~t2_st~0 2)) (.cse2 (not (= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 |old(~M_E~0)|)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< ~t1_st~0 2)) (.cse11 (not (= 1 ~m_pc~0))) (.cse12 (< ~E_2~0 2)) (.cse6 (= |old(~M_E~0)| ~M_E~0)) (.cse13 (= 0 ~E_M~0))) (and (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse10) .cse11 .cse12 (< .cse10 ~token~0) .cse13)) (let ((.cse15 (+ ~local~0 2))) (or .cse0 .cse1 .cse14 (< .cse15 ~token~0) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (not (= 0 ~m_st~0)) .cse11 .cse6 .cse12 .cse13 (< ~token~0 .cse15))) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse6 .cse13))) [2018-12-09 09:15:09,755 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-12-09 09:15:09,755 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 09:15:09,755 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (or (<= 1 |old(~t1_pc~0)|) (< ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 |old(~m_st~0)|) (<= |old(~t2_st~0)| ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~M_E~0)| ~M_E~0) (<= |old(~t1_st~0)| ~t1_st~0) (= |old(~E_M~0)| ~E_M~0)) [2018-12-09 09:15:09,756 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 09:15:09,756 INFO L451 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-12-09 09:15:09,756 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-12-09 09:15:09,756 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-12-09 09:15:09,756 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-12-09 09:15:09,756 INFO L451 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-12-09 09:15:09,756 INFO L448 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-12-09 09:15:09,756 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-12-09 09:15:09,757 INFO L444 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0))) (let ((.cse35 (+ ~local~0 2)) (.cse20 (= ~t1_st~0 0)) (.cse19 (<= 2 ~t2_st~0)) (.cse29 (= 1 ~t1_pc~0)) (.cse33 (not .cse1)) (.cse17 (not (= ~E_M~0 0))) (.cse18 (not (= ~m_st~0 0))) (.cse15 (= 1 ~t2_pc~0)) (.cse30 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_1~0)) (.cse24 (not (= ~E_M~0 1))) (.cse5 (= ~T2_E~0 0))) (let ((.cse27 (let ((.cse37 (not .cse5)) (.cse38 (= 1 ~m_pc~0)) (.cse39 (not (= ~M_E~0 0))) (.cse36 (<= 2 ~E_2~0))) (or (and .cse19 (and .cse29 .cse15 .cse36 (and .cse33 .cse20 .cse37 .cse38 .cse39 .cse17 .cse18) .cse23) .cse24) (and .cse19 .cse29 (and .cse33 .cse37 .cse38 .cse39 .cse17 .cse18) .cse15 .cse36 .cse30 .cse23 .cse24)))) (.cse26 (<= .cse35 ~token~0)) (.cse28 (<= ~token~0 .cse35))) (let ((.cse2 (< |old(~t2_st~0)| 2)) (.cse13 (and .cse27 .cse26 .cse28)) (.cse8 (not (= 1 |old(~t2_pc~0)|))) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (not (= 1 |old(~m_pc~0)|))) (.cse11 (< |old(~E_2~0)| 2)) (.cse12 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse14) .cse10 .cse11 (< .cse14 |old(~token~0)|) .cse12)) (let ((.cse16 (= ~m_pc~0 0))) (let ((.cse31 (and .cse33 .cse16 .cse17 .cse18)) (.cse21 (= ~token~0 0)) (.cse22 (= ~local~0 0)) (.cse25 (<= |old(~E_2~0)| ~E_2~0))) (or (and .cse15 (<= ~t1_pc~0 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse16 .cse18 (= ~E_1~0 2) (= ~E_M~0 2) (= ~t2_pc~0 0) .cse20 (= ~t2_st~0 0) .cse21 .cse22 (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 2 |old(~E_2~0)|)) (and .cse26 .cse27 .cse28) (not (= ~T1_E~0 2)) (and .cse29 .cse15 .cse30 .cse19 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25) (not (= 1 ~t1_i~0)) (and .cse29 (<= |old(~t2_st~0)| ~t2_st~0) .cse30 (<= ~t2_pc~0 0) .cse31 .cse21 .cse22 .cse23 .cse24 .cse25) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse32 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))))) (let ((.cse34 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 .cse13 (< .cse34 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse10 .cse11 .cse12 (< |old(~token~0)| .cse34))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12)))))) [2018-12-09 09:15:09,759 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-12-09 09:15:09,759 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-12-09 09:15:09,759 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-12-09 09:15:09,759 INFO L444 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse34 (= ~T1_E~0 0)) (.cse39 (= ~T2_E~0 0))) (let ((.cse59 (not (= ~E_2~0 0))) (.cse60 (+ ~local~0 2)) (.cse56 (not .cse39)) (.cse57 (not (= ~M_E~0 0))) (.cse16 (= ~m_st~0 2)) (.cse17 (not (= ~E_M~0 0))) (.cse58 (not .cse34)) (.cse11 (= ~t1_st~0 0)) (.cse18 (= 1 ~m_pc~0)) (.cse61 (+ ~local~0 1))) (let ((.cse27 (<= ~token~0 .cse61)) (.cse28 (<= .cse61 ~token~0)) (.cse2 (and .cse56 .cse57 .cse16 .cse17 .cse58 .cse11 .cse18)) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse7 (= ~m_st~0 0)) (.cse29 (<= .cse60 ~token~0)) (.cse30 (<= ~token~0 .cse60)) (.cse1 (<= 2 ~t2_st~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse21 (<= 2 ~E_2~0)) (.cse55 (<= 1 |old(~t1_pc~0)|)) (.cse19 (<= 2 ~t1_st~0)) (.cse4 (<= 2 ~E_1~0)) (.cse22 (and .cse56 .cse57 .cse16 .cse17 .cse58 .cse18 (not (= ~E_1~0 0)) .cse59)) (.cse5 (not (= ~E_M~0 1)))) (let ((.cse23 (<= ~t2_pc~0 0)) (.cse46 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (and (= ~m_st~0 |old(~m_st~0)|) .cse56 .cse57 .cse16 .cse17 .cse58 .cse18 .cse59)) (.cse38 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (<= |old(~E_2~0)| ~E_2~0)) (.cse35 (not (= 2 |old(~m_st~0)|))) (.cse33 (< |old(~E_1~0)| 2)) (.cse53 (< |old(~t2_st~0)| 2)) (.cse36 (not (= |old(~t1_pc~0)| 1))) (.cse40 (= 0 ~M_E~0)) (.cse41 (= 1 |old(~E_M~0)|)) (.cse47 (not (= 1 |old(~t2_pc~0)|))) (.cse42 (< |old(~t1_st~0)| 2)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse49 (and .cse1 .cse20 .cse3 .cse21 .cse55 .cse19 .cse4 .cse22 .cse5)) (.cse43 (not (= 1 |old(~m_pc~0)|))) (.cse50 (and .cse20 .cse3 .cse56 .cse7 .cse57 .cse17 .cse19 .cse1 .cse58 .cse21 .cse55 .cse18 .cse29 .cse4 .cse5 .cse30)) (.cse44 (< |old(~E_2~0)| 2)) (.cse45 (= 0 |old(~E_M~0)|)) (.cse51 (and (and .cse55 (and .cse1 (and .cse20 .cse2 .cse3 .cse21 .cse4) .cse5)) .cse24 .cse25)) (.cse52 (and .cse20 .cse27 .cse3 .cse21 .cse28 .cse55 .cse19 .cse4 .cse22 .cse5))) (and (let ((.cse8 (= ~m_pc~0 0)) (.cse13 (= ~token~0 0)) (.cse14 (= ~local~0 0))) (let ((.cse15 (= ~t1_pc~0 0)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~t2_pc~0 0)) (.cse12 (= ~t2_st~0 0)) (.cse0 (<= ~t1_pc~0 0)) (.cse26 (let ((.cse32 (= eval_~tmp~0 1))) (or (and .cse7 .cse8 .cse13 .cse14 .cse32) (and (= ~m_pc~0 1) .cse16 .cse32))))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) (and (and (= ~E_M~0 2) .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~E_2~0 2) .cse15) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and (and .cse16 .cse17 .cse9 .cse10 .cse11 .cse12 .cse18 .cse15) .cse5 .cse6) (and .cse19 (and .cse20 .cse21 .cse22 .cse23 .cse4 .cse5)) (and .cse24 (and .cse1 (and .cse2 .cse20 .cse3 .cse21 .cse4) .cse5) .cse25) (not (= ~m_i~0 1)) (and .cse17 .cse9 .cse5 (and .cse10 .cse12 (= ~t1_pc~0 1) (= ~t1_st~0 2)) .cse26 .cse6) (not (= 2 ~M_E~0)) (and .cse3 .cse0 .cse17 .cse1 .cse11 .cse26 .cse4 .cse5 .cse6) (and .cse24 (and (and .cse2 .cse20 .cse21 .cse23 .cse4) .cse5) .cse25) (not (= 1 ~t1_i~0)) (and .cse20 .cse3 .cse17 .cse19 .cse1 .cse26 .cse4 .cse5 .cse6) (and .cse20 .cse27 .cse3 .cse21 .cse28 .cse22 .cse19 .cse4 .cse5) (not (= ~T2_E~0 2)) (and .cse20 .cse3 .cse7 .cse17 .cse19 .cse1 .cse21 .cse18 .cse29 .cse4 .cse5 .cse30) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse31 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and .cse1 .cse20 .cse3 .cse21 .cse22 .cse19 .cse4 .cse5) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0))))) (or .cse33 .cse34 (< 0 |old(~t2_pc~0)|) .cse35 .cse36 (and .cse1 .cse20 .cse3 .cse37 .cse4 .cse38 .cse5 .cse6) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 (and .cse20 .cse46 .cse37 .cse23 .cse4 .cse38 .cse5 .cse6)) (let ((.cse48 (+ |old(~local~0)| 1))) (or .cse33 .cse34 .cse35 .cse36 .cse39 .cse40 .cse41 .cse47 .cse42 (< |old(~token~0)| .cse48) .cse49 .cse43 .cse44 .cse50 (< .cse48 |old(~token~0)|) .cse45 .cse51 .cse52)) (or .cse33 .cse34 .cse53 (and .cse20 .cse3 .cse46 .cse37 .cse4 .cse38 .cse5 .cse6) .cse35 .cse36 .cse39 .cse40 .cse41 .cse47 .cse42 .cse43 .cse44 .cse45) (let ((.cse54 (+ |old(~local~0)| 2))) (or .cse33 .cse34 .cse53 (< .cse54 |old(~token~0)|) .cse36 .cse39 .cse40 .cse41 .cse47 .cse42 .cse31 .cse49 .cse43 .cse50 .cse44 .cse45 .cse51 .cse52 (< |old(~token~0)| .cse54)))))))) [2018-12-09 09:15:09,761 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-12-09 09:15:09,763 INFO L448 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-12-09 09:15:09,763 INFO L444 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse34 (= ~T1_E~0 0)) (.cse39 (= ~T2_E~0 0))) (let ((.cse59 (not (= ~E_2~0 0))) (.cse60 (+ ~local~0 2)) (.cse56 (not .cse39)) (.cse57 (not (= ~M_E~0 0))) (.cse16 (= ~m_st~0 2)) (.cse17 (not (= ~E_M~0 0))) (.cse58 (not .cse34)) (.cse11 (= ~t1_st~0 0)) (.cse18 (= 1 ~m_pc~0)) (.cse61 (+ ~local~0 1))) (let ((.cse27 (<= ~token~0 .cse61)) (.cse28 (<= .cse61 ~token~0)) (.cse2 (and .cse56 .cse57 .cse16 .cse17 .cse58 .cse11 .cse18)) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse7 (= ~m_st~0 0)) (.cse29 (<= .cse60 ~token~0)) (.cse30 (<= ~token~0 .cse60)) (.cse1 (<= 2 ~t2_st~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse21 (<= 2 ~E_2~0)) (.cse55 (<= 1 |old(~t1_pc~0)|)) (.cse19 (<= 2 ~t1_st~0)) (.cse4 (<= 2 ~E_1~0)) (.cse22 (and .cse56 .cse57 .cse16 .cse17 .cse58 .cse18 (not (= ~E_1~0 0)) .cse59)) (.cse5 (not (= ~E_M~0 1)))) (let ((.cse23 (<= ~t2_pc~0 0)) (.cse46 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (and (= ~m_st~0 |old(~m_st~0)|) .cse56 .cse57 .cse16 .cse17 .cse58 .cse18 .cse59)) (.cse38 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (<= |old(~E_2~0)| ~E_2~0)) (.cse35 (not (= 2 |old(~m_st~0)|))) (.cse33 (< |old(~E_1~0)| 2)) (.cse53 (< |old(~t2_st~0)| 2)) (.cse36 (not (= |old(~t1_pc~0)| 1))) (.cse40 (= 0 ~M_E~0)) (.cse41 (= 1 |old(~E_M~0)|)) (.cse47 (not (= 1 |old(~t2_pc~0)|))) (.cse42 (< |old(~t1_st~0)| 2)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse49 (and .cse1 .cse20 .cse3 .cse21 .cse55 .cse19 .cse4 .cse22 .cse5)) (.cse43 (not (= 1 |old(~m_pc~0)|))) (.cse50 (and .cse20 .cse3 .cse56 .cse7 .cse57 .cse17 .cse19 .cse1 .cse58 .cse21 .cse55 .cse18 .cse29 .cse4 .cse5 .cse30)) (.cse44 (< |old(~E_2~0)| 2)) (.cse45 (= 0 |old(~E_M~0)|)) (.cse51 (and (and .cse55 (and .cse1 (and .cse20 .cse2 .cse3 .cse21 .cse4) .cse5)) .cse24 .cse25)) (.cse52 (and .cse20 .cse27 .cse3 .cse21 .cse28 .cse55 .cse19 .cse4 .cse22 .cse5))) (and (let ((.cse8 (= ~m_pc~0 0)) (.cse13 (= ~token~0 0)) (.cse14 (= ~local~0 0))) (let ((.cse15 (= ~t1_pc~0 0)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~t2_pc~0 0)) (.cse12 (= ~t2_st~0 0)) (.cse0 (<= ~t1_pc~0 0)) (.cse26 (let ((.cse32 (= eval_~tmp~0 1))) (or (and .cse7 .cse8 .cse13 .cse14 .cse32) (and (= ~m_pc~0 1) .cse16 .cse32))))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) (and (and (= ~E_M~0 2) .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~E_2~0 2) .cse15) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and (and .cse16 .cse17 .cse9 .cse10 .cse11 .cse12 .cse18 .cse15) .cse5 .cse6) (and .cse19 (and .cse20 .cse21 .cse22 .cse23 .cse4 .cse5)) (and .cse24 (and .cse1 (and .cse2 .cse20 .cse3 .cse21 .cse4) .cse5) .cse25) (not (= ~m_i~0 1)) (and .cse17 .cse9 .cse5 (and .cse10 .cse12 (= ~t1_pc~0 1) (= ~t1_st~0 2)) .cse26 .cse6) (not (= 2 ~M_E~0)) (and .cse3 .cse0 .cse17 .cse1 .cse11 .cse26 .cse4 .cse5 .cse6) (and .cse24 (and (and .cse2 .cse20 .cse21 .cse23 .cse4) .cse5) .cse25) (not (= 1 ~t1_i~0)) (and .cse20 .cse3 .cse17 .cse19 .cse1 .cse26 .cse4 .cse5 .cse6) (and .cse20 .cse27 .cse3 .cse21 .cse28 .cse22 .cse19 .cse4 .cse5) (not (= ~T2_E~0 2)) (and .cse20 .cse3 .cse7 .cse17 .cse19 .cse1 .cse21 .cse18 .cse29 .cse4 .cse5 .cse30) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse31 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and .cse1 .cse20 .cse3 .cse21 .cse22 .cse19 .cse4 .cse5) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0))))) (or .cse33 .cse34 (< 0 |old(~t2_pc~0)|) .cse35 .cse36 (and .cse1 .cse20 .cse3 .cse37 .cse4 .cse38 .cse5 .cse6) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 (and .cse20 .cse46 .cse37 .cse23 .cse4 .cse38 .cse5 .cse6)) (let ((.cse48 (+ |old(~local~0)| 1))) (or .cse33 .cse34 .cse35 .cse36 .cse39 .cse40 .cse41 .cse47 .cse42 (< |old(~token~0)| .cse48) .cse49 .cse43 .cse44 .cse50 (< .cse48 |old(~token~0)|) .cse45 .cse51 .cse52)) (or .cse33 .cse34 .cse53 (and .cse20 .cse3 .cse46 .cse37 .cse4 .cse38 .cse5 .cse6) .cse35 .cse36 .cse39 .cse40 .cse41 .cse47 .cse42 .cse43 .cse44 .cse45) (let ((.cse54 (+ |old(~local~0)| 2))) (or .cse33 .cse34 .cse53 (< .cse54 |old(~token~0)|) .cse36 .cse39 .cse40 .cse41 .cse47 .cse42 .cse31 .cse49 .cse43 .cse50 .cse44 .cse45 .cse51 .cse52 (< |old(~token~0)| .cse54)))))))) [2018-12-09 09:15:09,765 INFO L444 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse5 (= ~T2_E~0 0)) (.cse35 (= ~m_st~0 2)) (.cse16 (not (= ~E_M~0 0))) (.cse1 (= ~T1_E~0 0)) (.cse29 (= 1 ~m_pc~0))) (let ((.cse25 (<= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0)) (.cse22 (= 1 ~t1_pc~0)) (.cse14 (= 1 ~t2_pc~0)) (.cse23 (<= 2 ~E_2~0)) (.cse19 (<= 2 ~E_1~0)) (.cse24 (and (not .cse5) (not (= ~M_E~0 0)) .cse35 .cse16 (not .cse1) .cse29 (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse20 (not (= ~E_M~0 1))) (.cse26 (<= ~local~0 ~token~0))) (let ((.cse39 (< |old(~t2_st~0)| 2)) (.cse4 (and .cse25 (and .cse17 (<= 1 |old(~t1_pc~0)|) (and .cse22 .cse14 .cse23 .cse19 .cse24) .cse20) .cse26)) (.cse8 (not (= 1 |old(~t2_pc~0)|))) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse11 (not (= 1 |old(~m_pc~0)|))) (.cse12 (< |old(~E_2~0)| 2)) (.cse13 (= 0 |old(~E_M~0)|))) (and (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse10) .cse11 .cse12 (< .cse10 |old(~token~0)|) .cse13)) (let ((.cse31 (= ~m_st~0 0)) (.cse32 (= ~m_pc~0 0)) (.cse34 (= ~m_pc~0 1))) (let ((.cse15 (<= ~t1_pc~0 0)) (.cse21 (<= |old(~E_2~0)| ~E_2~0)) (.cse28 (let ((.cse36 (= ~t2_pc~0 0)) (.cse37 (= ~t2_st~0 0)) (.cse38 (= ~t1_pc~0 0))) (or (and .cse36 .cse37 .cse31 .cse32 .cse38) (and .cse34 .cse36 .cse37 .cse35 .cse38)))) (.cse27 (= ~E_1~0 2)) (.cse18 (let ((.cse33 (= eval_~tmp~0 1))) (or (and .cse31 .cse32 (= ~token~0 0) (= ~local~0 0) .cse33) (and .cse34 .cse35 .cse33))))) (or (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (not (= 2 |old(~E_2~0)|)) (and (and .cse22 .cse23 .cse24 (<= ~t2_pc~0 0) .cse19) .cse20) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (and .cse17 .cse14 .cse15 .cse24 .cse19 .cse20 .cse21) (not (= 2 |old(~E_M~0)|)) (and .cse17 .cse25 (and .cse22 .cse14 .cse23 .cse24 .cse19) .cse26 .cse20) (and (and .cse16 .cse27 .cse28 .cse29) .cse20 .cse21) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse30 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (and .cse28 .cse27 (= ~E_M~0 2) (= ~E_2~0 2) .cse18) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))))) (or .cse0 .cse1 .cse39 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (let ((.cse40 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse39 (< .cse40 |old(~token~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse13 (< |old(~token~0)| .cse40))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13))))) [2018-12-09 09:15:09,766 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse2 (not (= 2 |old(~m_st~0)|))) (.cse10 (= ~m_st~0 2)) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse24 (< |old(~t2_st~0)| 2)) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse22 (not (= 1 |old(~t2_pc~0)|))) (.cse15 (< |old(~t1_st~0)| 2)) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse16 (not (= 1 |old(~m_pc~0)|))) (.cse6 (= 1 ~t1_pc~0)) (.cse7 (= |old(~E_1~0)| ~E_1~0)) (.cse8 (= |old(~E_M~0)| ~E_M~0)) (.cse20 (= 1 ~t2_pc~0)) (.cse25 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse21 (= ~token~0 |old(~token~0)|)) (.cse11 (= |old(~E_2~0)| ~E_2~0)) (.cse12 (= 1 ~m_pc~0)) (.cse13 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (< |old(~E_2~0)| 2)) (.cse18 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 (<= ~t2_pc~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse19 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse19) .cse7 .cse8 .cse20 .cse9 .cse21 .cse10 .cse11 (<= .cse19 ~token~0) .cse12 .cse13)) .cse14 .cse22 .cse15 (< |old(~token~0)| .cse23) .cse16 .cse17 (< .cse23 |old(~token~0)|) .cse18)) (or .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse14 .cse22 .cse15 .cse16 .cse17 (and .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13) .cse18) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and (= ~m_pc~0 0) (= ~E_1~0 2) .cse25 (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse26 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))) (let ((.cse27 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse24 (< .cse27 |old(~token~0)|) .cse3 .cse4 .cse5 .cse14 .cse22 .cse15 .cse26 .cse16 (let ((.cse28 (+ ~local~0 2))) (and .cse6 .cse7 .cse8 (<= ~token~0 .cse28) .cse20 .cse25 .cse9 .cse21 .cse11 .cse12 (<= .cse28 ~token~0) .cse13)) .cse17 .cse18 (< |old(~token~0)| .cse27))))) [2018-12-09 09:15:09,767 INFO L448 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-12-09 09:15:09,767 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-12-09 09:15:09,768 INFO L444 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse5 (= ~T2_E~0 0)) (.cse14 (= ~m_st~0 2)) (.cse15 (not (= ~E_M~0 0))) (.cse1 (= ~T1_E~0 0)) (.cse16 (= 1 ~m_pc~0)) (.cse37 (+ ~local~0 1))) (let ((.cse13 (= 1 ~t1_pc~0)) (.cse22 (<= ~token~0 .cse37)) (.cse23 (= 1 ~t2_pc~0)) (.cse24 (<= 2 ~E_2~0)) (.cse25 (<= .cse37 ~token~0)) (.cse27 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~E_1~0)) (.cse26 (and (not .cse5) (not (= ~M_E~0 0)) .cse14 .cse15 (not .cse1) .cse16 (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse19 (not (= ~E_M~0 1)))) (let ((.cse17 (<= ~t2_pc~0 0)) (.cse20 (<= |old(~E_2~0)| ~E_2~0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (not (= 1 |old(~t2_pc~0)|))) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (not (= 1 |old(~m_pc~0)|))) (.cse11 (< |old(~E_2~0)| 2)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse35 (and .cse13 .cse22 .cse23 .cse24 .cse25 (<= 1 |old(~t1_pc~0)|) .cse27 .cse18 .cse26 .cse19))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 (and .cse13 (and .cse14 .cse15 .cse16) .cse17 .cse18 (<= |old(~t1_st~0)| ~t1_st~0) .cse19 .cse20)) (let ((.cse21 (= ~t1_st~0 0)) (.cse30 (= ~t1_pc~0 0)) (.cse28 (= ~E_1~0 2)) (.cse29 (= ~t2_pc~0 0)) (.cse32 (let ((.cse33 (= eval_~tmp~0 1))) (or (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse33) (and (= ~m_pc~0 1) .cse14 .cse33))))) (or (and (and (and .cse14 .cse15 .cse21 .cse16) .cse13 .cse17 .cse18 .cse20) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse19) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and .cse13 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse18 .cse19) (and .cse13 .cse24 .cse26 .cse27 .cse17 .cse18 .cse19) (not (= ~T2_E~0 2)) (and (and .cse28 .cse29 (and .cse16 .cse15) .cse21 .cse14 .cse30) .cse19 .cse20) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse31 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (and .cse28 (= ~E_M~0 2) .cse29 .cse21 (= ~E_2~0 2) .cse30 .cse32) (not (= 2 |old(~E_1~0)|)) (and (= ~t1_pc~0 1) .cse15 .cse27 .cse28 .cse19 .cse29 .cse32 .cse20) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0)))) (let ((.cse34 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse34 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse10 .cse11 .cse12 .cse35 (< |old(~token~0)| .cse34))) (let ((.cse36 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse36) .cse10 .cse11 (< .cse36 |old(~token~0)|) .cse12 .cse35)))))) [2018-12-09 09:15:09,770 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-12-09 09:15:09,771 INFO L448 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-12-09 09:15:09,771 INFO L444 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse42 (+ ~local~0 1)) (.cse43 (+ ~local~0 2))) (let ((.cse29 (= ~m_st~0 0)) (.cse30 (<= .cse43 ~token~0)) (.cse31 (<= ~token~0 .cse43)) (.cse39 (not (= ~M_E~0 0))) (.cse24 (<= 2 ~t2_st~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse27 (<= ~token~0 .cse42)) (.cse17 (= 1 ~t2_pc~0)) (.cse38 (not .cse5)) (.cse19 (= ~m_st~0 2)) (.cse14 (not (= ~E_M~0 0))) (.cse23 (<= 2 ~t1_st~0)) (.cse40 (not .cse1)) (.cse25 (<= 2 ~E_2~0)) (.cse28 (<= .cse42 ~token~0)) (.cse41 (<= 1 |old(~t1_pc~0)|)) (.cse20 (= 1 ~m_pc~0)) (.cse15 (<= 2 ~E_1~0)) (.cse16 (not (= ~E_M~0 1)))) (let ((.cse2 (< |old(~t2_st~0)| 2)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse34 (and .cse13 .cse27 .cse17 .cse38 .cse19 .cse14 .cse23 .cse40 .cse25 .cse28 .cse41 .cse20 .cse15 .cse16)) (.cse8 (not (= 1 |old(~t2_pc~0)|))) (.cse35 (and .cse13 .cse17 .cse38 .cse39 .cse19 .cse14 .cse23 .cse24 .cse40 .cse25 .cse41 .cse20 .cse15 .cse16)) (.cse36 (and .cse13 .cse17 .cse38 .cse29 .cse39 .cse14 .cse23 .cse24 .cse40 .cse25 .cse41 .cse20 .cse30 .cse15 .cse16 .cse31)) (.cse0 (< |old(~E_1~0)| 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (= 0 ~M_E~0)) (.cse18 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse26 (<= ~t2_pc~0 0)) (.cse21 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (<= |old(~E_2~0)| ~E_2~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (not (= 1 |old(~m_pc~0)|))) (.cse11 (< |old(~E_2~0)| 2)) (.cse12 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse13 .cse17 .cse19 .cse14 .cse23 .cse24 .cse25 .cse20 .cse15 .cse16) (not (= 1 ~t1_i~0)) (and .cse13 .cse19 .cse14 .cse23 .cse26 .cse25 .cse20 .cse15 .cse16) (and .cse13 .cse27 .cse17 .cse19 .cse14 .cse23 .cse25 .cse28 .cse20 .cse15 .cse16) (not (= ~T2_E~0 2)) (and .cse13 .cse17 .cse29 .cse14 .cse23 .cse24 .cse25 .cse20 .cse30 .cse15 .cse16 .cse31) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse32 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))) (let ((.cse33 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse33 |old(~token~0)|) .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse10 .cse35 .cse36 .cse11 .cse12 (< |old(~token~0)| .cse33))) (let ((.cse37 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse37) .cse10 .cse11 .cse35 .cse36 (< .cse37 |old(~token~0)|) .cse12)) (or (and .cse13 .cse17 .cse19 .cse14 .cse24 .cse20 .cse15 .cse21 .cse16 .cse22) .cse0 .cse1 (< 0 |old(~t2_pc~0)|) .cse3 .cse4 .cse5 .cse6 (and .cse13 .cse18 .cse19 .cse14 .cse26 .cse20 .cse15 .cse21 .cse16 .cse22) .cse7 .cse9 .cse10 .cse11 .cse12))))) [2018-12-09 09:15:09,773 INFO L448 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-12-09 09:15:09,773 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-12-09 09:15:09,774 INFO L444 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse7 (= 1 ~E_M~0)) (.cse16 (= 0 ~m_st~0)) (.cse30 (+ ~local~0 2))) (let ((.cse12 (not (= ~t1_pc~0 0))) (.cse18 (not (= 0 ~m_pc~0))) (.cse14 (not (= 0 ~t2_st~0))) (.cse17 (not (= 0 ~t2_pc~0))) (.cse19 (< ~t2_st~0 2)) (.cse2 (< 0 ~t2_pc~0)) (.cse24 (< ~local~0 ~token~0)) (.cse25 (< ~token~0 ~local~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse13 (not (= 1 ~E_1~0))) (.cse26 (< .cse30 ~token~0)) (.cse23 (not .cse16)) (.cse27 (< ~token~0 .cse30)) (.cse28 (not .cse7)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse3 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse20 (not (= 1 ~t2_pc~0))) (.cse21 (< ~t1_st~0 2)) (.cse8 (not .cse22)) (.cse15 (< ~E_2~0 2)) (.cse10 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse9 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~E_2~0) .cse10) (or .cse1 .cse10 .cse5 .cse6 .cse11 .cse7 .cse12 .cse13 .cse14 .cse15 .cse9 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse10 .cse5 .cse6 .cse20 .cse21 .cse8 .cse15 .cse9) (or .cse1 .cse19 .cse5 .cse6 .cse11 .cse7 .cse20 .cse13 .cse15 .cse9 .cse16 .cse10 (< 0 ~t1_pc~0) .cse22) (or .cse10 (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse12 .cse23 (not (= 0 ~local~0)) .cse18 .cse11) (not (= ~m_i~0 1)) .cse14 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse17 (not (= 2 ~M_E~0))) (or .cse7 .cse13 .cse10 .cse19 .cse24 .cse4 .cse25 .cse15 (or .cse20 .cse1 .cse8 .cse9 .cse5 .cse6 .cse11)) (or .cse1 .cse19 .cse24 .cse4 .cse25 .cse10 .cse5 .cse6 .cse11 .cse7 .cse20 .cse13 .cse15 .cse9 .cse16) (or .cse0 .cse1 .cse19 .cse10 .cse26 .cse4 .cse5 .cse6 .cse20 .cse21 .cse23 .cse8 .cse15 .cse9 .cse27) (or .cse1 .cse2 .cse10 .cse24 .cse4 .cse25 .cse5 .cse6 .cse11 .cse7 .cse13 .cse15 .cse9 .cse16 .cse22) (or .cse0 .cse28 .cse1 .cse10 .cse26 .cse4 .cse5 .cse6 .cse20 .cse21 .cse23 .cse8 .cse15 .cse27) (or .cse0 .cse28 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse8 .cse15) (let ((.cse29 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 (< ~token~0 .cse29) .cse8 .cse15 .cse10 (< .cse29 ~token~0) .cse9))))) [2018-12-09 09:15:09,778 INFO L451 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-12-09 09:15:09,778 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-12-09 09:15:09,778 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-12-09 09:15:09,778 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-12-09 09:15:09,779 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse16 (= |old(~T1_E~0)| ~T1_E~0)) (.cse17 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse2 (< ~t2_st~0 2)) (.cse15 (not (= 0 ~m_st~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse3 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse12 (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) .cse16 .cse17)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< ~t1_st~0 2)) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< |old(~E_2~0)| 2)) (.cse13 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse14 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse12 .cse11 .cse13 (< ~token~0 .cse14))) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse9 .cse10 .cse11 .cse13) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~E_1~0 2) (= ~E_M~0 2) (= ~T2_E~0 2) .cse16 (= ~E_2~0 2) .cse17) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse15 (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= ~t1_st~0 0))) (not (= ~m_i~0 1)) (not (= 0 ~t2_st~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 |old(~M_E~0)|))) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 (< ~token~0 .cse18) .cse10 .cse11 (< .cse18 ~token~0) .cse13))))) [2018-12-09 09:15:09,783 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-12-09 09:15:09,783 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-12-09 09:15:09,784 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-12-09 09:15:09,784 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-12-09 09:15:09,784 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-12-09 09:15:09,784 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-12-09 09:15:09,784 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-12-09 09:15:09,784 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~T1_E~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,787 INFO L444 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,787 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-12-09 09:15:09,787 INFO L444 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,787 INFO L444 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse11 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (let ((.cse2 (and .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse4 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~t1_st~0)) (.cse3 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) (<= .cse0 ~token~0) .cse1 .cse2 .cse3)) (not (= |old(~T1_E~0)| 2)) (and .cse4 .cse1 .cse2 .cse3) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse6 .cse7 .cse8 (<= ~t2_pc~0 0) .cse9 .cse10) .cse1 .cse3) (not (= |old(~T2_E~0)| 2)) (let ((.cse12 (+ ~local~0 2))) (and .cse4 (and .cse5 .cse11 .cse6 (and (= ~m_st~0 0) .cse7 .cse10) .cse9) .cse1 (<= .cse12 ~token~0) .cse3 (<= ~token~0 .cse12))) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,789 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-12-09 09:15:09,789 INFO L444 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,789 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-09 09:15:09,790 INFO L444 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,790 INFO L444 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= ~M_E~0 0)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,791 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,791 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-09 09:15:09,791 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-12-09 09:15:09,791 INFO L448 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-12-09 09:15:09,791 INFO L444 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,791 INFO L444 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,792 INFO L444 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-09 09:15:09,793 INFO L444 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,793 INFO L444 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse11 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (let ((.cse2 (and .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse4 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~t1_st~0)) (.cse3 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) (<= .cse0 ~token~0) .cse1 .cse2 .cse3)) (not (= |old(~T1_E~0)| 2)) (and .cse4 .cse1 .cse2 .cse3) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse6 .cse7 .cse8 (<= ~t2_pc~0 0) .cse9 .cse10) .cse1 .cse3) (not (= |old(~T2_E~0)| 2)) (let ((.cse12 (+ ~local~0 2))) (and .cse4 (and .cse5 .cse11 .cse6 (and (= ~m_st~0 0) .cse7 .cse10) .cse9) .cse1 (<= .cse12 ~token~0) .cse3 (<= ~token~0 .cse12))) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,795 INFO L444 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,795 INFO L444 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,796 INFO L444 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,799 INFO L444 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,799 INFO L448 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-12-09 09:15:09,799 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (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_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse8 (<= 2 ~E_1~0))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse10 (and .cse3 .cse4 .cse7 .cse5 .cse6 .cse12 .cse8)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 1)))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8) .cse9 (<= ~token~0 .cse2))) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) (<= .cse11 ~token~0) .cse1 .cse9)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~T1_E~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (and .cse1 (and .cse3 .cse7 .cse5 .cse6 .cse12 (<= ~t2_pc~0 0) .cse8) .cse9) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse0 .cse10 .cse1 .cse9) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-09 09:15:09,801 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-12-09 09:15:09,801 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-12-09 09:15:09,802 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-12-09 09:15:09,802 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-12-09 09:15:09,802 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-12-09 09:15:09,802 INFO L448 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-12-09 09:15:09,802 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-12-09 09:15:09,802 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-12-09 09:15:09,802 INFO L444 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse20 (= 0 ~m_st~0)) (.cse31 (+ ~local~0 1))) (let ((.cse15 (< ~local~0 ~token~0)) (.cse16 (< ~token~0 ~local~0)) (.cse29 (= is_master_triggered_~__retres1~0 0)) (.cse26 (not (= ~t1_st~0 0))) (.cse23 (not (= ~t1_pc~0 0))) (.cse18 (not (= 1 ~E_1~0))) (.cse27 (not (= 0 ~t2_st~0))) (.cse28 (not (= 0 ~t2_pc~0))) (.cse25 (not (= 0 ~m_pc~0))) (.cse10 (< ~token~0 .cse31)) (.cse12 (< .cse31 ~token~0)) (.cse24 (not .cse20)) (.cse21 (< 0 ~t2_pc~0)) (.cse14 (= 0 ~E_2~0)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< ~t2_st~0 2)) (.cse3 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse17 (< ~t1_st~0 2)) (.cse5 (= 0 is_master_triggered_~__retres1~0)) (.cse11 (not .cse22)) (.cse19 (< ~E_2~0 2)) (.cse13 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse15 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse5 .cse17 .cse18 .cse19 .cse13 .cse20) (or .cse1 .cse21 .cse15 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse17 .cse18 .cse19 .cse13 .cse20 .cse22) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse23 .cse24 (not (= 0 ~local~0)) .cse25 .cse26) (not (= ~m_i~0 1)) .cse27 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse28 (not (= 2 ~M_E~0)) .cse29) (or .cse1 .cse2 .cse6 .cse7 .cse26 .cse8 .cse9 .cse18 .cse5 .cse19 .cse13 .cse20 (< 0 ~t1_pc~0) .cse22) (or .cse15 .cse16 (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse26 .cse8 .cse9 .cse18 .cse11 .cse19 .cse13 .cse20) .cse5) (or .cse1 .cse29 .cse6 .cse7 .cse26 .cse8 .cse23 .cse18 .cse27 .cse19 .cse13 .cse20 .cse28 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse5 .cse11 .cse19 .cse12 .cse13) (let ((.cse30 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse30 ~token~0) .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse17 .cse24 .cse11 .cse19 .cse13 (< ~token~0 .cse30))) (or .cse0 .cse1 .cse21 .cse3 .cse4 .cse6 .cse7 .cse5 .cse8 .cse11 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse17 .cse5 .cse11 .cse19 .cse13)))) [2018-12-09 09:15:09,803 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-12-09 09:15:09,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 09:15:09,803 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~T1_E~0 2) (= ~E_M~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~M_E~0 2) (= ~E_1~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) [2018-12-09 09:15:09,804 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse2 (< ~t2_st~0 2)) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse3 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse12 (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))) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< ~t1_st~0 2)) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< |old(~E_2~0)| 2)) (.cse13 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse14 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 ~m_st~0)) .cse10 .cse12 .cse11 .cse13 (< ~token~0 .cse14))) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse9 .cse10 .cse11 .cse13) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 (< ~token~0 .cse15) .cse10 .cse11 (< .cse15 ~token~0) .cse13)))) [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-12-09 09:15:09,804 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-12-09 09:15:09,805 INFO L451 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: true [2018-12-09 09:15:09,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:15:09 BoogieIcfgContainer [2018-12-09 09:15:09,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:15:09,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:15:09,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:15:09,844 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:15:09,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:13:19" (3/4) ... [2018-12-09 09:15:09,847 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-12-09 09:15:09,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-09 09:15:09,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-09 09:15:09,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-09 09:15:09,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-12-09 09:15:09,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-12-09 09:15:09,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-09 09:15:09,856 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-09 09:15:09,856 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 09:15:09,874 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 == \old(E_2)) || !(\old(T1_E) == 2)) || (((((2 <= t2_st && 2 <= t1_st) && local + 2 <= token) && (((1 == t1_pc && 1 == t2_pc) && (m_st == 0 && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || ((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && token <= local + 1) && local + 1 <= token) && 2 <= t1_st) && !(E_M == 1))) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || (((((((((((((m_pc == 0 && E_1 == 2) && T1_E == 2) && m_st == \old(m_st)) && E_M == 2) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || ((2 <= t1_st && (((((1 == t1_pc && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1))) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || (((2 <= t2_st && (((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && 2 <= t1_st) && !(E_M == 1))) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) [2018-12-09 09:15:09,874 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(2 == \old(E_2)) || !(M_E == 0)) || !(\old(T1_E) == 2)) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) [2018-12-09 09:15:09,874 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((t1_pc <= 0 && ((((2 <= t2_st && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) || ((((((((((E_M == 2 && m_st == 0) && m_pc == 0) && E_1 == 2) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(2 == \old(E_2))) || !(T1_E == 2)) || (((((((((m_st == 2 && !(E_M == 0)) && E_1 == 2) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && 1 == m_pc) && t1_pc == 0) && !(E_M == 1)) && \old(E_2) <= E_2)) || (2 <= t1_st && ((((1 == t1_pc && 2 <= E_2) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1))) || ((token <= local && (2 <= t2_st && (((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && local <= token)) || !(m_i == 1)) || (((((!(E_M == 0) && E_1 == 2) && !(E_M == 1)) && ((t2_pc == 0 && t2_st == 0) && t1_pc == 1) && t1_st == 2) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || !(2 == M_E)) || ((((((((1 == t2_pc && t1_pc <= 0) && !(E_M == 0)) && 2 <= t2_st) && t1_st == 0) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((token <= local && ((((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t1_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1)) && local <= token)) || !(1 == t1_i)) || ((((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || (((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || !(2 == \old(E_1))) || !(1 == t2_i)) && (((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && ((((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_2 == 0)) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || (((((((1 == t1_pc && \old(t2_st) <= t2_st) && ((((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_2 == 0)) && t2_pc <= 0) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || ((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 1 <= \old(t1_pc)) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || (((1 <= \old(t1_pc) && (2 <= t2_st && (((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || (((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 1 <= \old(t1_pc)) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && ((((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_2 == 0)) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || ((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 1 <= \old(t1_pc)) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || !(1 == \old(m_pc))) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(E_2) < 2) || 0 == \old(E_M)) || (((1 <= \old(t1_pc) && (2 <= t2_st && (((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || (((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 1 <= \old(t1_pc)) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(token) < \old(local) + 2) [2018-12-09 09:15:09,875 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || (((((((((1 == t1_pc && !(E_M == 0)) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 1 == m_pc) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) && (((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(1 == t1_i)) || ((((((((1 == t1_pc && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || ((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || (((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 <= \old(t1_pc)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || (((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 <= \old(t1_pc)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || !(1 == \old(m_pc))) || \old(E_2) < 2) || (((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t2_st) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2) || \old(E_1) < 2) || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || (((((((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && !(E_M == 0)) && t2_pc <= 0) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) [2018-12-09 09:15:09,875 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || (((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local) && (((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(E_M == 0)) && !(m_st == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_2 == 0)) && \old(t1_st) <= t1_st) && local <= token)) || !(0 == \old(m_pc))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && t1_st == 0) && m_st == \old(m_st)) && \old(t2_st) <= t2_st)) || 0 < t1_pc) || !(0 == \old(m_pc)))) && (((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || ((((((m_pc == 0 && E_1 == 2) && m_st == \old(m_st)) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0))) || (((token == \old(token) && local + 2 <= token) && ((((((\old(E_1) == E_1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && 1 == m_pc) && \old(t1_st) <= t1_st) || (((((\old(E_1) == E_1 && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && 1 == m_pc) && \old(t1_st) <= t1_st))) && token <= local + 2)) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2)) && ((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || (((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local) && (((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(E_M == 0)) && !(m_st == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_2 == 0)) && \old(t1_st) <= t1_st) && local <= token)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) [2018-12-09 09:15:09,875 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || ((((((token <= local && 2 <= E_1) && \old(t2_st) <= t2_st) && m_st == 2) && t1_st == 0) && 1 == m_pc) && local <= token)) || E_2 < 2) || !(0 == \old(m_pc))) && ((((((((((\old(E_1) < 2 || (((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || \old(t2_st) < 2) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((\old(t2_st) <= t2_st && m_st == 2) && t1_st == 0) && 1 == m_pc) && 2 <= E_1)) || !(0 == \old(local))) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc) || !(0 == \old(m_pc)))) && ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token) || ((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)))) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2)) && (((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || ((((E_1 == 2 && m_st == 2) && t1_st == 0) && t2_st == 0) && 1 == m_pc)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E)) [2018-12-09 09:15:09,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) && ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc) || !(0 == \old(m_pc)))) && (((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0))) || (((token == \old(token) && local + 2 <= token) && ((((((\old(E_1) == E_1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && 1 == m_pc) && \old(t1_st) <= t1_st) || (((((\old(E_1) == E_1 && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && 1 == m_pc) && \old(t1_st) <= t1_st))) && token <= local + 2)) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2)) && ((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) [2018-12-09 09:15:09,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) || !(0 == m_pc)) || (((((t1_pc <= 0 && \old(t2_st) <= t2_st) && token == 0) && m_st == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || ((1 == t1_pc && (m_st == \old(m_st) && m_st == 2) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || (((((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_1) && 2 <= E_2) && token <= \old(token) + 1) && local + 1 <= token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || ((((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_1) && \old(t2_st) <= t2_st) && 2 <= E_2)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == E_M)) || (((((m_st == \old(m_st) && t2_st == 0) && token == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || ((((t1_pc <= 0 && (1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_1) && \old(t2_st) <= t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 0 < \old(t1_pc))) && ((((((((((((((t1_pc == 0 && \old(t1_st) <= t1_st) && m_st == \old(m_st) && t2_st == 0) && \old(E_2) <= E_2) || T1_E == 0) || T2_E == 0) || 0 == M_E) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc)) [2018-12-09 09:15:09,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((1 == t1_pc && m_st == 2) && 2 <= t1_st) && 2 <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || (((((1 == t1_pc && 2 <= t1_st) && m_st == \old(m_st)) && \old(t2_st) <= t2_st) && token == 0) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) || !(0 == m_pc))) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || (((((t1_pc == 1 && m_st == \old(m_st)) && t1_st == 2) && t2_st == 0) && token == 0) && \old(E_2) <= E_2)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || (((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && local + 1 <= token)) || 0 == E_M) || ((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t2_st) <= t2_st) && m_st == 2))) && (((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || ((((t1_pc == 1 && m_st == 2) && t1_st == 2) && t2_st == 0) && \old(E_2) <= E_2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc))) && ((((((((((((E_1 < 2 || T1_E == 0) || ((((1 == t1_pc && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) <= E_2)) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) [2018-12-09 09:15:09,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((1 == t1_pc && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) && ((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(\old(token) == 0) || !(0 == local)) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc))) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) || !(0 == m_pc))) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || \old(E_2) < 2) || ((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || 0 == E_M) [2018-12-09 09:15:09,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || ((((1 == t1_pc && (((((!(T2_E == 0) && m_st == \old(m_st)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && \old(t1_st) <= t1_st)) || E_2 < 2) || 0 == \old(E_M)) && ((((((((((((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(t1_pc == 0)) || !(1 == m_pc)) || (((((!(E_M == 0) && !(E_M == 1)) && \old(t2_st) <= t2_st) && m_st == 2) && t2_pc == 0) && t1_st == 0)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || ((((\old(t2_st) <= t2_st && token <= local) && (!(E_M == 0) && t1_st == 0) && m_st == 2) && local <= token) && !(E_M == 1))) || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((E_1 < 2 || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && local + 2 <= token) && \old(t1_st) <= t1_st)) || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || ((((1 == t1_pc && (((((!(T2_E == 0) && m_st == \old(m_st)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || (((\old(t2_st) <= t2_st && t2_pc <= 0) && (t1_st == 0 && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && m_st == 0 && token == 0) && !(E_M == 1))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || (((((\old(t2_st) <= t2_st && t2_pc <= 0) && m_st == 0 && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && token == 0) && \old(t1_st) <= t1_st) && !(E_M == 1))) || !(0 == m_pc)) [2018-12-09 09:15:09,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || (((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M)) && ((((((((((((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(t1_pc == 0)) || !(1 == m_pc)) || (((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && t2_st == 2) && t1_st == 0)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && t1_st == 0) && token == 0)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || (((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) [2018-12-09 09:15:09,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M)) && (((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && ((((((((1 == \old(E_M) || !(t1_pc == 0)) || ((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(1 == m_pc)) || !(2 == \old(m_st))) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc))) || !(\old(t1_st) == 0))) && ((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || (((((\old(E_M) == E_M && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc)) [2018-12-09 09:15:09,899 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_67888dcd-c8c9-4013-8990-7ab3a02a51e3/bin-2019/utaipan/witness.graphml [2018-12-09 09:15:09,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:15:09,900 INFO L168 Benchmark]: Toolchain (without parser) took 111135.61 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 953.3 MB in the beginning and 927.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-09 09:15:09,900 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:15:09,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.50 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 937.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:15:09,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:15:09,901 INFO L168 Benchmark]: Boogie Preprocessor took 20.84 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:15:09,901 INFO L168 Benchmark]: RCFGBuilder took 292.26 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: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:15:09,901 INFO L168 Benchmark]: TraceAbstraction took 110554.97 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 954.7 MB in the end (delta: 130.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-09 09:15:09,901 INFO L168 Benchmark]: Witness Printer took 55.16 ms. Allocated memory is still 2.2 GB. Free memory was 954.7 MB in the beginning and 927.7 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:15:09,902 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.50 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 937.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.84 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 292.26 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: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110554.97 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 954.7 MB in the end (delta: 130.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 55.16 ms. Allocated memory is still 2.2 GB. Free memory was 954.7 MB in the beginning and 927.7 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. 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: ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || ((((1 == t1_pc && (((((!(T2_E == 0) && m_st == \old(m_st)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && \old(t1_st) <= t1_st)) || E_2 < 2) || 0 == \old(E_M)) && ((((((((((((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(t1_pc == 0)) || !(1 == m_pc)) || (((((!(E_M == 0) && !(E_M == 1)) && \old(t2_st) <= t2_st) && m_st == 2) && t2_pc == 0) && t1_st == 0)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || ((((\old(t2_st) <= t2_st && token <= local) && (!(E_M == 0) && t1_st == 0) && m_st == 2) && local <= token) && !(E_M == 1))) || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((E_1 < 2 || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && local + 2 <= token) && \old(t1_st) <= t1_st)) || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || ((((1 == t1_pc && (((((!(T2_E == 0) && m_st == \old(m_st)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || (((\old(t2_st) <= t2_st && t2_pc <= 0) && (t1_st == 0 && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && m_st == 0 && token == 0) && !(E_M == 1))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || (((((\old(t2_st) <= t2_st && t2_pc <= 0) && m_st == 0 && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && token == 0) && \old(t1_st) <= t1_st) && !(E_M == 1))) || !(0 == m_pc)) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) && (((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc))) && ((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && (((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 == __retres1) || 0 < t1_pc) || 1 == m_pc)) && ((((((((((((0 == __retres1 || !(2 == E_2)) || !(T1_E == 2)) || !(1 == t1_i)) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((1 == E_M || !(1 == E_1)) || 0 == __retres1) || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || (((((!(1 == t2_pc) || T1_E == 0) || !(1 == m_pc)) || 0 == E_M) || T2_E == 0) || 0 == M_E) || !(t1_st == 0))) && ((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && ((((((((((((((T1_E == 0 || 0 < t2_pc) || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && (((((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || token < local + 2)) && (((((((((((E_1 < 2 || !(1 == E_M)) || 0 == __retres1) || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2)) && (((((((((((((E_1 < 2 || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(1 == m_pc)) || E_2 < 2) || 0 == __retres1) || local + 1 < token) || 0 == E_M) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((1 == t1_pc && m_st == 2) && 2 <= t1_st) && 2 <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || (((((1 == t1_pc && 2 <= t1_st) && m_st == \old(m_st)) && \old(t2_st) <= t2_st) && token == 0) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) || !(0 == m_pc))) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || (((((t1_pc == 1 && m_st == \old(m_st)) && t1_st == 2) && t2_st == 0) && token == 0) && \old(E_2) <= E_2)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || (((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && local + 1 <= token)) || 0 == E_M) || ((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t2_st) <= t2_st) && m_st == 2))) && (((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || ((((t1_pc == 1 && m_st == 2) && t1_st == 2) && t2_st == 0) && \old(E_2) <= E_2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc))) && ((((((((((((E_1 < 2 || T1_E == 0) || ((((1 == t1_pc && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) <= E_2)) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((1 == t1_pc && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) && ((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(\old(token) == 0) || !(0 == local)) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc))) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) || !(0 == m_pc))) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || \old(E_2) < 2) || ((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || 0 == E_M) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) && ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc) || !(0 == \old(m_pc)))) && (((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0))) || (((token == \old(token) && local + 2 <= token) && ((((((\old(E_1) == E_1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && 1 == m_pc) && \old(t1_st) <= t1_st) || (((((\old(E_1) == E_1 && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && 1 == m_pc) && \old(t1_st) <= t1_st))) && token <= local + 2)) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2)) && ((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) || !(0 == m_pc)) || (((((t1_pc <= 0 && \old(t2_st) <= t2_st) && token == 0) && m_st == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || ((1 == t1_pc && (m_st == \old(m_st) && m_st == 2) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || (((((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_1) && 2 <= E_2) && token <= \old(token) + 1) && local + 1 <= token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || ((((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_1) && \old(t2_st) <= t2_st) && 2 <= E_2)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == E_M)) || (((((m_st == \old(m_st) && t2_st == 0) && token == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || ((((t1_pc <= 0 && (1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_1) && \old(t2_st) <= t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 0 < \old(t1_pc))) && ((((((((((((((t1_pc == 0 && \old(t1_st) <= t1_st) && m_st == \old(m_st) && t2_st == 0) && \old(E_2) <= E_2) || T1_E == 0) || T2_E == 0) || 0 == M_E) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((!(2 == \old(E_2)) || !(M_E == 0)) || !(\old(T1_E) == 2)) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || token < local + 1) || !(1 == m_pc)) || local + 1 < token) || 0 == E_M) || 0 == E_2) && ((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || t1_st < 2) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && ((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(1 == t1_i)) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)) || __retres1 == 0)) && (((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || 0 == __retres1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 < t1_pc) || 1 == m_pc)) && (((local < token || token < local) || (((((((((((T1_E == 0 || t2_st < 2) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 == __retres1)) && (((((((((((((T1_E == 0 || __retres1 == 0) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || 0 == __retres1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < token) || 0 == E_M)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == m_pc)) || 0 == E_M) || 0 == E_2)) && (((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || 0 == __retres1) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || (((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local) && (((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(E_M == 0)) && !(m_st == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_2 == 0)) && \old(t1_st) <= t1_st) && local <= token)) || !(0 == \old(m_pc))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && t1_st == 0) && m_st == \old(m_st)) && \old(t2_st) <= t2_st)) || 0 < t1_pc) || !(0 == \old(m_pc)))) && (((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || ((((((m_pc == 0 && E_1 == 2) && m_st == \old(m_st)) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0))) || (((token == \old(token) && local + 2 <= token) && ((((((\old(E_1) == E_1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && 1 == m_pc) && \old(t1_st) <= t1_st) || (((((\old(E_1) == E_1 && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && 1 == m_pc) && \old(t1_st) <= t1_st))) && token <= local + 2)) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2)) && ((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || (((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local) && (((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(E_M == 0)) && !(m_st == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_2 == 0)) && \old(t1_st) <= t1_st) && local <= token)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || (((((((((1 == t1_pc && !(E_M == 0)) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 1 == m_pc) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) && (((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(1 == t1_i)) || ((((((((1 == t1_pc && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || ((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || (((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 <= \old(t1_pc)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || (((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 <= \old(t1_pc)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || !(1 == \old(m_pc))) || \old(E_2) < 2) || (((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t2_st) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2) || \old(E_1) < 2) || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || (((((((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && !(E_M == 0)) && t2_pc <= 0) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || ((((((token <= local && 2 <= E_1) && \old(t2_st) <= t2_st) && m_st == 2) && t1_st == 0) && 1 == m_pc) && local <= token)) || E_2 < 2) || !(0 == \old(m_pc))) && ((((((((((\old(E_1) < 2 || (((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || \old(t2_st) < 2) || !(t1_pc == 1)) || (((((T1_E == 0 || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((\old(t2_st) <= t2_st && m_st == 2) && t1_st == 0) && 1 == m_pc) && 2 <= E_1)) || !(0 == \old(local))) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc) || !(0 == \old(m_pc)))) && ((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token) || ((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)))) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2)) && (((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || ((((E_1 == 2 && m_st == 2) && t1_st == 0) && t2_st == 0) && 1 == m_pc)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((1 == E_M || !(1 == E_1)) || t1_st < 2) || t2_st < 2) || ((((!(1 == t2_pc) || T1_E == 0) || !(1 == m_pc)) || 0 == E_M) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && (((((1 == E_M || !(1 == E_1)) || t2_st < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((!(1 == t2_pc) || T1_E == 0) || !(1 == m_pc)) || 0 == E_M) || T2_E == 0) || 0 == M_E) || !(t1_st == 0))) || 1 <= __retres1) || local < token) || token < local)) && (((((((((((((0 == __retres1 || E_1 < 2) || !(1 == E_M)) || T1_E == 0) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || token < local + 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || token < local + 1) || !(1 == m_pc)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && ((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || 1 <= __retres1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && (((((((((((((E_1 < 2 || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < token) || 0 == E_M) || 0 == __retres1)) && ((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || 1 <= __retres1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || 0 == __retres1) || !(1 == t1_i)) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 < t1_pc) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((T1_E == 0 || T2_E == 0) || 0 == __retres1) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc)) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(0 == local)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || __retres1 == 1) || 1 == E_M) || !(1 == t2_pc)) || !(token == 0)) || t1_st < 2) || !(0 == m_st)) || E_2 < 2) || 0 == E_M) || !(0 == m_pc)) && (((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < token) || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || __retres1 == 1) || !(t1_st == 0)) || 1 == E_M) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(1 == t1_i)) || !(T2_E == 2)) || __retres1 == 1) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || 1 == E_M) || (((!(t1_pc == 0) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == m_st)) || !(t1_st == 0)) || !(2 == E_1)) || E_2 < 2) || 0 == E_M) || !(0 == t2_pc)) || __retres1 == 1)) && (((((((((((((((!(0 == m_st) || !(t1_st == 2)) || !(0 == t2_st)) || !(0 == t2_pc)) || !(0 == m_pc)) && ((((!(t1_st == 2) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == m_st)) || !(0 == t2_pc))) || T1_E == 0) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || __retres1 == 1) || !(2 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || local < token) || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || __retres1 == 1)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(0 == local)) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(token == 0)) || !(0 == m_st)) || E_2 < 2) || 0 == E_M) || __retres1 == 1) || 0 < t1_pc) || !(0 == m_pc))) && (((((((((((((!(0 == m_st) || !(t1_st == 2)) || !(0 == t2_st)) || !(0 == t2_pc)) || !(0 == m_pc)) && ((((!(t1_st == 2) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == m_st)) || !(0 == t2_pc))) || T1_E == 0) || T2_E == 0) || 0 == M_E) || __retres1 == 1) || 1 == E_M) || E_2 < 2) || 0 == E_M) || ((!(token == 0) || !(0 == local)) || !(2 == E_1)) || !(t1_pc == 1)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || (((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M)) && ((((((((((((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(t1_pc == 0)) || !(1 == m_pc)) || (((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && t2_st == 2) && t1_st == 0)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && t1_st == 0) && token == 0)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || (((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M)) && (((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && ((((((((1 == \old(E_M) || !(t1_pc == 0)) || ((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(1 == m_pc)) || !(2 == \old(m_st))) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc))) || !(\old(t1_st) == 0))) && ((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || (((((\old(E_M) == E_M && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc <= 0 && ((((2 <= t2_st && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) || ((((((((((E_M == 2 && m_st == 0) && m_pc == 0) && E_1 == 2) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(2 == \old(E_2))) || !(T1_E == 2)) || (((((((((m_st == 2 && !(E_M == 0)) && E_1 == 2) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && 1 == m_pc) && t1_pc == 0) && !(E_M == 1)) && \old(E_2) <= E_2)) || (2 <= t1_st && ((((1 == t1_pc && 2 <= E_2) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1))) || ((token <= local && (2 <= t2_st && (((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && local <= token)) || !(m_i == 1)) || (((((!(E_M == 0) && E_1 == 2) && !(E_M == 1)) && ((t2_pc == 0 && t2_st == 0) && t1_pc == 1) && t1_st == 2) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || !(2 == M_E)) || ((((((((1 == t2_pc && t1_pc <= 0) && !(E_M == 0)) && 2 <= t2_st) && t1_st == 0) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((token <= local && ((((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t1_pc) && 2 <= E_2) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1)) && local <= token)) || !(1 == t1_i)) || ((((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || (((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || !(2 == \old(E_1))) || !(1 == t2_i)) && (((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && ((((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_2 == 0)) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || (((((((1 == t1_pc && \old(t2_st) <= t2_st) && ((((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_2 == 0)) && t2_pc <= 0) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || ((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 1 <= \old(t1_pc)) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || (((1 <= \old(t1_pc) && (2 <= t2_st && (((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || (((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 1 <= \old(t1_pc)) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && ((((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_2 == 0)) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || ((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 1 <= \old(t1_pc)) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || !(1 == \old(m_pc))) || (((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 <= \old(t1_pc)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(E_2) < 2) || 0 == \old(E_M)) || (((1 <= \old(t1_pc) && (2 <= t2_st && (((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || (((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 1 <= \old(t1_pc)) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(token) < \old(local) + 2) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 == \old(E_2)) || !(\old(T1_E) == 2)) || (((((2 <= t2_st && 2 <= t1_st) && local + 2 <= token) && (((1 == t1_pc && 1 == t2_pc) && (m_st == 0 && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || ((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && token <= local + 1) && local + 1 <= token) && 2 <= t1_st) && !(E_M == 1))) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || (((((((((((((m_pc == 0 && E_1 == 2) && T1_E == 2) && m_st == \old(m_st)) && E_M == 2) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || ((2 <= t1_st && (((((1 == t1_pc && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1))) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || (((2 <= t2_st && (((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && 2 <= t1_st) && !(E_M == 1))) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 110.4s OverallTime, 30 OverallIterations, 4 TraceHistogramMax, 50.0s AutomataDifference, 0.0s DeadEndRemovalTime, 48.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8488 SDtfs, 11268 SDslu, 36068 SDs, 0 SdLazy, 18283 SolverSat, 3549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 6654 GetRequests, 5871 SyntacticMatches, 55 SemanticMatches, 728 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23568 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3954occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 18 AbstIntIterations, 7 AbstIntStrong, 0.9908442588497224 AbsIntWeakeningRatio, 0.5985342019543974 AbsIntAvgWeakeningVarsNumRemoved, 14.430781758957655 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 1692 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 15608 PreInvPairs, 15964 NumberOfFragments, 25865 HoareAnnotationTreeSize, 15608 FomulaSimplifications, 252532 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 71 FomulaSimplificationsInter, 129612 FormulaSimplificationTreeSizeReductionInter, 45.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 7842 NumberOfCodeBlocks, 7842 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 10246 ConstructedInterpolants, 0 QuantifiedInterpolants, 2968128 SizeOfPredicates, 15 NumberOfNonLiveVariables, 10701 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 52 InterpolantComputations, 25 PerfectInterpolantSequences, 5817/6271 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...