./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2216fd6115b2bb44c4633e353be739828d7cac46 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:08:11,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:08:11,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:08:11,076 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:08:11,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:08:11,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:08:11,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:08:11,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:08:11,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:08:11,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:08:11,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:08:11,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:08:11,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:08:11,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:08:11,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:08:11,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:08:11,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:08:11,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:08:11,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:08:11,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:08:11,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:08:11,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:08:11,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:08:11,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:08:11,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:08:11,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:08:11,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:08:11,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:08:11,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:08:11,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:08:11,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:08:11,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:08:11,104 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:08:11,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:08:11,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:08:11,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:08:11,107 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 21:08:11,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:08:11,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:08:11,121 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:08:11,122 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:08:11,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:08:11,122 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:08:11,123 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:08:11,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:08:11,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:08:11,123 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:08:11,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:08:11,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:08:11,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:08:11,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:08:11,124 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:08:11,124 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:08:11,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:08:11,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:08:11,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:08:11,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:08:11,127 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:08:11,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:08:11,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:08:11,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:08:11,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:08:11,128 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:08:11,128 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:08:11,128 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:08:11,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:08:11,129 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2216fd6115b2bb44c4633e353be739828d7cac46 [2018-10-26 21:08:11,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:08:11,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:08:11,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:08:11,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:08:11,172 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:08:11,173 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-10-26 21:08:11,222 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/data/e276c559b/dd06ccbd94bb45a9a4efaa373f2ab68c/FLAGdb0c0ab46 [2018-10-26 21:08:11,619 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:08:11,620 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-10-26 21:08:11,627 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/data/e276c559b/dd06ccbd94bb45a9a4efaa373f2ab68c/FLAGdb0c0ab46 [2018-10-26 21:08:11,642 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/data/e276c559b/dd06ccbd94bb45a9a4efaa373f2ab68c [2018-10-26 21:08:11,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:08:11,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:08:11,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:08:11,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:08:11,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:08:11,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf504d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11, skipping insertion in model container [2018-10-26 21:08:11,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:08:11,704 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:08:11,869 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:08:11,874 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:08:11,905 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:08:11,923 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:08:11,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11 WrapperNode [2018-10-26 21:08:11,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:08:11,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:08:11,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:08:11,930 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:08:11,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (1/1) ... [2018-10-26 21:08:11,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:08:11,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:08:11,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:08:11,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:08:11,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:08:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:08:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:08:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-10-26 21:08:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-10-26 21:08:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-10-26 21:08:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-10-26 21:08:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-10-26 21:08:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-10-26 21:08:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-10-26 21:08:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-10-26 21:08:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-10-26 21:08:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-10-26 21:08:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-10-26 21:08:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-10-26 21:08:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-10-26 21:08:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-10-26 21:08:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-10-26 21:08:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-10-26 21:08:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-10-26 21:08:12,080 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-10-26 21:08:12,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:08:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 21:08:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-10-26 21:08:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-10-26 21:08:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-10-26 21:08:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-10-26 21:08:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 21:08:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-10-26 21:08:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-10-26 21:08:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-10-26 21:08:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-10-26 21:08:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-10-26 21:08:12,082 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-10-26 21:08:12,082 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:08:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:08:12,835 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:08:12,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:08:12 BoogieIcfgContainer [2018-10-26 21:08:12,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:08:12,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:08:12,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:08:12,844 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:08:12,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:08:11" (1/3) ... [2018-10-26 21:08:12,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4263a7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:08:12, skipping insertion in model container [2018-10-26 21:08:12,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:08:11" (2/3) ... [2018-10-26 21:08:12,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4263a7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:08:12, skipping insertion in model container [2018-10-26 21:08:12,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:08:12" (3/3) ... [2018-10-26 21:08:12,849 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_true-unreach-call_false-termination.cil.c [2018-10-26 21:08:12,860 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:08:12,866 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:08:12,877 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:08:12,905 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:08:12,905 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:08:12,906 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:08:12,906 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:08:12,906 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:08:12,906 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:08:12,906 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:08:12,906 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:08:12,906 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:08:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-10-26 21:08:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:12,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:12,937 INFO L375 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] [2018-10-26 21:08:12,938 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:12,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash -762370105, now seen corresponding path program 1 times [2018-10-26 21:08:12,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:12,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:12,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:12,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:12,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:13,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:13,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:08:13,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:13,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:13,229 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 5 states. [2018-10-26 21:08:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:14,258 INFO L93 Difference]: Finished difference Result 307 states and 433 transitions. [2018-10-26 21:08:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:14,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-10-26 21:08:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:14,270 INFO L225 Difference]: With dead ends: 307 [2018-10-26 21:08:14,271 INFO L226 Difference]: Without dead ends: 166 [2018-10-26 21:08:14,275 INFO L605 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-10-26 21:08:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-26 21:08:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2018-10-26 21:08:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-26 21:08:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2018-10-26 21:08:14,345 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 79 [2018-10-26 21:08:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:14,347 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2018-10-26 21:08:14,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2018-10-26 21:08:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:14,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:14,351 INFO L375 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] [2018-10-26 21:08:14,351 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:14,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash -328641019, now seen corresponding path program 1 times [2018-10-26 21:08:14,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:14,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:14,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:14,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:14,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:14,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:08:14,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:14,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:14,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:14,488 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 5 states. [2018-10-26 21:08:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:14,956 INFO L93 Difference]: Finished difference Result 286 states and 385 transitions. [2018-10-26 21:08:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:14,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-10-26 21:08:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:14,959 INFO L225 Difference]: With dead ends: 286 [2018-10-26 21:08:14,960 INFO L226 Difference]: Without dead ends: 166 [2018-10-26 21:08:14,961 INFO L605 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-10-26 21:08:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-26 21:08:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2018-10-26 21:08:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-26 21:08:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 179 transitions. [2018-10-26 21:08:14,981 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 179 transitions. Word has length 79 [2018-10-26 21:08:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:14,981 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 179 transitions. [2018-10-26 21:08:14,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 179 transitions. [2018-10-26 21:08:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:14,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:14,984 INFO L375 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] [2018-10-26 21:08:14,984 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:14,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash 932276231, now seen corresponding path program 1 times [2018-10-26 21:08:14,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:14,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:14,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:15,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:15,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:08:15,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:15,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:15,074 INFO L87 Difference]: Start difference. First operand 139 states and 179 transitions. Second operand 5 states. [2018-10-26 21:08:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:15,625 INFO L93 Difference]: Finished difference Result 302 states and 407 transitions. [2018-10-26 21:08:15,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:15,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-10-26 21:08:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:15,627 INFO L225 Difference]: With dead ends: 302 [2018-10-26 21:08:15,627 INFO L226 Difference]: Without dead ends: 182 [2018-10-26 21:08:15,628 INFO L605 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-10-26 21:08:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-26 21:08:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 139. [2018-10-26 21:08:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-26 21:08:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2018-10-26 21:08:15,651 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 79 [2018-10-26 21:08:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:15,652 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2018-10-26 21:08:15,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2018-10-26 21:08:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:15,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:15,655 INFO L375 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] [2018-10-26 21:08:15,655 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:15,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 972950981, now seen corresponding path program 1 times [2018-10-26 21:08:15,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:15,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:15,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:15,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:15,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:08:15,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:15,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:15,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:15,745 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand 5 states. [2018-10-26 21:08:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:16,416 INFO L93 Difference]: Finished difference Result 295 states and 395 transitions. [2018-10-26 21:08:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:16,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-10-26 21:08:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:16,423 INFO L225 Difference]: With dead ends: 295 [2018-10-26 21:08:16,423 INFO L226 Difference]: Without dead ends: 175 [2018-10-26 21:08:16,424 INFO L605 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-10-26 21:08:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-26 21:08:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 139. [2018-10-26 21:08:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-26 21:08:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2018-10-26 21:08:16,443 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 79 [2018-10-26 21:08:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:16,443 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2018-10-26 21:08:16,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2018-10-26 21:08:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:16,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:16,446 INFO L375 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] [2018-10-26 21:08:16,446 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:16,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1935230905, now seen corresponding path program 1 times [2018-10-26 21:08:16,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:16,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:16,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:16,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:16,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:16,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:16,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:08:16,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:08:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:08:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:08:16,515 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand 6 states. [2018-10-26 21:08:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:16,576 INFO L93 Difference]: Finished difference Result 268 states and 354 transitions. [2018-10-26 21:08:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:08:16,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-10-26 21:08:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:16,581 INFO L225 Difference]: With dead ends: 268 [2018-10-26 21:08:16,581 INFO L226 Difference]: Without dead ends: 149 [2018-10-26 21:08:16,582 INFO L605 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-10-26 21:08:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-26 21:08:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2018-10-26 21:08:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-26 21:08:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2018-10-26 21:08:16,598 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 79 [2018-10-26 21:08:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:16,598 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2018-10-26 21:08:16,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:08:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2018-10-26 21:08:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:16,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:16,599 INFO L375 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] [2018-10-26 21:08:16,600 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:16,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1687084411, now seen corresponding path program 1 times [2018-10-26 21:08:16,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:16,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:16,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:16,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:16,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:16,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:16,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:16,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:16,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:16,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:16,664 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand 4 states. [2018-10-26 21:08:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:17,154 INFO L93 Difference]: Finished difference Result 385 states and 506 transitions. [2018-10-26 21:08:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:17,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-10-26 21:08:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:17,156 INFO L225 Difference]: With dead ends: 385 [2018-10-26 21:08:17,157 INFO L226 Difference]: Without dead ends: 261 [2018-10-26 21:08:17,157 INFO L605 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-10-26 21:08:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-26 21:08:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 255. [2018-10-26 21:08:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-26 21:08:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 321 transitions. [2018-10-26 21:08:17,182 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 321 transitions. Word has length 79 [2018-10-26 21:08:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:17,183 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 321 transitions. [2018-10-26 21:08:17,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 321 transitions. [2018-10-26 21:08:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:17,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:17,184 INFO L375 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] [2018-10-26 21:08:17,184 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:17,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1650954502, now seen corresponding path program 1 times [2018-10-26 21:08:17,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:17,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:17,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:17,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:17,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:17,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:17,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:08:17,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:08:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:08:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:08:17,255 INFO L87 Difference]: Start difference. First operand 255 states and 321 transitions. Second operand 6 states. [2018-10-26 21:08:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:17,365 INFO L93 Difference]: Finished difference Result 497 states and 643 transitions. [2018-10-26 21:08:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:08:17,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-10-26 21:08:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:17,368 INFO L225 Difference]: With dead ends: 497 [2018-10-26 21:08:17,368 INFO L226 Difference]: Without dead ends: 262 [2018-10-26 21:08:17,369 INFO L605 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-10-26 21:08:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-26 21:08:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-10-26 21:08:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-26 21:08:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 325 transitions. [2018-10-26 21:08:17,394 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 325 transitions. Word has length 79 [2018-10-26 21:08:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:17,394 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 325 transitions. [2018-10-26 21:08:17,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:08:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 325 transitions. [2018-10-26 21:08:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:17,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:17,395 INFO L375 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] [2018-10-26 21:08:17,396 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:17,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1578567944, now seen corresponding path program 1 times [2018-10-26 21:08:17,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:17,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:17,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:17,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:17,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:17,623 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 21:08:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:17,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:08:17,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:17,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:17,971 INFO L87 Difference]: Start difference. First operand 260 states and 325 transitions. Second operand 5 states. [2018-10-26 21:08:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:18,866 INFO L93 Difference]: Finished difference Result 603 states and 763 transitions. [2018-10-26 21:08:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:08:18,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-10-26 21:08:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:18,871 INFO L225 Difference]: With dead ends: 603 [2018-10-26 21:08:18,871 INFO L226 Difference]: Without dead ends: 364 [2018-10-26 21:08:18,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:08:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-26 21:08:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 320. [2018-10-26 21:08:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-26 21:08:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 389 transitions. [2018-10-26 21:08:18,898 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 389 transitions. Word has length 79 [2018-10-26 21:08:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:18,899 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 389 transitions. [2018-10-26 21:08:18,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 389 transitions. [2018-10-26 21:08:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:18,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:18,900 INFO L375 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] [2018-10-26 21:08:18,900 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:18,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1330195958, now seen corresponding path program 1 times [2018-10-26 21:08:18,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:18,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:18,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:19,121 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 21:08:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:19,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:19,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:08:19,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:19,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:19,318 INFO L87 Difference]: Start difference. First operand 320 states and 389 transitions. Second operand 5 states. [2018-10-26 21:08:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:19,564 INFO L93 Difference]: Finished difference Result 619 states and 756 transitions. [2018-10-26 21:08:19,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:19,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-10-26 21:08:19,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:19,566 INFO L225 Difference]: With dead ends: 619 [2018-10-26 21:08:19,566 INFO L226 Difference]: Without dead ends: 320 [2018-10-26 21:08:19,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:08:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-26 21:08:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-10-26 21:08:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-26 21:08:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 385 transitions. [2018-10-26 21:08:19,592 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 385 transitions. Word has length 79 [2018-10-26 21:08:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:19,592 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 385 transitions. [2018-10-26 21:08:19,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 385 transitions. [2018-10-26 21:08:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:19,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:19,593 INFO L375 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] [2018-10-26 21:08:19,593 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:19,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1839669048, now seen corresponding path program 1 times [2018-10-26 21:08:19,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:19,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:19,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:19,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:19,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:08:19,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:19,701 INFO L87 Difference]: Start difference. First operand 320 states and 385 transitions. Second operand 5 states. [2018-10-26 21:08:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:20,064 INFO L93 Difference]: Finished difference Result 731 states and 928 transitions. [2018-10-26 21:08:20,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:08:20,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-10-26 21:08:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:20,067 INFO L225 Difference]: With dead ends: 731 [2018-10-26 21:08:20,067 INFO L226 Difference]: Without dead ends: 432 [2018-10-26 21:08:20,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:08:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-10-26 21:08:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 367. [2018-10-26 21:08:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-26 21:08:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 433 transitions. [2018-10-26 21:08:20,099 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 433 transitions. Word has length 79 [2018-10-26 21:08:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:20,100 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 433 transitions. [2018-10-26 21:08:20,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 433 transitions. [2018-10-26 21:08:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:08:20,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:20,101 INFO L375 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] [2018-10-26 21:08:20,101 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:20,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:20,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1777629434, now seen corresponding path program 1 times [2018-10-26 21:08:20,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:20,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:20,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:20,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:20,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:20,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:20,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:08:20,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:08:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:08:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:08:20,194 INFO L87 Difference]: Start difference. First operand 367 states and 433 transitions. Second operand 3 states. [2018-10-26 21:08:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:20,383 INFO L93 Difference]: Finished difference Result 1015 states and 1251 transitions. [2018-10-26 21:08:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:08:20,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-10-26 21:08:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:20,389 INFO L225 Difference]: With dead ends: 1015 [2018-10-26 21:08:20,389 INFO L226 Difference]: Without dead ends: 668 [2018-10-26 21:08:20,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:08:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-26 21:08:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2018-10-26 21:08:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-26 21:08:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 797 transitions. [2018-10-26 21:08:20,452 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 797 transitions. Word has length 79 [2018-10-26 21:08:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:20,452 INFO L481 AbstractCegarLoop]: Abstraction has 666 states and 797 transitions. [2018-10-26 21:08:20,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:08:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 797 transitions. [2018-10-26 21:08:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 21:08:20,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:20,456 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 21:08:20,456 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:20,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1914530701, now seen corresponding path program 1 times [2018-10-26 21:08:20,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:20,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:20,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:20,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:20,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 21:08:20,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:20,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:20,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:20,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:20,683 INFO L87 Difference]: Start difference. First operand 666 states and 797 transitions. Second operand 4 states. [2018-10-26 21:08:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:22,215 INFO L93 Difference]: Finished difference Result 1855 states and 2269 transitions. [2018-10-26 21:08:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:22,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-10-26 21:08:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:22,220 INFO L225 Difference]: With dead ends: 1855 [2018-10-26 21:08:22,220 INFO L226 Difference]: Without dead ends: 969 [2018-10-26 21:08:22,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-10-26 21:08:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 940. [2018-10-26 21:08:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-10-26 21:08:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1104 transitions. [2018-10-26 21:08:22,302 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1104 transitions. Word has length 125 [2018-10-26 21:08:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:22,302 INFO L481 AbstractCegarLoop]: Abstraction has 940 states and 1104 transitions. [2018-10-26 21:08:22,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1104 transitions. [2018-10-26 21:08:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 21:08:22,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:22,308 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 21:08:22,309 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:22,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1937848437, now seen corresponding path program 1 times [2018-10-26 21:08:22,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:22,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:22,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 21:08:22,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:22,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:08:22,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:08:22,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:08:22,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:08:22,544 INFO L87 Difference]: Start difference. First operand 940 states and 1104 transitions. Second operand 6 states. [2018-10-26 21:08:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:23,487 INFO L93 Difference]: Finished difference Result 2841 states and 3497 transitions. [2018-10-26 21:08:23,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:08:23,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-10-26 21:08:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:23,500 INFO L225 Difference]: With dead ends: 2841 [2018-10-26 21:08:23,501 INFO L226 Difference]: Without dead ends: 1922 [2018-10-26 21:08:23,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:08:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-10-26 21:08:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1820. [2018-10-26 21:08:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2018-10-26 21:08:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2220 transitions. [2018-10-26 21:08:23,667 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2220 transitions. Word has length 183 [2018-10-26 21:08:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:23,669 INFO L481 AbstractCegarLoop]: Abstraction has 1820 states and 2220 transitions. [2018-10-26 21:08:23,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:08:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2220 transitions. [2018-10-26 21:08:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 21:08:23,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:23,677 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 21:08:23,678 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:23,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1331117250, now seen corresponding path program 1 times [2018-10-26 21:08:23,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:23,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-26 21:08:23,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:08:23,878 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:08:23,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:24,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:08:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 21:08:24,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:08:24,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-26 21:08:24,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:24,092 INFO L87 Difference]: Start difference. First operand 1820 states and 2220 transitions. Second operand 4 states. [2018-10-26 21:08:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:25,092 INFO L93 Difference]: Finished difference Result 3951 states and 4881 transitions. [2018-10-26 21:08:25,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:25,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-10-26 21:08:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:25,104 INFO L225 Difference]: With dead ends: 3951 [2018-10-26 21:08:25,104 INFO L226 Difference]: Without dead ends: 2152 [2018-10-26 21:08:25,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-10-26 21:08:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2148. [2018-10-26 21:08:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2018-10-26 21:08:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2489 transitions. [2018-10-26 21:08:25,282 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 2489 transitions. Word has length 207 [2018-10-26 21:08:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:25,283 INFO L481 AbstractCegarLoop]: Abstraction has 2148 states and 2489 transitions. [2018-10-26 21:08:25,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2489 transitions. [2018-10-26 21:08:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 21:08:25,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:25,290 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 21:08:25,291 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:25,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash -452967682, now seen corresponding path program 1 times [2018-10-26 21:08:25,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:25,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:25,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-26 21:08:25,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:25,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:25,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:25,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:25,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:25,456 INFO L87 Difference]: Start difference. First operand 2148 states and 2489 transitions. Second operand 4 states. [2018-10-26 21:08:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:25,647 INFO L93 Difference]: Finished difference Result 2152 states and 2492 transitions. [2018-10-26 21:08:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:25,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-10-26 21:08:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:25,657 INFO L225 Difference]: With dead ends: 2152 [2018-10-26 21:08:25,657 INFO L226 Difference]: Without dead ends: 1752 [2018-10-26 21:08:25,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-26 21:08:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2018-10-26 21:08:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2018-10-26 21:08:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2040 transitions. [2018-10-26 21:08:25,821 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2040 transitions. Word has length 207 [2018-10-26 21:08:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:25,824 INFO L481 AbstractCegarLoop]: Abstraction has 1752 states and 2040 transitions. [2018-10-26 21:08:25,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2040 transitions. [2018-10-26 21:08:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-26 21:08:25,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:25,830 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 21:08:25,830 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:25,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1400666308, now seen corresponding path program 1 times [2018-10-26 21:08:25,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:25,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:25,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-26 21:08:26,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:08:26,393 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:08:26,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:26,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:08:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 21:08:26,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:08:26,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-10-26 21:08:26,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:08:26,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:08:26,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:08:26,583 INFO L87 Difference]: Start difference. First operand 1752 states and 2040 transitions. Second operand 12 states. [2018-10-26 21:08:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:27,435 INFO L93 Difference]: Finished difference Result 2606 states and 3029 transitions. [2018-10-26 21:08:27,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:08:27,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 208 [2018-10-26 21:08:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:27,441 INFO L225 Difference]: With dead ends: 2606 [2018-10-26 21:08:27,441 INFO L226 Difference]: Without dead ends: 875 [2018-10-26 21:08:27,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:08:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-10-26 21:08:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 795. [2018-10-26 21:08:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-10-26 21:08:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 891 transitions. [2018-10-26 21:08:27,517 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 891 transitions. Word has length 208 [2018-10-26 21:08:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:27,518 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 891 transitions. [2018-10-26 21:08:27,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:08:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 891 transitions. [2018-10-26 21:08:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-26 21:08:27,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:27,522 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 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-10-26 21:08:27,523 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:27,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1908322713, now seen corresponding path program 1 times [2018-10-26 21:08:27,523 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:27,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:27,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-26 21:08:27,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:08:27,806 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:08:27,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:27,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:08:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 91 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-26 21:08:28,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:08:28,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-10-26 21:08:28,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:08:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:08:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:08:28,332 INFO L87 Difference]: Start difference. First operand 795 states and 891 transitions. Second operand 7 states. [2018-10-26 21:08:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:30,500 INFO L93 Difference]: Finished difference Result 1344 states and 1545 transitions. [2018-10-26 21:08:30,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:08:30,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2018-10-26 21:08:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:30,502 INFO L225 Difference]: With dead ends: 1344 [2018-10-26 21:08:30,502 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:08:30,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:08:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:08:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:08:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:08:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:08:30,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-10-26 21:08:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:30,510 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:08:30,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:08:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:08:30,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:08:30,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:08:30,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:08:31,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:08:31,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:08:33,986 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-10-26 21:08:35,018 WARN L179 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 49 [2018-10-26 21:08:35,304 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2018-10-26 21:08:35,530 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-10-26 21:08:35,792 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-10-26 21:08:36,131 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-10-26 21:08:36,360 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-10-26 21:08:36,713 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-10-26 21:08:36,986 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2018-10-26 21:08:37,302 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-10-26 21:08:37,971 WARN L179 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-10-26 21:08:38,155 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2018-10-26 21:08:38,512 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2018-10-26 21:08:39,097 WARN L179 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2018-10-26 21:08:39,574 WARN L179 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2018-10-26 21:08:39,877 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-10-26 21:08:40,001 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-10-26 21:08:40,785 WARN L179 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 112 [2018-10-26 21:08:41,255 WARN L179 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2018-10-26 21:08:41,368 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-10-26 21:08:42,187 WARN L179 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 112 [2018-10-26 21:08:42,354 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-10-26 21:08:42,569 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-10-26 21:08:43,092 WARN L179 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2018-10-26 21:08:43,421 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2018-10-26 21:08:43,732 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2018-10-26 21:08:43,932 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2018-10-26 21:08:44,113 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2018-10-26 21:08:44,442 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2018-10-26 21:08:44,592 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-10-26 21:08:44,985 WARN L179 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2018-10-26 21:08:45,177 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2018-10-26 21:08:45,481 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2018-10-26 21:08:45,636 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-10-26 21:08:45,851 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-10-26 21:08:46,313 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2018-10-26 21:08:46,526 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-10-26 21:08:46,838 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2018-10-26 21:08:47,004 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2018-10-26 21:08:47,267 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-10-26 21:08:47,614 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2018-10-26 21:08:47,673 INFO L425 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2018-10-26 21:08:47,674 INFO L421 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse16 (= 0 ~t1_st~0)) (.cse15 (= ~t1_pc~0 1))) (let ((.cse9 (= 1 ~E_1~0)) (.cse2 (<= 2 ~m_st~0)) (.cse4 (< |old(~m_st~0)| 2)) (.cse18 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse13 (< ~local~0 ~token~0)) (.cse3 (not .cse15)) (.cse14 (< ~token~0 ~local~0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= ~T1_E~0 1)) (.cse1 (not .cse16)) (.cse17 (< ~E_M~0 2)) (.cse10 (= 0 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= |old(~t1_st~0)| 0))) (and (let ((.cse8 (+ ~local~0 1))) (or (not (= 1 ~E_M~0)) .cse0 (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< ~token~0 .cse8) .cse9 .cse10 .cse11 (< .cse8 ~token~0) .cse12)) (or .cse0 .cse13 .cse14 .cse15 .cse5 .cse6 (not .cse12) .cse16 .cse7 .cse17 .cse10 .cse11 .cse18) (or .cse7 .cse0 .cse9 .cse10 .cse3 (= 0 ~E_M~0) .cse2 .cse4 .cse5 .cse18 .cse6) (or .cse0 .cse13 .cse3 .cse14 .cse5 .cse6 .cse7 .cse1 .cse17 .cse10 .cse11 .cse12)))) [2018-10-26 21:08:47,674 INFO L425 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2018-10-26 21:08:47,674 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 102) no Hoare annotation was computed. [2018-10-26 21:08:47,674 INFO L421 ceAbstractionStarter]: At program point L89-2(lines 77 108) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0)) (.cse20 (<= 2 ~m_st~0))) (let ((.cse7 (= 1 ~m_pc~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse19 (<= ~local~0 ~token~0)) (.cse3 (and (not .cse0) (and (not .cse1) (not (= ~E_M~0 0))) .cse20 (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)))) (.cse16 (= ~m_st~0 0)) (.cse9 (< ~local~0 |old(~token~0)|)) (.cse11 (= |old(~t1_pc~0)| 1)) (.cse10 (< |old(~token~0)| ~local~0)) (.cse5 (< |old(~m_st~0)| 2)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse2 (= 1 ~E_1~0)) (.cse12 (< |old(~E_M~0)| 2)) (.cse4 (= 0 ~E_1~0)) (.cse13 (not (= 1 ~t1_i~0))) (.cse15 (not (= 0 ~t1_st~0))) (.cse14 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |old(~E_M~0)|) .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse9 .cse10 .cse11 .cse6 .cse8 .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse12 .cse4 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19) .cse7) (or .cse1 .cse9 .cse10 (and .cse15 .cse20 .cse17 .cse18 .cse19) .cse11 .cse5 .cse6 .cse8 .cse0 .cse2 .cse12 .cse4 .cse13 .cse14) (let ((.cse21 (<= 2 ~E_M~0)) (.cse22 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse23 (<= (+ ~local~0 1) ~token~0))) (or .cse1 .cse3 (and .cse15 .cse16 .cse21 .cse22 .cse23) .cse9 (not .cse11) .cse10 .cse5 .cse6 .cse8 .cse0 .cse2 .cse12 .cse4 .cse13 (and .cse15 .cse20 .cse21 .cse22 .cse23) .cse14))))) [2018-10-26 21:08:47,675 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-10-26 21:08:47,675 INFO L421 ceAbstractionStarter]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse8 (= |old(~t1_pc~0)| 1))) (let ((.cse7 (= 0 |old(~E_M~0)|)) (.cse11 (= 1 ~m_pc~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse1 (= ~T1_E~0 0)) (.cse18 (< ~local~0 |old(~token~0)|)) (.cse13 (not .cse8)) (.cse19 (< |old(~token~0)| ~local~0)) (.cse9 (< |old(~m_st~0)| 2)) (.cse10 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 0 ~t1_st~0))) (.cse4 (<= 2 ~m_st~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0)) (.cse0 (= ~T1_E~0 1)) (.cse2 (= 1 ~E_1~0)) (.cse20 (< |old(~E_M~0)| 2)) (.cse6 (= 0 ~E_1~0)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse6 .cse13 .cse7 (and .cse14 .cse4 .cse5) .cse9 .cse10 .cse11 .cse12) (or .cse1 (and .cse3 .cse15 (= ~m_st~0 0) .cse16 .cse17 .cse5) .cse18 .cse19 .cse8 .cse10 .cse12 .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse20 .cse6 .cse21 .cse22 .cse11) (or .cse1 .cse18 .cse19 .cse8 .cse9 .cse10 .cse12 (and .cse3 .cse15 .cse4 .cse16 .cse17 .cse5) .cse0 .cse2 .cse20 .cse6 .cse21 .cse22) (or .cse1 .cse18 .cse13 .cse19 .cse9 .cse10 .cse12 (and .cse14 .cse15 .cse4 .cse16 .cse17 .cse5) .cse0 .cse2 .cse20 .cse6 .cse21 .cse22)))) [2018-10-26 21:08:47,675 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-10-26 21:08:47,675 INFO L421 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= |old(~E_M~0)| ~E_M~0)) (.cse12 (< ~local~0 |old(~token~0)|)) (.cse13 (< |old(~token~0)| ~local~0)) (.cse15 (< |old(~E_M~0)| 2)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (= |old(~t1_st~0)| 0)) (.cse0 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= 1 ~E_1~0)) (.cse3 (= 0 ~E_1~0)) (.cse4 (= 0 |old(~E_M~0)|)) (.cse14 (= |old(~t1_pc~0)| 1)) (.cse8 (< |old(~m_st~0)| 2)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse13 .cse14 .cse9 .cse11 .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse15 .cse3 .cse16 .cse17 .cse10) (or .cse1 .cse12 .cse13 .cse8 .cse9 .cse11 (and .cse5 (not (= 0 ~t1_st~0)) .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) .cse0 .cse2 .cse15 .cse3 .cse16 .cse17) (or .cse1 .cse12 .cse13 .cse14 .cse8 .cse9 .cse11 .cse0 .cse2 .cse15 .cse3 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse8 .cse9 .cse10 .cse11))) [2018-10-26 21:08:47,675 INFO L425 ceAbstractionStarter]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2018-10-26 21:08:47,675 INFO L421 ceAbstractionStarter]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse14 (= ~T1_E~0 1)) (.cse9 (<= 2 ~m_st~0)) (.cse0 (= ~T1_E~0 0))) (let ((.cse19 (and .cse7 (not .cse14) .cse9 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not .cse0) (not (= ~M_E~0 1)) (not (= ~E_1~0 0)))) (.cse13 (= ~m_st~0 0)) (.cse21 (= 1 ~m_pc~0)) (.cse8 (not (= 0 ~t1_st~0))) (.cse22 (<= ~token~0 ~local~0)) (.cse23 (= ~E_M~0 |old(~E_M~0)|)) (.cse24 (<= ~local~0 ~token~0)) (.cse1 (< ~local~0 |old(~token~0)|)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse15 (= 1 ~E_1~0)) (.cse16 (< |old(~E_M~0)| 2)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse20 (= |old(~t1_st~0)| 0))) (and (let ((.cse10 (<= 2 ~E_M~0)) (.cse11 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse12 (<= (+ ~local~0 1) ~token~0))) (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse8 .cse13 .cse10 .cse11 .cse12) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse14 .cse0 .cse15 .cse17 .cse19 (= 0 |old(~E_M~0)|) .cse4 .cse5 .cse21 .cse6) (or .cse0 .cse1 .cse3 .cse2 .cse5 .cse6 .cse14 (not (= 0 |old(~m_st~0)|)) .cse15 .cse16 (and .cse7 .cse8 .cse13 .cse22 .cse23 .cse24) .cse17 .cse18 .cse20 .cse21) (or (and .cse7 .cse8 .cse9 .cse22 .cse23 .cse24) .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20)))) [2018-10-26 21:08:47,675 INFO L421 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (let ((.cse3 (= |old(~t1_pc~0)| 1)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse12 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~local~0 |old(~token~0)|)) (.cse2 (< |old(~token~0)| ~local~0)) (.cse15 (= 1 ~t1_pc~0)) (.cse16 (<= 2 ~m_st~0)) (.cse13 (< |old(~m_st~0)| 2)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= ~T1_E~0 1)) (.cse7 (= 1 ~E_1~0)) (.cse8 (< |old(~E_M~0)| 2)) (.cse9 (= 0 ~E_1~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 |old(~m_st~0)|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse6 .cse0 .cse7 .cse9 .cse14 .cse3 .cse13 .cse4 .cse12 .cse5) (or .cse6 .cse0 .cse7 (and .cse15 .cse16 (not (= ~E_M~0 0))) .cse9 .cse14 .cse13 .cse4 .cse12 .cse5) (or .cse0 .cse1 .cse2 (and .cse15 (not (= 0 ~t1_st~0)) .cse16 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) (= 1 ~E_M~0)) .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-10-26 21:08:47,675 INFO L425 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-10-26 21:08:47,675 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2018-10-26 21:08:47,676 INFO L425 ceAbstractionStarter]: For program point L315(line 315) no Hoare annotation was computed. [2018-10-26 21:08:47,676 INFO L425 ceAbstractionStarter]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2018-10-26 21:08:47,676 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-10-26 21:08:47,676 INFO L421 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse19 (= 0 ~t1_st~0))) (let ((.cse3 (= ~t1_pc~0 1)) (.cse21 (not .cse19)) (.cse20 (<= 2 ~m_st~0)) (.cse22 (+ ~local~0 1)) (.cse18 (= |old(~t1_st~0)| 0))) (let ((.cse6 (not .cse18)) (.cse12 (= 1 ~m_pc~0)) (.cse16 (< ~token~0 .cse22)) (.cse17 (< .cse22 ~token~0)) (.cse15 (< |old(~m_st~0)| 2)) (.cse8 (= 1 ~E_1~0)) (.cse13 (and .cse21 .cse20)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~local~0 ~token~0)) (.cse14 (not .cse3)) (.cse2 (< ~token~0 ~local~0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= ~T1_E~0 1)) (.cse9 (< ~E_M~0 2)) (.cse10 (= 0 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12) (or (not (= 1 ~E_M~0)) .cse0 .cse13 .cse14 .cse15 .cse4 .cse5 .cse7 .cse16 .cse8 .cse10 .cse11 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse9 .cse10 .cse11 .cse12) (or .cse7 .cse0 .cse8 .cse20 .cse10 (= 0 ~E_M~0) .cse15 .cse4 .cse12) (or .cse0 .cse14 .cse15 .cse4 .cse7 .cse13 .cse16 .cse8 .cse9 .cse10 .cse11 .cse17 .cse18) (or .cse0 .cse1 .cse14 .cse2 .cse15 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse18) (or .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse7 .cse21 .cse9 .cse10 .cse11 .cse18))))) [2018-10-26 21:08:47,676 INFO L421 ceAbstractionStarter]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse14 (= 0 ~t1_st~0))) (let ((.cse3 (= ~t1_pc~0 1)) (.cse8 (= ~T1_E~0 1)) (.cse24 (not (= ~m_pc~0 1))) (.cse0 (= ~T1_E~0 0)) (.cse23 (not .cse14)) (.cse22 (<= 2 ~m_st~0)) (.cse25 (+ ~local~0 1)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse7 (not .cse20)) (.cse13 (= 1 ~m_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse18 (< ~token~0 .cse25)) (.cse19 (< .cse25 ~token~0)) (.cse17 (and .cse23 .cse22)) (.cse16 (< |old(~m_st~0)| 2)) (.cse9 (= 1 ~E_1~0)) (.cse21 (and (= 1 ~t1_pc~0) (not .cse8) .cse22 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) .cse24 (not .cse0) (not (= ~E_1~0 0)))) (.cse1 (< ~local~0 ~token~0)) (.cse15 (not .cse3)) (.cse2 (< ~token~0 ~local~0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse10 (< ~E_M~0 2)) (.cse11 (= 0 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |old(~m_st~0)|)) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse15 .cse16 .cse5 .cse17 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse19 .cse20 .cse21) (or .cse8 .cse0 .cse9 .cse22 .cse11 (= 0 ~E_M~0) .cse16 .cse5 .cse13) (or (not (= 1 ~E_M~0)) (and .cse23 .cse4) .cse0 .cse17 .cse15 .cse16 .cse5 .cse6 .cse8 .cse18 .cse9 .cse24 .cse11 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse15 .cse2 .cse17 .cse16 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse21) (or .cse0 .cse1 .cse15 .cse2 .cse5 .cse6 .cse8 .cse23 .cse10 .cse11 .cse12 .cse20))))) [2018-10-26 21:08:47,676 INFO L425 ceAbstractionStarter]: For program point L307-1(line 307) no Hoare annotation was computed. [2018-10-26 21:08:47,676 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse19 (= 0 ~t1_st~0))) (let ((.cse3 (= ~t1_pc~0 1)) (.cse21 (not .cse19)) (.cse20 (<= 2 ~m_st~0)) (.cse22 (+ ~local~0 1)) (.cse18 (= |old(~t1_st~0)| 0))) (let ((.cse6 (not .cse18)) (.cse12 (= 1 ~m_pc~0)) (.cse16 (< ~token~0 .cse22)) (.cse17 (< .cse22 ~token~0)) (.cse15 (< |old(~m_st~0)| 2)) (.cse8 (= 1 ~E_1~0)) (.cse13 (and .cse21 .cse20)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~local~0 ~token~0)) (.cse14 (not .cse3)) (.cse2 (< ~token~0 ~local~0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= ~T1_E~0 1)) (.cse9 (< ~E_M~0 2)) (.cse10 (= 0 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12) (or (not (= 1 ~E_M~0)) .cse0 .cse13 .cse14 .cse15 .cse4 .cse5 .cse7 .cse16 .cse8 .cse10 .cse11 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse9 .cse10 .cse11 .cse12) (or .cse7 .cse0 .cse8 .cse20 .cse10 (= 0 ~E_M~0) .cse15 .cse4 .cse12) (or .cse0 .cse14 .cse15 .cse4 .cse7 .cse13 .cse16 .cse8 .cse9 .cse10 .cse11 .cse17 .cse18) (or .cse0 .cse1 .cse14 .cse2 .cse15 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse18) (or .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse7 .cse21 .cse9 .cse10 .cse11 .cse18))))) [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2018-10-26 21:08:47,677 INFO L421 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1)) (.cse13 (= ~t1_st~0 0))) (let ((.cse3 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse15 (not .cse13)) (.cse14 (= 1 ~m_pc~0)) (.cse2 (= ~T1_E~0 0)) (.cse4 (not .cse16)) (.cse1 (= exists_runnable_thread_~__retres1~2 1)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= 0 ~m_st~0))) (.cse10 (= 1 ~E_1~0)) (.cse0 (< ~E_M~0 2)) (.cse11 (= 0 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (or .cse2 .cse3 .cse5 (< ~m_st~0 2) .cse6 .cse7 .cse15 .cse8 .cse1 .cse10 .cse0 .cse11 .cse12) (or .cse2 .cse3 .cse5 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 .cse1 .cse14) (let ((.cse17 (+ ~local~0 1))) (or .cse2 .cse4 .cse1 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse17) .cse10 .cse0 .cse11 .cse12 (< .cse17 ~token~0) .cse13))))) [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2018-10-26 21:08:47,677 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2018-10-26 21:08:47,677 INFO L428 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2018-10-26 21:08:47,677 INFO L421 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1)) (.cse19 (+ ~local~0 1))) (let ((.cse7 (= 1 ~m_pc~0)) (.cse15 (not (= 1 ~E_M~0))) (.cse11 (= 1 ~M_E~0)) (.cse17 (< ~token~0 .cse19)) (.cse18 (< .cse19 ~token~0)) (.cse1 (= ~T1_E~0 0)) (.cse8 (< ~local~0 ~token~0)) (.cse16 (not .cse10)) (.cse9 (< ~token~0 ~local~0)) (.cse5 (< ~m_st~0 2)) (.cse6 (= 0 ~M_E~0)) (.cse0 (= ~T1_E~0 1)) (.cse2 (= 1 ~E_1~0)) (.cse13 (< ~E_M~0 2)) (.cse4 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse12 (= ~t1_st~0 0)) (.cse3 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~E_M~0) .cse5 .cse6 .cse7) (or .cse3 .cse1 .cse8 .cse9 .cse10 .cse6 .cse11 (not .cse12) .cse0 .cse13 .cse4 .cse14 .cse7) (or .cse15 .cse1 .cse16 .cse6 .cse11 .cse3 .cse0 (not (= 0 ~m_st~0)) .cse17 .cse2 .cse4 .cse14 .cse18 .cse12) (or .cse15 .cse1 .cse3 .cse16 .cse5 .cse6 .cse11 .cse0 .cse17 .cse2 .cse4 .cse14 .cse18 .cse12) (or .cse1 .cse8 .cse16 .cse9 .cse2 .cse6 .cse11 .cse0 .cse3 .cse13 .cse4 .cse14 .cse12) (or .cse1 .cse16 .cse5 .cse6 .cse0 .cse17 .cse2 .cse13 .cse4 .cse14 .cse18 .cse12 .cse3) (or .cse1 .cse8 .cse16 .cse9 .cse5 .cse6 .cse0 .cse2 .cse13 .cse4 .cse14 .cse12 .cse3)))) [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2018-10-26 21:08:47,677 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1))) (let ((.cse9 (not .cse16)) (.cse5 (< ~m_st~0 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse14 (< ~local~0 ~token~0)) (.cse15 (< ~token~0 ~local~0)) (.cse3 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0))) (.cse6 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~M_E~0)|)) (.cse13 (= ~t1_st~0 0)) (.cse0 (= |old(~T1_E~0)| 1)) (.cse2 (= 1 |old(~E_1~0)|)) (.cse11 (< |old(~E_M~0)| 2)) (.cse4 (= 0 |old(~E_1~0)|)) (.cse12 (not (= 1 ~t1_i~0))) (.cse7 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |old(~E_M~0)|) .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~local~0 1))) (or .cse1 .cse9 .cse5 .cse6 .cse8 .cse0 .cse3 (< ~token~0 .cse10) .cse2 .cse11 .cse4 .cse12 (< .cse10 ~token~0) .cse13)) (or .cse1 .cse14 .cse9 .cse15 .cse5 .cse6 .cse8 .cse3 .cse0 .cse2 .cse11 .cse4 .cse12 .cse13) (or .cse1 .cse14 .cse15 .cse16 .cse3 .cse6 .cse8 (not .cse13) .cse0 (not (= 0 ~m_st~0)) .cse2 .cse11 .cse4 .cse12 .cse7)))) [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2018-10-26 21:08:47,678 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (= ~T1_E~0 0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (and (= ~m_st~0 0) (= 0 ~t1_st~0)) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (= 1 ~E_1~0) (< ~E_M~0 2) (= 0 ~E_1~0) (not (= 1 ~t1_i~0)) (= 1 ~m_pc~0)) [2018-10-26 21:08:47,678 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2018-10-26 21:08:47,679 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-10-26 21:08:47,679 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2018-10-26 21:08:47,679 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2018-10-26 21:08:47,679 INFO L425 ceAbstractionStarter]: For program point L468(line 468) no Hoare annotation was computed. [2018-10-26 21:08:47,679 INFO L421 ceAbstractionStarter]: At program point L467(line 467) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-10-26 21:08:47,679 INFO L421 ceAbstractionStarter]: At program point L467-1(line 467) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= ~t1_i~0 1) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-10-26 21:08:47,679 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-10-26 21:08:47,679 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-10-26 21:08:47,679 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-10-26 21:08:47,679 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-10-26 21:08:47,680 INFO L425 ceAbstractionStarter]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2018-10-26 21:08:47,680 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-26 21:08:47,680 INFO L421 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse6 (= 1 |old(~m_pc~0)|)) (.cse1 (= ~T1_E~0 0)) (.cse4 (not .cse11)) (.cse5 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 1)) (.cse2 (= 1 |old(~E_1~0)|)) (.cse8 (< ~E_M~0 2)) (.cse3 (= 0 |old(~E_1~0)|)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= |old(~t1_st~0)| 0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10) (or .cse1 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse11 .cse5 .cse7 (not .cse10) .cse0 .cse2 .cse8 .cse3 .cse9 .cse6) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse1 (let ((.cse12 (+ ~local~0 1))) (and (<= ~token~0 .cse12) (= |old(~E_1~0)| ~E_1~0) (not (= 0 ~t1_st~0)) (= ~token~0 |old(~token~0)|) (<= .cse12 ~token~0))) .cse4 .cse5 .cse7 .cse0 (< |old(~token~0)| .cse13) .cse2 .cse8 .cse3 .cse9 (< .cse13 |old(~token~0)|) .cse10))))) [2018-10-26 21:08:47,680 INFO L421 ceAbstractionStarter]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1)) (.cse10 (= ~T1_E~0 1)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (not (= ~E_1~0 1))) (.cse5 (= ~T1_E~0 0)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (not (= ~E_1~0 0))) (.cse4 (<= ~local~0 ~token~0))) (let ((.cse16 (and (= 1 ~t1_pc~0) (not .cse10) (not (= ~M_E~0 0)) .cse0 .cse1 (not .cse5) (not (= ~M_E~0 1)) .cse2 .cse3 .cse4)) (.cse11 (= 1 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse17 (not .cse6)) (.cse7 (= 0 ~M_E~0)) (.cse15 (= 1 |old(~m_pc~0)|)) (.cse8 (= 1 ~M_E~0)) (.cse12 (< ~E_M~0 2)) (.cse14 (not (= 1 ~t1_i~0))) (.cse9 (= |old(~t1_st~0)| 0))) (and (or (and .cse0 (= 0 ~t1_st~0) .cse1 .cse2 .cse3 .cse4) .cse5 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse18 (+ |old(~local~0)| 1))) (or .cse5 .cse16 .cse17 .cse7 .cse8 .cse10 (< |old(~token~0)| .cse18) .cse11 .cse12 .cse13 .cse14 (< .cse18 |old(~token~0)|) .cse9)) (or .cse16 (or .cse10 .cse5 .cse11 .cse13 .cse17 .cse7 .cse15 .cse8) .cse12 .cse14 .cse9)))) [2018-10-26 21:08:47,680 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse12)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse4 (= ~T1_E~0 1)) (.cse6 (= 1 |old(~E_1~0)|)) (.cse7 (< ~E_M~0 2)) (.cse8 (= 0 |old(~E_1~0)|)) (.cse9 (not (= 1 ~t1_i~0))) (.cse11 (= 1 |old(~m_pc~0)|))) (and (let ((.cse5 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< |old(~token~0)| .cse5) .cse6 .cse7 .cse8 .cse9 (< .cse5 |old(~token~0)|) .cse10)) (or (or .cse4 .cse0 .cse6 .cse8 .cse1 .cse2 .cse11 .cse3) .cse7 .cse9 .cse10) (or .cse0 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse12 .cse2 .cse3 (not .cse10) .cse4 .cse6 .cse7 .cse8 .cse9 .cse11)))) [2018-10-26 21:08:47,680 INFO L421 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse16 (= 0 ~t1_st~0))) (let ((.cse9 (= ~T1_E~0 1)) (.cse2 (= |old(~E_1~0)| ~E_1~0)) (.cse3 (not .cse16)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse17 (not (= ~m_pc~0 1))) (.cse0 (= ~T1_E~0 0)) (.cse18 (= ~t1_pc~0 1))) (let ((.cse11 (= 1 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse6 (not .cse18)) (.cse7 (= 0 ~M_E~0)) (.cse19 (= 1 |old(~m_pc~0)|)) (.cse8 (= 1 ~M_E~0)) (.cse12 (< ~E_M~0 2)) (.cse5 (and (= 1 ~t1_pc~0) (not .cse9) .cse2 .cse3 .cse4 (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) .cse17 (<= 2 ~E_M~0) (not .cse0) (not (= ~M_E~0 1)) (not (= ~E_1~0 0)))) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= |old(~t1_st~0)| 0))) (and (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 (let ((.cse1 (+ ~local~0 1))) (and (<= ~token~0 .cse1) .cse2 .cse3 .cse4 (<= .cse1 ~token~0))) .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse10) .cse11 .cse12 .cse13 .cse14 (< .cse10 |old(~token~0)|) .cse15)) (or (and .cse2 .cse4 .cse16 .cse17 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse0 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse18 .cse7 .cse8 (not .cse15) .cse9 .cse11 .cse12 .cse13 .cse14 .cse19) (or (or .cse9 .cse0 .cse11 .cse13 .cse6 .cse7 .cse19 .cse8) .cse12 .cse5 .cse14 .cse15))))) [2018-10-26 21:08:47,681 INFO L421 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (let ((.cse18 (= 0 ~t1_st~0)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse4 (not .cse17)) (.cse11 (not .cse18)) (.cse1 (= ~T1_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse0 (= ~T1_E~0 1)) (.cse2 (= 1 |old(~E_1~0)|)) (.cse12 (not (= ~m_pc~0 1))) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (not (= ~E_1~0 0))) (.cse15 (<= ~local~0 ~token~0)) (.cse8 (< ~E_M~0 2)) (.cse3 (= 0 |old(~E_1~0)|)) (.cse9 (not (= 1 ~t1_i~0))) (.cse6 (= 1 |old(~m_pc~0)|))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15)) (let ((.cse16 (+ |old(~local~0)| 1))) (or .cse1 .cse4 (and .cse11 .cse13 .cse14 .cse15) .cse5 .cse7 .cse0 (< |old(~token~0)| .cse16) .cse2 .cse8 .cse3 .cse9 (< .cse16 |old(~token~0)|) .cse10)) (or .cse1 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse17 .cse5 .cse7 (not .cse10) .cse0 .cse2 (and .cse18 .cse12 .cse13 .cse14 .cse15) .cse8 .cse3 .cse9 .cse6)))) [2018-10-26 21:08:47,681 INFO L425 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-10-26 21:08:47,681 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 66) no Hoare annotation was computed. [2018-10-26 21:08:47,681 INFO L421 ceAbstractionStarter]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1)) (.cse2 (= 0 ~t1_st~0))) (let ((.cse14 (= 1 |old(~m_pc~0)|)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~T1_E~0 0)) (.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse16 (not .cse2)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse15 (not .cse5)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= ~T1_E~0 1)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (< ~E_M~0 2)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse8 (= |old(~t1_st~0)| 0))) (and (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse4 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse5 .cse6 .cse7 (not .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (or .cse9 .cse4 .cse10 .cse12 .cse15 .cse6 .cse14 .cse7) .cse11 (and .cse0 .cse16 .cse1 .cse3) .cse13 .cse8) (let ((.cse18 (+ |old(~local~0)| 1))) (or .cse4 (let ((.cse17 (+ ~local~0 1))) (and (<= ~token~0 .cse17) .cse0 .cse16 .cse1 (<= .cse17 ~token~0))) .cse15 .cse6 .cse7 .cse9 (< |old(~token~0)| .cse18) .cse10 .cse11 .cse12 .cse13 (< .cse18 |old(~token~0)|) .cse8))))) [2018-10-26 21:08:47,681 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-10-26 21:08:47,681 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2018-10-26 21:08:47,681 INFO L421 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse8 (< ~E_M~0 2)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= ~t1_st~0 0)) (.cse6 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse7 (= 1 ~E_1~0)) (.cse5 (= |old(~M_E~0)| ~M_E~0)) (.cse9 (= 0 ~E_1~0)) (.cse2 (< ~m_st~0 2)) (.cse3 (= 0 |old(~M_E~0)|)) (.cse4 (= 1 |old(~M_E~0)|))) (and (or .cse0 (< ~local~0 ~token~0) .cse1 (< ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 (< ~token~0 .cse12) .cse7 .cse8 .cse9 .cse10 (< .cse12 ~token~0) .cse11)) (or .cse6 .cse0 .cse7 .cse5 .cse9 (= 0 ~E_M~0) .cse2 .cse3 (= 1 ~m_pc~0) .cse4))) [2018-10-26 21:08:47,681 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2018-10-26 21:08:47,681 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:08:47,682 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0)) [2018-10-26 21:08:47,682 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:08:47,682 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse7 (= 0 ~t1_st~0)) (.cse3 (= |old(~t1_pc~0)| 1))) (let ((.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (< |old(~token~0)| |old(~local~0)|)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse21 (not .cse3)) (.cse23 (= 1 ~t1_pc~0)) (.cse24 (not .cse7)) (.cse6 (= ~token~0 |old(~token~0)|)) (.cse17 (< |old(~E_M~0)| 2)) (.cse19 (not (= 1 ~t1_i~0))) (.cse14 (= |old(~t1_st~0)| 0)) (.cse15 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse16 (= 1 |old(~E_1~0)|)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~E_1~0)| ~E_1~0)) (.cse25 (<= 2 ~m_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse11 (= |old(~E_M~0)| ~E_M~0)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse26 (= 0 |old(~E_M~0)|)) (.cse22 (< |old(~m_st~0)| 2)) (.cse12 (= 0 ~M_E~0)) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse13 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 (not .cse14) .cse15 (not (= 0 |old(~m_st~0)|)) .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse12 .cse13 (and .cse23 .cse5 .cse24 .cse6 .cse25 .cse9 .cse10 .cse11) .cse15 .cse16 .cse17 .cse18 .cse19 .cse14) (or .cse15 .cse0 .cse16 .cse18 .cse21 .cse26 (and .cse23 .cse5 .cse25 .cse8 .cse11) .cse22 .cse12 .cse20 .cse13) (let ((.cse28 (+ |old(~local~0)| 1))) (or .cse0 .cse21 .cse22 .cse12 .cse13 .cse15 (let ((.cse27 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse27) .cse5 .cse24 .cse6 .cse25 (<= .cse27 ~token~0) .cse11)) (< |old(~token~0)| .cse28) .cse16 .cse17 .cse18 .cse19 (< .cse28 |old(~token~0)|) .cse14)) (or .cse15 .cse0 .cse16 (and .cse4 .cse5 .cse25 .cse8 .cse11) .cse18 .cse26 .cse3 .cse22 .cse12 .cse20 .cse13)))) [2018-10-26 21:08:47,682 INFO L425 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2018-10-26 21:08:47,682 INFO L425 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2018-10-26 21:08:47,682 INFO L425 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2018-10-26 21:08:47,682 INFO L425 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-10-26 21:08:47,683 INFO L421 ceAbstractionStarter]: At program point L201(line 201) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse31 (= 0 ~t1_st~0)) (.cse36 (+ ~local~0 1)) (.cse17 (= ~T1_E~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse37 (not (= ~M_E~0 1))) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_1~0 1))) (.cse25 (not (= ~m_pc~0 1))) (.cse35 (= |old(~t1_pc~0)| 1))) (let ((.cse11 (not .cse35)) (.cse23 (= 0 |old(~E_M~0)|)) (.cse13 (< |old(~m_st~0)| 2)) (.cse10 (< |old(~local~0)| |old(~token~0)|)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse22 (= |old(~t1_st~0)| 0)) (.cse16 (and .cse1 .cse2 .cse37 .cse6 .cse7 .cse25)) (.cse18 (= 1 |old(~E_1~0)|)) (.cse24 (and (not (= ~t1_pc~0 1)) (not .cse17) .cse2 .cse37 .cse7)) (.cse19 (< |old(~E_M~0)| 2)) (.cse21 (not (= 1 ~t1_i~0))) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse20 (= 0 |old(~E_1~0)|)) (.cse28 (<= ~token~0 .cse36)) (.cse3 (not .cse31)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse29 (<= .cse36 ~token~0)) (.cse26 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse16 .cse17 .cse0 .cse18 .cse20 .cse23 .cse13 (and .cse24 .cse6 .cse25) .cse14 .cse26 .cse15) (let ((.cse27 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~token~0)| .cse27) .cse18 .cse19 .cse20 .cse21 (< .cse27 |old(~token~0)|) .cse22 (and (and .cse1 .cse28 .cse2 .cse3 .cse4 .cse29 .cse6 .cse7) .cse9))) (or .cse16 .cse17 .cse0 .cse18 .cse20 .cse11 .cse23 .cse13 .cse14 .cse26 .cse15) (let ((.cse34 (not (= 0 eval_~tmp~0))) (.cse33 (<= 2 ~E_M~0)) (.cse32 (= eval_~tmp~0 1)) (.cse30 (= ~m_st~0 0))) (or .cse0 .cse10 (and (and .cse4 .cse24 .cse30 .cse5 .cse31 .cse8 .cse25) .cse9) .cse14 .cse15 (not .cse22) .cse16 .cse18 (and .cse24 .cse5 .cse6 .cse31 .cse32 .cse9 .cse8) .cse19 .cse21 (and .cse33 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse34 .cse8)) (and .cse33 .cse1 .cse2 .cse5 .cse6 .cse32 .cse7 .cse8) .cse12 .cse35 (and .cse33 (and .cse1 .cse28 .cse2 .cse3 .cse29 .cse6 .cse7 .cse34)) .cse17 (not (= 0 |old(~m_st~0)|)) (and .cse9 (and .cse1 .cse2 .cse3 .cse4 .cse30 .cse5 .cse7 .cse8 .cse25)) .cse20 (and .cse33 (or (and .cse1 .cse28 .cse2 .cse3 .cse30 .cse29 .cse32 .cse7) (and .cse1 .cse28 .cse2 .cse3 .cse4 .cse30 .cse29 .cse7))) .cse26)))))) [2018-10-26 21:08:47,683 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (let ((.cse7 (= ~T1_E~0 0))) (let ((.cse10 (= |old(~t1_pc~0)| 1)) (.cse16 (= 1 ~t1_pc~0)) (.cse18 (<= 2 ~m_st~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse15 (= ~T1_E~0 1)) (.cse17 (and (not .cse7) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse29 (not (= ~M_E~0 1))) (.cse19 (not (= ~E_1~0 1)))) (let ((.cse1 (and (not (= ~t1_pc~0 1)) (not .cse15) .cse17 .cse29 .cse19)) (.cse8 (< |old(~local~0)| |old(~token~0)|)) (.cse9 (< |old(~token~0)| |old(~local~0)|)) (.cse21 (< |old(~E_M~0)| 2)) (.cse23 (not (= 1 ~t1_i~0))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse14 (and .cse16 .cse17 .cse29 .cse18 .cse19 .cse6)) (.cse20 (= 1 |old(~E_1~0)|)) (.cse22 (= 0 |old(~E_1~0)|)) (.cse27 (not .cse10)) (.cse25 (= 0 |old(~E_M~0)|)) (.cse26 (< |old(~m_st~0)| 2)) (.cse11 (= 0 ~M_E~0)) (.cse24 (= 1 |old(~m_pc~0)|)) (.cse12 (= 1 ~M_E~0))) (and (let ((.cse0 (not (= 0 ~t1_st~0))) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (= eval_~tmp~0 1)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (<= ~local~0 ~token~0))) (or (and .cse0 (= ~token~0 |old(~token~0)|) .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse13) .cse14 .cse15 (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~E_M~0) .cse16 .cse17 .cse0 .cse2 .cse18 .cse3 .cse19 .cse5) .cse20 .cse21 .cse22 .cse23 (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5) .cse24)) (or .cse14 .cse15 .cse7 .cse20 .cse22 .cse25 .cse26 (and .cse1 .cse18 .cse6) .cse11 .cse24 .cse12) (let ((.cse28 (+ |old(~local~0)| 1))) (or .cse7 .cse27 .cse26 .cse11 .cse12 .cse14 .cse15 (< |old(~token~0)| .cse28) .cse20 .cse21 .cse22 .cse23 (< .cse28 |old(~token~0)|) .cse13)) (or .cse7 .cse8 .cse27 .cse9 .cse26 .cse11 .cse12 .cse14 .cse15 .cse20 .cse21 .cse22 .cse23 .cse13) (or .cse14 .cse15 .cse7 .cse20 .cse22 .cse27 .cse25 .cse26 .cse11 .cse24 .cse12))))) [2018-10-26 21:08:47,683 INFO L421 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse31 (= 0 ~t1_st~0)) (.cse36 (+ ~local~0 1)) (.cse17 (= ~T1_E~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse37 (not (= ~M_E~0 1))) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_1~0 1))) (.cse25 (not (= ~m_pc~0 1))) (.cse35 (= |old(~t1_pc~0)| 1))) (let ((.cse11 (not .cse35)) (.cse23 (= 0 |old(~E_M~0)|)) (.cse13 (< |old(~m_st~0)| 2)) (.cse10 (< |old(~local~0)| |old(~token~0)|)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse22 (= |old(~t1_st~0)| 0)) (.cse16 (and .cse1 .cse2 .cse37 .cse6 .cse7 .cse25)) (.cse18 (= 1 |old(~E_1~0)|)) (.cse24 (and (not (= ~t1_pc~0 1)) (not .cse17) .cse2 .cse37 .cse7)) (.cse19 (< |old(~E_M~0)| 2)) (.cse21 (not (= 1 ~t1_i~0))) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse20 (= 0 |old(~E_1~0)|)) (.cse28 (<= ~token~0 .cse36)) (.cse3 (not .cse31)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse29 (<= .cse36 ~token~0)) (.cse26 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse16 .cse17 .cse0 .cse18 .cse20 .cse23 .cse13 (and .cse24 .cse6 .cse25) .cse14 .cse26 .cse15) (let ((.cse27 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~token~0)| .cse27) .cse18 .cse19 .cse20 .cse21 (< .cse27 |old(~token~0)|) .cse22 (and (and .cse1 .cse28 .cse2 .cse3 .cse4 .cse29 .cse6 .cse7) .cse9))) (or .cse16 .cse17 .cse0 .cse18 .cse20 .cse11 .cse23 .cse13 .cse14 .cse26 .cse15) (let ((.cse34 (not (= 0 eval_~tmp~0))) (.cse33 (<= 2 ~E_M~0)) (.cse32 (= eval_~tmp~0 1)) (.cse30 (= ~m_st~0 0))) (or .cse0 .cse10 (and (and .cse4 .cse24 .cse30 .cse5 .cse31 .cse8 .cse25) .cse9) .cse14 .cse15 (not .cse22) .cse16 .cse18 (and .cse24 .cse5 .cse6 .cse31 .cse32 .cse9 .cse8) .cse19 .cse21 (and .cse33 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse34 .cse8)) (and .cse33 .cse1 .cse2 .cse5 .cse6 .cse32 .cse7 .cse8) .cse12 .cse35 (and .cse33 (and .cse1 .cse28 .cse2 .cse3 .cse29 .cse6 .cse7 .cse34)) .cse17 (not (= 0 |old(~m_st~0)|)) (and .cse9 (and .cse1 .cse2 .cse3 .cse4 .cse30 .cse5 .cse7 .cse8 .cse25)) .cse20 (and .cse33 (or (and .cse1 .cse28 .cse2 .cse3 .cse30 .cse29 .cse32 .cse7) (and .cse1 .cse28 .cse2 .cse3 .cse4 .cse30 .cse29 .cse7))) .cse26)))))) [2018-10-26 21:08:47,683 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2018-10-26 21:08:47,684 INFO L421 ceAbstractionStarter]: At program point L216(line 216) the Hoare annotation is: (let ((.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse1 (not .cse15)) (.cse2 (< |old(~m_st~0)| 2)) (.cse13 (< |old(~local~0)| |old(~token~0)|)) (.cse14 (< |old(~token~0)| |old(~local~0)|)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse5 (= ~T1_E~0 1)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse8 (< |old(~E_M~0)| 2)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse12 (= 1 |old(~m_pc~0)|)) (.cse0 (= ~T1_E~0 0))) (and (let ((.cse6 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< |old(~token~0)| .cse6) .cse7 .cse8 .cse9 .cse10 (< .cse6 |old(~token~0)|) .cse11)) (or .cse5 .cse0 .cse7 .cse9 (= 0 |old(~E_M~0)|) .cse2 .cse3 .cse12 .cse4) (or .cse0 .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse18 (= 0 ~t1_st~0))) (let ((.cse21 (not (= ~m_pc~0 1))) (.cse20 (= ~E_M~0 |old(~E_M~0)|)) (.cse23 (not .cse18)) (.cse22 (= 1 ~t1_pc~0)) (.cse16 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse17 (not (= ~E_1~0 1))) (.cse19 (= eval_~tmp~0 1))) (or .cse0 .cse13 .cse14 .cse15 (and (= ~token~0 |old(~token~0)|) (and (not (= ~t1_pc~0 1)) .cse16 .cse17) (<= ~token~0 ~local~0) .cse18 .cse19 .cse20 (<= ~local~0 ~token~0) .cse21) (and (and .cse22 .cse16 .cse17 .cse21) .cse23 .cse19 .cse20) .cse3 .cse4 (not .cse11) (and (<= 2 ~E_M~0) .cse23 (let ((.cse24 (+ ~local~0 1))) (and .cse22 (<= ~token~0 .cse24) .cse16 (<= .cse24 ~token~0) .cse17)) .cse19) .cse5 (not (= 0 |old(~m_st~0)|)) .cse7 .cse8 .cse9 .cse10 .cse12)))))) [2018-10-26 21:08:47,684 INFO L425 ceAbstractionStarter]: For program point L210(lines 200 238) no Hoare annotation was computed. [2018-10-26 21:08:47,684 INFO L421 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse27 (= |old(~t1_pc~0)| 1)) (.cse7 (= 1 ~t1_pc~0)) (.cse9 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse12 (<= 2 ~m_st~0)) (.cse13 (not (= ~E_1~0 1))) (.cse30 (not (= ~m_pc~0 1))) (.cse31 (+ ~local~0 1))) (let ((.cse11 (= ~token~0 |old(~token~0)|)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse8 (<= ~token~0 .cse31)) (.cse14 (<= .cse31 ~token~0)) (.cse22 (< |old(~local~0)| |old(~token~0)|)) (.cse23 (< |old(~token~0)| |old(~local~0)|)) (.cse21 (= |old(~t1_st~0)| 0)) (.cse18 (< |old(~E_M~0)| 2)) (.cse10 (not (= 0 ~t1_st~0))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse5 (and .cse7 .cse9 (not (= ~M_E~0 1)) .cse12 .cse13 .cse30)) (.cse6 (= ~T1_E~0 1)) (.cse17 (= 1 |old(~E_1~0)|)) (.cse19 (= 0 |old(~E_1~0)|)) (.cse1 (not .cse27)) (.cse29 (= 0 |old(~E_M~0)|)) (.cse2 (< |old(~m_st~0)| 2)) (.cse3 (= 0 ~M_E~0)) (.cse28 (= 1 |old(~m_pc~0)|)) (.cse4 (= 1 ~M_E~0))) (and (let ((.cse16 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< |old(~token~0)| .cse16) .cse17 .cse18 .cse19 .cse20 (< .cse16 |old(~token~0)|) .cse21)) (or .cse0 .cse22 .cse1 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse18 .cse19 .cse20 (and .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse15 .cse25) .cse21) (let ((.cse26 (<= 2 ~E_M~0))) (or .cse0 (and .cse26 .cse7 .cse8 .cse9 .cse10 .cse14 .cse12 .cse13) .cse22 .cse23 .cse27 .cse3 .cse4 (not .cse21) .cse5 .cse6 (not (= 0 |old(~m_st~0)|)) .cse17 .cse18 (and .cse26 .cse7 .cse9 .cse10 .cse24 .cse12 .cse13 .cse25) .cse19 .cse20 .cse28)) (or .cse6 .cse0 .cse17 .cse19 .cse29 .cse2 (and (and .cse9 .cse13) .cse12 .cse30) .cse3 .cse28 .cse4) (or .cse5 .cse6 .cse0 .cse17 .cse19 .cse1 .cse29 .cse2 .cse3 .cse28 .cse4))))) [2018-10-26 21:08:47,684 INFO L425 ceAbstractionStarter]: For program point L200-1(lines 200 238) no Hoare annotation was computed. [2018-10-26 21:08:47,684 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2018-10-26 21:08:47,684 INFO L428 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: true [2018-10-26 21:08:47,684 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2018-10-26 21:08:47,684 INFO L428 ceAbstractionStarter]: At program point L390(line 390) the Hoare annotation is: true [2018-10-26 21:08:47,684 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point L390-1(line 390) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L428 ceAbstractionStarter]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2018-10-26 21:08:47,685 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1))) (let ((.cse9 (not .cse16)) (.cse5 (< ~m_st~0 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse14 (< ~local~0 ~token~0)) (.cse15 (< ~token~0 ~local~0)) (.cse3 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0))) (.cse6 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~M_E~0)|)) (.cse13 (= ~t1_st~0 0)) (.cse0 (= |old(~T1_E~0)| 1)) (.cse2 (= 1 |old(~E_1~0)|)) (.cse11 (< |old(~E_M~0)| 2)) (.cse4 (= 0 |old(~E_1~0)|)) (.cse12 (not (= 1 ~t1_i~0))) (.cse7 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |old(~E_M~0)|) .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~local~0 1))) (or .cse1 .cse9 .cse5 .cse6 .cse8 .cse0 .cse3 (< ~token~0 .cse10) .cse2 .cse11 .cse4 .cse12 (< .cse10 ~token~0) .cse13)) (or .cse1 .cse14 .cse9 .cse15 .cse5 .cse6 .cse8 .cse3 .cse0 .cse2 .cse11 .cse4 .cse12 .cse13) (or .cse1 .cse14 .cse15 .cse16 .cse3 .cse6 .cse8 (not .cse13) .cse0 (not (= 0 ~m_st~0)) .cse2 .cse11 .cse4 .cse12 .cse7)))) [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2018-10-26 21:08:47,685 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-26 21:08:47,686 INFO L421 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= |old(~M_E~0)| ~M_E~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= 0 ~t1_st~0) .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|))) [2018-10-26 21:08:47,686 INFO L421 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)) [2018-10-26 21:08:47,686 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2018-10-26 21:08:47,686 INFO L421 ceAbstractionStarter]: At program point L411-1(line 411) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)) [2018-10-26 21:08:47,686 INFO L421 ceAbstractionStarter]: At program point L440(line 440) the Hoare annotation is: (let ((.cse2 (not (= ~M_E~0 1))) (.cse3 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~E_1~0 1)))) (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (<= 2 ~m_st~0)) (.cse8 (and (and (= 1 ~t1_pc~0) .cse2 .cse3) .cse1 .cse4))) (or (and .cse0 (and .cse1 (and .cse2 .cse3) .cse4) (not (= ~m_pc~0 1))) (= |old(~T1_E~0)| 0) (let ((.cse6 (+ ~local~0 1))) (and .cse5 (<= ~token~0 .cse6) .cse7 (<= .cse6 ~token~0) .cse0 .cse8)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse5 .cse7 (<= ~token~0 ~local~0) .cse0 (<= ~local~0 ~token~0) .cse8) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,687 INFO L421 ceAbstractionStarter]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse7 (not (= ~E_1~0 1)))) (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (and (= 1 ~t1_pc~0) (not (= ~T1_E~0 1)) .cse5 .cse6 .cse7)) (.cse2 (not (= 0 ~t1_st~0))) (.cse3 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (let ((.cse4 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse4) .cse1 .cse2 (<= .cse4 ~token~0) .cse3)) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse6 .cse7) .cse3 (not (= ~m_pc~0 1))) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,687 INFO L421 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (let ((.cse2 (not (= ~M_E~0 1))) (.cse3 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~E_1~0 1)))) (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (<= 2 ~m_st~0)) (.cse8 (and (and (= 1 ~t1_pc~0) .cse2 .cse3) .cse1 .cse4))) (or (and .cse0 (and .cse1 (and .cse2 .cse3) .cse4) (not (= ~m_pc~0 1))) (= |old(~T1_E~0)| 0) (let ((.cse6 (+ ~local~0 1))) (and .cse5 (<= ~token~0 .cse6) .cse7 (<= .cse6 ~token~0) .cse0 .cse8)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse5 .cse7 (<= ~token~0 ~local~0) .cse0 (<= ~local~0 ~token~0) .cse8) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,687 INFO L421 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse2 (not (= ~M_E~0 1))) (.cse3 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~E_1~0 1)))) (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (<= 2 ~m_st~0)) (.cse8 (and (and (= 1 ~t1_pc~0) .cse2 .cse3) .cse1 .cse4))) (or (and .cse0 (and .cse1 (and .cse2 .cse3) .cse4) (not (= ~m_pc~0 1))) (= |old(~T1_E~0)| 0) (let ((.cse6 (+ ~local~0 1))) (and .cse5 (<= ~token~0 .cse6) .cse7 (<= .cse6 ~token~0) .cse0 .cse8)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse5 .cse7 (<= ~token~0 ~local~0) .cse0 (<= ~local~0 ~token~0) .cse8) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,687 INFO L421 ceAbstractionStarter]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse2 (not (= ~M_E~0 1))) (.cse3 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~E_1~0 1)))) (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (<= 2 ~m_st~0)) (.cse8 (and (and (= 1 ~t1_pc~0) .cse2 .cse3) .cse1 .cse4))) (or (and .cse0 (and .cse1 (and .cse2 .cse3) .cse4) (not (= ~m_pc~0 1))) (= |old(~T1_E~0)| 0) (let ((.cse6 (+ ~local~0 1))) (and .cse5 (<= ~token~0 .cse6) .cse7 (<= .cse6 ~token~0) .cse0 .cse8)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse5 .cse7 (<= ~token~0 ~local~0) .cse0 (<= ~local~0 ~token~0) .cse8) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,687 INFO L421 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse2 (not (= ~M_E~0 1))) (.cse3 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~E_1~0 1)))) (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (<= 2 ~m_st~0)) (.cse8 (and (and (= 1 ~t1_pc~0) .cse2 .cse3) .cse1 .cse4))) (or (and .cse0 (and .cse1 (and .cse2 .cse3) .cse4) (not (= ~m_pc~0 1))) (= |old(~T1_E~0)| 0) (let ((.cse6 (+ ~local~0 1))) (and .cse5 (<= ~token~0 .cse6) .cse7 (<= .cse6 ~token~0) .cse0 .cse8)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse5 .cse7 (<= ~token~0 ~local~0) .cse0 (<= ~local~0 ~token~0) .cse8) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,688 INFO L425 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-10-26 21:08:47,688 INFO L421 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse9 (= 0 ~t1_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse13 (not (= ~E_1~0 1)))) (let ((.cse1 (and .cse12 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse13)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_M~0)) (.cse5 (not .cse9)) (.cse7 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse6 (and (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse12 .cse13))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and .cse3 (<= ~token~0 .cse4) .cse5 (<= .cse4 ~token~0) .cse0 .cse6)) (and (and (= ~m_st~0 0) .cse7 .cse1 .cse8 .cse2) .cse9 (= ~E_M~0 |old(~E_M~0)|)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse6 .cse2) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse3 .cse5 .cse7 .cse0 .cse8 .cse6) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,688 INFO L425 ceAbstractionStarter]: For program point L422-1(line 422) no Hoare annotation was computed. [2018-10-26 21:08:47,688 INFO L425 ceAbstractionStarter]: For program point L418(lines 418 455) no Hoare annotation was computed. [2018-10-26 21:08:47,688 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)) [2018-10-26 21:08:47,688 INFO L421 ceAbstractionStarter]: At program point L418-2(lines 415 455) the Hoare annotation is: (let ((.cse9 (= 0 ~t1_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse13 (not (= ~E_1~0 1)))) (let ((.cse1 (and .cse12 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse13)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_M~0)) (.cse5 (not .cse9)) (.cse7 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse6 (and (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse12 .cse13))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and .cse3 (<= ~token~0 .cse4) .cse5 (<= .cse4 ~token~0) .cse0 .cse6)) (and (and (= ~m_st~0 0) .cse7 .cse1 .cse8 .cse2) .cse9 (= ~E_M~0 |old(~E_M~0)|)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse6 .cse2) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse3 .cse5 .cse7 .cse0 .cse8 .cse6) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,689 INFO L421 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= |old(~M_E~0)| ~M_E~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= 0 ~t1_st~0) .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|))) [2018-10-26 21:08:47,689 INFO L421 ceAbstractionStarter]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= |old(~M_E~0)| ~M_E~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (= 0 ~t1_st~0) .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|))) [2018-10-26 21:08:47,689 INFO L421 ceAbstractionStarter]: At program point L441(line 441) the Hoare annotation is: (let ((.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse7 (not (= ~E_1~0 1)))) (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (and (= 1 ~t1_pc~0) (not (= ~T1_E~0 1)) .cse5 .cse6 .cse7)) (.cse2 (not (= 0 ~t1_st~0))) (.cse3 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (let ((.cse4 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse4) .cse1 .cse2 (<= .cse4 ~token~0) .cse3)) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse6 .cse7) .cse3 (not (= ~m_pc~0 1))) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,689 INFO L425 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2018-10-26 21:08:47,701 INFO L421 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse2 (not (= ~M_E~0 1))) (.cse3 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~E_1~0 1)))) (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (<= 2 ~m_st~0)) (.cse8 (and (and (= 1 ~t1_pc~0) .cse2 .cse3) .cse1 .cse4))) (or (and .cse0 (and .cse1 (and .cse2 .cse3) .cse4) (not (= ~m_pc~0 1))) (= |old(~T1_E~0)| 0) (let ((.cse6 (+ ~local~0 1))) (and .cse5 (<= ~token~0 .cse6) .cse7 (<= .cse6 ~token~0) .cse0 .cse8)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse5 .cse7 (<= ~token~0 ~local~0) .cse0 (<= ~local~0 ~token~0) .cse8) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,701 INFO L425 ceAbstractionStarter]: For program point L435(line 435) no Hoare annotation was computed. [2018-10-26 21:08:47,702 INFO L421 ceAbstractionStarter]: At program point L431(line 431) the Hoare annotation is: (let ((.cse2 (not (= ~M_E~0 1))) (.cse3 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (not (= ~E_1~0 1)))) (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (<= 2 ~m_st~0)) (.cse8 (and (and (= 1 ~t1_pc~0) .cse2 .cse3) .cse1 .cse4))) (or (and .cse0 (and .cse1 (and .cse2 .cse3) .cse4) (not (= ~m_pc~0 1))) (= |old(~T1_E~0)| 0) (let ((.cse6 (+ ~local~0 1))) (and .cse5 (<= ~token~0 .cse6) .cse7 (<= .cse6 ~token~0) .cse0 .cse8)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse5 .cse7 (<= ~token~0 ~local~0) .cse0 (<= ~local~0 ~token~0) .cse8) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)))) [2018-10-26 21:08:47,702 INFO L421 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (= ~M_E~0 0)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 1 |old(~m_pc~0)|)) [2018-10-26 21:08:47,702 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-26 21:08:47,702 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2018-10-26 21:08:47,702 INFO L421 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse8 (= 1 ~E_1~0)) (.cse5 (< ~m_st~0 2)) (.cse14 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~local~0 ~token~0)) (.cse2 (not .cse15)) (.cse3 (< ~token~0 ~local~0)) (.cse6 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse7 (= ~T1_E~0 1)) (.cse9 (< ~E_M~0 2)) (.cse10 (= 0 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= ~t1_st~0 0)) (.cse4 (= 0 is_master_triggered_~__retres1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse2 .cse5 .cse6 .cse7 (< ~token~0 .cse13) .cse8 .cse9 .cse10 .cse11 .cse4 (< .cse13 ~token~0) .cse12)) (or .cse7 .cse0 .cse8 .cse10 (= 0 ~E_M~0) .cse4 .cse5 .cse6 .cse14) (or .cse0 .cse1 .cse3 .cse15 .cse6 .cse4 .cse16 (not .cse12) .cse7 .cse9 .cse10 .cse11 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse16 .cse7 .cse9 .cse10 .cse11 .cse12 .cse4)))) [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2018-10-26 21:08:47,704 INFO L428 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:08:47,704 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (not (= ~T1_E~0 1)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~M_E~0 0)) (= 0 ~t1_st~0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_M~0) (not (= ~T1_E~0 0)) (not (= ~M_E~0 1)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (<= ~local~0 ~token~0)) [2018-10-26 21:08:47,704 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2018-10-26 21:08:47,704 INFO L425 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2018-10-26 21:08:47,705 INFO L421 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse1 (= |old(~T1_E~0)| 0)) (.cse7 (not (= ~t1_pc~0 1))) (.cse5 (< ~m_st~0 2)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse0 (= |old(~T1_E~0)| 1)) (.cse2 (= 1 |old(~E_1~0)|)) (.cse9 (< |old(~E_M~0)| 2)) (.cse4 (= 0 |old(~E_1~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse3 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0))) (.cse11 (= ~t1_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |old(~E_M~0)|) .cse5 .cse6 (= 1 ~m_pc~0)) (let ((.cse8 (+ ~local~0 1))) (or .cse1 .cse7 .cse5 .cse6 .cse0 .cse3 (< ~token~0 .cse8) .cse2 .cse9 .cse4 .cse10 (< .cse8 ~token~0) .cse11)) (or .cse1 (< ~local~0 ~token~0) .cse7 (< ~token~0 ~local~0) .cse5 .cse6 .cse0 .cse2 .cse9 .cse4 .cse10 .cse3 .cse11))) [2018-10-26 21:08:47,705 INFO L425 ceAbstractionStarter]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2018-10-26 21:08:47,705 INFO L425 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2018-10-26 21:08:47,707 INFO L425 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2018-10-26 21:08:47,708 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2018-10-26 21:08:47,708 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2018-10-26 21:08:47,708 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: (or (= ~T1_E~0 0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (not (= ~t1_i~0 1)) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= ~t1_st~0 0)) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (= 1 ~E_1~0) (< ~E_M~0 2) (= 0 ~E_1~0) (= 1 ~m_pc~0)) [2018-10-26 21:08:47,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:08:47 BoogieIcfgContainer [2018-10-26 21:08:47,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:08:47,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:08:47,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:08:47,797 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:08:47,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:08:12" (3/4) ... [2018-10-26 21:08:47,800 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 21:08:47,809 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-10-26 21:08:47,809 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-10-26 21:08:47,809 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-10-26 21:08:47,809 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-10-26 21:08:47,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-10-26 21:08:47,811 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-10-26 21:08:47,811 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-10-26 21:08:47,811 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-10-26 21:08:47,811 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-10-26 21:08:47,825 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-10-26 21:08:47,826 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 21:08:47,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((2 <= m_st && (\old(T1_E) == T1_E && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) || \old(T1_E) == 0) || (((((2 <= E_M && token <= local + 1) && !(0 == t1_st)) && local + 1 <= token) && 2 <= m_st) && (((1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1))) || ((((((m_st == 0 && token <= local) && (\old(T1_E) == T1_E && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && local <= token) && !(m_pc == 1)) && 0 == t1_st) && E_M == \old(E_M))) || \old(local) < \old(token)) || \old(token) < \old(local)) || ((2 <= m_st && (((1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_pc) == 1) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || (((((2 <= E_M && !(0 == t1_st)) && token <= local) && 2 <= m_st) && local <= token) && (((1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1))) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc) [2018-10-26 21:08:47,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\old(T1_E) == 0 || !(M_E == 0)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc) [2018-10-26 21:08:47,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((T1_E == 0 || ((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && local <= token) && E_M == \old(E_M))) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) && (((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || ((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((T1_E == 0 || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0) || ((((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && local + 1 <= token) && 2 <= m_st) && !(E_1 == 1)) && E_M == \old(E_M)))) && (((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((((((((((T1_E == 0 || \old(local) < \old(token)) || (((((((token == \old(token) && (((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && m_st == 0) && token <= local) && 0 == t1_st) && local <= token) && !(m_pc == 1)) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && tmp == 1) && E_M == \old(E_M)) && local <= token)) || \old(E_M) < 2) || !(1 == t1_i)) || (2 <= E_M && ((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && !(0 == tmp)) && local <= token)) || (((((((2 <= E_M && 1 == t1_pc) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token <= local) && 2 <= m_st) && tmp == 1) && !(E_1 == 1)) && local <= token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (2 <= E_M && ((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && local + 1 <= token) && 2 <= m_st) && !(E_1 == 1)) && !(0 == tmp))) || T1_E == 1) || !(0 == \old(m_st))) || (E_M == \old(E_M) && (((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && m_st == 0) && token <= local) && !(E_1 == 1)) && local <= token) && !(m_pc == 1))) || 0 == \old(E_1)) || (2 <= E_M && ((((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && m_st == 0) && local + 1 <= token) && tmp == 1) && !(E_1 == 1)) || (((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && m_st == 0) && local + 1 <= token) && !(E_1 == 1))))) || 1 == \old(m_pc)) [2018-10-26 21:08:47,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((T1_E == 0 || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || ((((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && 2 <= m_st) && !(E_1 == 1)) && local + 1 <= token) && E_M == \old(E_M))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0) && ((((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && 2 <= m_st) && !(E_1 == 1)) && token <= local) && E_M == \old(E_M)) && local <= token)) || \old(t1_st) == 0)) && ((((((((((((((((T1_E == 0 || (((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && local + 1 <= token) && 2 <= m_st) && !(E_1 == 1))) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || (((((((2 <= E_M && 1 == t1_pc) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && local <= token)) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc))) && (((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || ((((((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) [2018-10-26 21:08:47,864 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || ((((!(T1_E == 1) && !(T1_E == 0) && !(E_M == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && ((((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || ((((!(0 == t1_st) && m_st == 0) && token <= local) && E_M == \old(E_M)) && local <= token)) || 1 == m_pc)) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || ((((!(0 == t1_st) && 2 <= m_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0)) && (((((((((((((((T1_E == 0 || ((((!(T1_E == 1) && !(T1_E == 0) && !(E_M == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || ((((!(0 == t1_st) && m_st == 0) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || ((((!(0 == t1_st) && 2 <= m_st) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || \old(t1_st) == 0) [2018-10-26 21:08:47,864 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((T1_E == 0 || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && !(0 == t1_st)) && 2 <= m_st) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || (((((1 == t1_pc && !(0 == t1_st)) && m_st == 0) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || (((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || \old(t1_st) == 0) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && ((((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || (((((1 == t1_pc && !(0 == t1_st)) && m_st == 0) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((1 == t1_pc && !(0 == t1_st)) && 2 <= m_st) && token <= local) && E_M == \old(E_M)) && local <= token) || T1_E == 0) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) [2018-10-26 21:08:47,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && token <= local) && !(E_1 == 0)) && local <= token) || T1_E == 0) || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc)) && ((((((((((((T1_E == 0 || (((((((((1 == t1_pc && !(T1_E == 1)) && !(M_E == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(M_E == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token) || ((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) || !(1 == t1_i)) || \old(t1_st) == 0) [2018-10-26 21:08:47,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((T1_E == 0 || ((((token <= local + 1 && \old(E_1) == E_1) && !(0 == t1_st)) && token == \old(token)) && local + 1 <= token)) || (((((((((((1 == t1_pc && !(T1_E == 1)) && \old(E_1) == E_1) && !(0 == t1_st)) && token == \old(token)) && !(M_E == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && 2 <= E_M) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0) && ((((((((((((((((((\old(E_1) == E_1 && token == \old(token)) && 0 == t1_st) && !(m_pc == 1)) && token <= local) && local <= token) || T1_E == 0) || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc))) && (((((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) || (((((((((((1 == t1_pc && !(T1_E == 1)) && \old(E_1) == E_1) && !(0 == t1_st)) && token == \old(token)) && !(M_E == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && 2 <= E_M) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || !(1 == t1_i)) || \old(t1_st) == 0) [2018-10-26 21:08:47,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) || !(1 == t1_i)) || \old(t1_st) == 0) && ((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || ((((token <= local + 1 && \old(E_1) == E_1) && !(0 == t1_st)) && token == \old(token)) && local + 1 <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0) [2018-10-26 21:08:47,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || ((1 == t1_pc && 2 <= m_st) && \old(E_M) == E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && !(0 == t1_st)) && 2 <= m_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0)) && ((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0)) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) [2018-10-26 21:08:47,911 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_346b5df9-c6a7-44ba-9153-811acde2a581/bin-2019/uautomizer/witness.graphml [2018-10-26 21:08:47,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:08:47,912 INFO L168 Benchmark]: Toolchain (without parser) took 36264.35 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 528.0 MB). Free memory was 954.8 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 348.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:08:47,913 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:08:47,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.71 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 941.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:08:47,913 INFO L168 Benchmark]: Boogie Preprocessor took 35.06 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:08:47,915 INFO L168 Benchmark]: RCFGBuilder took 874.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:08:47,915 INFO L168 Benchmark]: TraceAbstraction took 34954.85 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 378.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.2 MB). Peak memory consumption was 599.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:08:47,916 INFO L168 Benchmark]: Witness Printer took 114.99 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:08:47,917 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.71 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 941.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.06 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 874.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34954.85 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 378.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.2 MB). Peak memory consumption was 599.5 MB. Max. memory is 11.5 GB. * Witness Printer took 114.99 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 177]: Loop Invariant Derived loop invariant: ((((E_M < 2 || __retres1 == 1) || (((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || token < local) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || t1_st == 0) || 1 == m_pc) && ((((((((((((T1_E == 0 || local < token) || token < local) || m_st < 2) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || T1_E == 1) || __retres1 == 1) || 1 == E_1) || E_M < 2) || 0 == E_1) || !(1 == t1_i))) && ((((((((((((((T1_E == 0 || local < token) || token < local) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || __retres1 == 1) || 1 == m_pc)) && (((((((((((((T1_E == 0 || !(t1_pc == 1)) || __retres1 == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == m_st)) || token < local + 1) || 1 == E_1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || local + 1 < token) || t1_st == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((T1_E == 0 || ((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && local <= token) && E_M == \old(E_M))) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) && (((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || ((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((T1_E == 0 || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0) || ((((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && local + 1 <= token) && 2 <= m_st) && !(E_1 == 1)) && E_M == \old(E_M)))) && (((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((((((((((T1_E == 0 || \old(local) < \old(token)) || (((((((token == \old(token) && (((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && m_st == 0) && token <= local) && 0 == t1_st) && local <= token) && !(m_pc == 1)) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && tmp == 1) && E_M == \old(E_M)) && local <= token)) || \old(E_M) < 2) || !(1 == t1_i)) || (2 <= E_M && ((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && !(0 == tmp)) && local <= token)) || (((((((2 <= E_M && 1 == t1_pc) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token <= local) && 2 <= m_st) && tmp == 1) && !(E_1 == 1)) && local <= token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (2 <= E_M && ((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && local + 1 <= token) && 2 <= m_st) && !(E_1 == 1)) && !(0 == tmp))) || T1_E == 1) || !(0 == \old(m_st))) || (E_M == \old(E_M) && (((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && m_st == 0) && token <= local) && !(E_1 == 1)) && local <= token) && !(m_pc == 1))) || 0 == \old(E_1)) || (2 <= E_M && ((((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && m_st == 0) && local + 1 <= token) && tmp == 1) && !(E_1 == 1)) || (((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && m_st == 0) && local + 1 <= token) && !(E_1 == 1))))) || 1 == \old(m_pc)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || m_st < 2) || 0 == M_E) || T1_E == 1) || 1 == E_1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || t1_st == 0) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || m_st < 2) || 0 == M_E) || T1_E == 1) || token < local + 1) || 1 == E_1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || 0 == __retres1) || local + 1 < token) || t1_st == 0)) && ((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == __retres1) || m_st < 2) || 0 == M_E) || 1 == m_pc)) && ((((((((((((T1_E == 0 || local < token) || token < local) || t1_pc == 1) || 0 == M_E) || 0 == __retres1) || 1 == M_E) || !(t1_st == 0)) || T1_E == 1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || 1 == m_pc)) && (((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || token < local) || 0 == M_E) || 1 == M_E) || T1_E == 1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == __retres1) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || ((((!(T1_E == 1) && !(T1_E == 0) && !(E_M == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && ((((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || ((((!(0 == t1_st) && m_st == 0) && token <= local) && E_M == \old(E_M)) && local <= token)) || 1 == m_pc)) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || ((((!(0 == t1_st) && 2 <= m_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0)) && (((((((((((((((T1_E == 0 || ((((!(T1_E == 1) && !(T1_E == 0) && !(E_M == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || ((((!(0 == t1_st) && m_st == 0) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || ((((!(0 == t1_st) && 2 <= m_st) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || \old(t1_st) == 0) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && token <= local) && !(E_1 == 0)) && local <= token) || T1_E == 0) || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc)) && ((((((((((((T1_E == 0 || (((((((((1 == t1_pc && !(T1_E == 1)) && !(M_E == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(M_E == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token) || ((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) || !(1 == t1_i)) || \old(t1_st) == 0) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((T1_E == 0 || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || ((((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && 2 <= m_st) && !(E_1 == 1)) && local + 1 <= token) && E_M == \old(E_M))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0) && ((((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token == \old(token)) && 2 <= m_st) && !(E_1 == 1)) && token <= local) && E_M == \old(E_M)) && local <= token)) || \old(t1_st) == 0)) && ((((((((((((((((T1_E == 0 || (((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && local + 1 <= token) && 2 <= m_st) && !(E_1 == 1))) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || (((((((2 <= E_M && 1 == t1_pc) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(0 == t1_st)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && local <= token)) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc))) && (((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || ((((((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((((((((T1_E == 0 || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && !(0 == t1_st)) && 2 <= m_st) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || (((((1 == t1_pc && !(0 == t1_st)) && m_st == 0) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || (((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || \old(t1_st) == 0) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && ((((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || (((((1 == t1_pc && !(0 == t1_st)) && m_st == 0) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((1 == t1_pc && !(0 == t1_st)) && 2 <= m_st) && token <= local) && E_M == \old(E_M)) && local <= token) || T1_E == 0) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || ((1 == t1_pc && 2 <= m_st) && \old(E_M) == E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && !(0 == t1_st)) && 2 <= m_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0)) && ((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0)) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= m_st && (\old(T1_E) == T1_E && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) || \old(T1_E) == 0) || (((((2 <= E_M && token <= local + 1) && !(0 == t1_st)) && local + 1 <= token) && 2 <= m_st) && (((1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1))) || ((((((m_st == 0 && token <= local) && (\old(T1_E) == T1_E && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && local <= token) && !(m_pc == 1)) && 0 == t1_st) && E_M == \old(E_M))) || \old(local) < \old(token)) || \old(token) < \old(local)) || ((2 <= m_st && (((1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_pc) == 1) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || (((((2 <= E_M && !(0 == t1_st)) && token <= local) && 2 <= m_st) && local <= token) && (((1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1))) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) || !(1 == t1_i)) || \old(t1_st) == 0) && ((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || ((((token <= local + 1 && \old(E_1) == E_1) && !(0 == t1_st)) && token == \old(token)) && local + 1 <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || m_st < 2) || 0 == M_E) || 1 == m_pc) && ((((((((((((0 == __retres1 || T1_E == 0) || local < token) || token < local) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || T1_E == 1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || 1 == m_pc)) && (((((((((((((!(1 == E_M) || T1_E == 0) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 0 == __retres1) || T1_E == 1) || !(0 == m_st)) || token < local + 1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || local + 1 < token) || t1_st == 0)) && (((((((((((((!(1 == E_M) || T1_E == 0) || 0 == __retres1) || !(t1_pc == 1)) || m_st < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || token < local + 1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || local + 1 < token) || t1_st == 0)) && ((((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || token < local) || 1 == E_1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 0 == __retres1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || t1_st == 0)) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || m_st < 2) || 0 == M_E) || T1_E == 1) || token < local + 1) || 1 == E_1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || local + 1 < token) || t1_st == 0) || 0 == __retres1)) && ((((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || token < local) || m_st < 2) || 0 == M_E) || T1_E == 1) || 1 == E_1) || E_M < 2) || 0 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((\old(T1_E) == 0 || !(M_E == 0)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || ((((token <= local + 1 && \old(E_1) == E_1) && !(0 == t1_st)) && token == \old(token)) && local + 1 <= token)) || (((((((((((1 == t1_pc && !(T1_E == 1)) && \old(E_1) == E_1) && !(0 == t1_st)) && token == \old(token)) && !(M_E == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && 2 <= E_M) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(local) + 1 < \old(token)) || \old(t1_st) == 0) && ((((((((((((((((((\old(E_1) == E_1 && token == \old(token)) && 0 == t1_st) && !(m_pc == 1)) && token <= local) && local <= token) || T1_E == 0) || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || !(1 == t1_i)) || 1 == \old(m_pc))) && (((((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) || (((((((((((1 == t1_pc && !(T1_E == 1)) && \old(E_1) == E_1) && !(0 == t1_st)) && token == \old(token)) && !(M_E == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && 2 <= E_M) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || !(1 == t1_i)) || \old(t1_st) == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 148 locations, 1 error locations. SAFE Result, 34.8s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 17.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 3476 SDtfs, 3948 SDslu, 4444 SDs, 0 SdLazy, 3003 SolverSat, 1139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 778 GetRequests, 679 SyntacticMatches, 24 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2148occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 472 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3132 PreInvPairs, 3612 NumberOfFragments, 12255 HoareAnnotationTreeSize, 3132 FomulaSimplifications, 59201 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 62 FomulaSimplificationsInter, 34829 FormulaSimplificationTreeSizeReductionInter, 14.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2646 NumberOfCodeBlocks, 2646 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2626 ConstructedInterpolants, 0 QuantifiedInterpolants, 589382 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2324 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 1135/1188 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...