/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:24:53,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:24:53,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:24:53,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:24:53,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:24:53,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:24:53,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:24:53,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:24:53,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:24:53,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:24:53,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:24:53,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:24:53,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:24:53,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:24:53,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:24:53,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:24:53,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:24:53,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:24:53,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:24:53,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:24:53,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:24:53,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:24:53,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:24:53,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:24:53,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:24:53,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:24:53,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:24:53,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:24:53,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:24:53,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:24:53,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:24:53,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:24:53,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:24:53,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:24:53,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:24:53,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:24:53,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:24:53,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:24:53,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:24:53,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:24:53,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:24:53,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 23:24:53,266 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:24:53,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:24:53,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:24:53,268 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:24:53,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:24:53,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:24:53,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:24:53,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:24:53,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:24:53,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:24:53,270 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:24:53,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:24:53,270 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:24:53,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:24:53,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:24:53,271 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:24:53,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:24:53,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:24:53,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:24:53,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:24:53,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:24:53,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:24:53,272 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 23:24:53,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:24:53,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:24:53,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:24:53,806 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:24:53,806 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:24:53,807 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-09-04 23:24:53,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1db464b71/b921c4b880a8469c9fc69a0c3bb3bef6/FLAG57a219d34 [2020-09-04 23:24:54,479 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:24:54,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-09-04 23:24:54,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1db464b71/b921c4b880a8469c9fc69a0c3bb3bef6/FLAG57a219d34 [2020-09-04 23:24:54,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1db464b71/b921c4b880a8469c9fc69a0c3bb3bef6 [2020-09-04 23:24:54,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:24:54,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:24:54,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:54,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:24:54,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:24:54,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:54" (1/1) ... [2020-09-04 23:24:54,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3c9999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:54, skipping insertion in model container [2020-09-04 23:24:54,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:54" (1/1) ... [2020-09-04 23:24:54,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:24:54,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:24:55,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:55,161 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:24:55,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:55,232 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:24:55,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55 WrapperNode [2020-09-04 23:24:55,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:55,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:24:55,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:24:55,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:24:55,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:24:55,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:24:55,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:24:55,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:24:55,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/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 [2020-09-04 23:24:55,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:24:55,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:24:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 23:24:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-09-04 23:24:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-09-04 23:24:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-09-04 23:24:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-09-04 23:24:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 23:24:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 23:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 23:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 23:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 23:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 23:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 23:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-09-04 23:24:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-09-04 23:24:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-09-04 23:24:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 23:24:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 23:24:55,458 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 23:24:55,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:24:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:24:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 23:24:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-09-04 23:24:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-09-04 23:24:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-09-04 23:24:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:24:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-09-04 23:24:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-09-04 23:24:55,462 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 23:24:55,463 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 23:24:55,463 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 23:24:55,463 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 23:24:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 23:24:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 23:24:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 23:24:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-09-04 23:24:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-09-04 23:24:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 23:24:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 23:24:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 23:24:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:24:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:24:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:24:56,075 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:24:56,076 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-09-04 23:24:56,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:56 BoogieIcfgContainer [2020-09-04 23:24:56,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:24:56,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:24:56,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:24:56,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:24:56,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:24:54" (1/3) ... [2020-09-04 23:24:56,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8c9608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:56, skipping insertion in model container [2020-09-04 23:24:56,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55" (2/3) ... [2020-09-04 23:24:56,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8c9608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:56, skipping insertion in model container [2020-09-04 23:24:56,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:56" (3/3) ... [2020-09-04 23:24:56,094 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-09-04 23:24:56,106 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:24:56,118 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:24:56,141 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:24:56,169 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:24:56,169 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:24:56,170 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:24:56,170 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:24:56,170 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:24:56,170 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:24:56,170 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:24:56,170 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:24:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states. [2020-09-04 23:24:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-04 23:24:56,211 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:56,213 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:24:56,214 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1066956110, now seen corresponding path program 1 times [2020-09-04 23:24:56,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:56,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1949000979] [2020-09-04 23:24:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:24:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:24:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:24:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:24:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:24:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:24:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:24:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:24:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:24:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:56,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1949000979] [2020-09-04 23:24:56,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:56,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:24:56,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313484658] [2020-09-04 23:24:56,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:24:56,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:24:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:24:56,908 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 7 states. [2020-09-04 23:24:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:59,187 INFO L93 Difference]: Finished difference Result 774 states and 1050 transitions. [2020-09-04 23:24:59,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 23:24:59,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2020-09-04 23:24:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:59,216 INFO L225 Difference]: With dead ends: 774 [2020-09-04 23:24:59,216 INFO L226 Difference]: Without dead ends: 573 [2020-09-04 23:24:59,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-09-04 23:24:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-09-04 23:24:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 419. [2020-09-04 23:24:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-09-04 23:24:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 521 transitions. [2020-09-04 23:24:59,383 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 521 transitions. Word has length 107 [2020-09-04 23:24:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:59,384 INFO L479 AbstractCegarLoop]: Abstraction has 419 states and 521 transitions. [2020-09-04 23:24:59,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:24:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 521 transitions. [2020-09-04 23:24:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-09-04 23:24:59,392 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:59,392 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 23:24:59,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:24:59,393 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash -517401199, now seen corresponding path program 1 times [2020-09-04 23:24:59,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:59,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [250100015] [2020-09-04 23:24:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:24:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:24:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:24:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:24:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:24:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:24:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:24:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:24:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:24:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:24:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:24:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:24:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:24:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 23:24:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-09-04 23:24:59,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [250100015] [2020-09-04 23:24:59,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:59,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:24:59,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647389669] [2020-09-04 23:24:59,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:24:59,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:24:59,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:24:59,804 INFO L87 Difference]: Start difference. First operand 419 states and 521 transitions. Second operand 9 states. [2020-09-04 23:25:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:03,047 INFO L93 Difference]: Finished difference Result 1504 states and 2005 transitions. [2020-09-04 23:25:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:25:03,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2020-09-04 23:25:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:03,060 INFO L225 Difference]: With dead ends: 1504 [2020-09-04 23:25:03,061 INFO L226 Difference]: Without dead ends: 1125 [2020-09-04 23:25:03,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:25:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2020-09-04 23:25:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 835. [2020-09-04 23:25:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2020-09-04 23:25:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1076 transitions. [2020-09-04 23:25:03,218 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1076 transitions. Word has length 170 [2020-09-04 23:25:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:03,220 INFO L479 AbstractCegarLoop]: Abstraction has 835 states and 1076 transitions. [2020-09-04 23:25:03,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:25:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1076 transitions. [2020-09-04 23:25:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-09-04 23:25:03,233 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:03,233 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:03,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:25:03,234 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash 878280969, now seen corresponding path program 1 times [2020-09-04 23:25:03,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:03,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110376925] [2020-09-04 23:25:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 23:25:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 23:25:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 23:25:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-09-04 23:25:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2020-09-04 23:25:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2020-09-04 23:25:03,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110376925] [2020-09-04 23:25:03,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:03,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:03,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365989577] [2020-09-04 23:25:03,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:03,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:03,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:03,765 INFO L87 Difference]: Start difference. First operand 835 states and 1076 transitions. Second operand 10 states. [2020-09-04 23:25:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:05,771 INFO L93 Difference]: Finished difference Result 1955 states and 2544 transitions. [2020-09-04 23:25:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 23:25:05,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2020-09-04 23:25:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:05,791 INFO L225 Difference]: With dead ends: 1955 [2020-09-04 23:25:05,792 INFO L226 Difference]: Without dead ends: 1158 [2020-09-04 23:25:05,805 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2020-09-04 23:25:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2020-09-04 23:25:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 826. [2020-09-04 23:25:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2020-09-04 23:25:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1061 transitions. [2020-09-04 23:25:05,939 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1061 transitions. Word has length 283 [2020-09-04 23:25:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:05,939 INFO L479 AbstractCegarLoop]: Abstraction has 826 states and 1061 transitions. [2020-09-04 23:25:05,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1061 transitions. [2020-09-04 23:25:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 23:25:05,945 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:05,945 INFO L422 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:05,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:25:05,946 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:05,946 INFO L82 PathProgramCache]: Analyzing trace with hash 214480794, now seen corresponding path program 1 times [2020-09-04 23:25:05,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:05,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524721507] [2020-09-04 23:25:05,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:25:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-09-04 23:25:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-09-04 23:25:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 29 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-09-04 23:25:06,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524721507] [2020-09-04 23:25:06,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:06,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:25:06,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588644592] [2020-09-04 23:25:06,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:25:06,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:06,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:25:06,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:25:06,530 INFO L87 Difference]: Start difference. First operand 826 states and 1061 transitions. Second operand 12 states. [2020-09-04 23:25:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:09,235 INFO L93 Difference]: Finished difference Result 1962 states and 2598 transitions. [2020-09-04 23:25:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 23:25:09,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 220 [2020-09-04 23:25:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:09,246 INFO L225 Difference]: With dead ends: 1962 [2020-09-04 23:25:09,246 INFO L226 Difference]: Without dead ends: 941 [2020-09-04 23:25:09,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2020-09-04 23:25:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2020-09-04 23:25:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 679. [2020-09-04 23:25:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2020-09-04 23:25:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 841 transitions. [2020-09-04 23:25:09,380 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 841 transitions. Word has length 220 [2020-09-04 23:25:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:09,382 INFO L479 AbstractCegarLoop]: Abstraction has 679 states and 841 transitions. [2020-09-04 23:25:09,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:25:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 841 transitions. [2020-09-04 23:25:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-09-04 23:25:09,390 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:09,390 INFO L422 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:09,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:25:09,391 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:09,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash 144736441, now seen corresponding path program 2 times [2020-09-04 23:25:09,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:09,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [465195969] [2020-09-04 23:25:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:25:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 23:25:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-09-04 23:25:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-09-04 23:25:09,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [465195969] [2020-09-04 23:25:09,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:09,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:09,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003832698] [2020-09-04 23:25:09,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:09,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:09,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:09,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:09,869 INFO L87 Difference]: Start difference. First operand 679 states and 841 transitions. Second operand 10 states. [2020-09-04 23:25:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:13,322 INFO L93 Difference]: Finished difference Result 2297 states and 3039 transitions. [2020-09-04 23:25:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:25:13,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2020-09-04 23:25:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:13,337 INFO L225 Difference]: With dead ends: 2297 [2020-09-04 23:25:13,337 INFO L226 Difference]: Without dead ends: 1656 [2020-09-04 23:25:13,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2020-09-04 23:25:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-09-04 23:25:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1256. [2020-09-04 23:25:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-09-04 23:25:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1532 transitions. [2020-09-04 23:25:13,541 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1532 transitions. Word has length 219 [2020-09-04 23:25:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:13,542 INFO L479 AbstractCegarLoop]: Abstraction has 1256 states and 1532 transitions. [2020-09-04 23:25:13,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1532 transitions. [2020-09-04 23:25:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-09-04 23:25:13,549 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:13,550 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:13,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:25:13,550 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2140706519, now seen corresponding path program 1 times [2020-09-04 23:25:13,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:13,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296074708] [2020-09-04 23:25:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 23:25:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 23:25:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 23:25:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 23:25:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-09-04 23:25:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-09-04 23:25:13,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296074708] [2020-09-04 23:25:13,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:13,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:25:13,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426501096] [2020-09-04 23:25:13,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:25:13,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:25:13,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:25:13,886 INFO L87 Difference]: Start difference. First operand 1256 states and 1532 transitions. Second operand 9 states. [2020-09-04 23:25:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:16,629 INFO L93 Difference]: Finished difference Result 2884 states and 3650 transitions. [2020-09-04 23:25:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:25:16,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2020-09-04 23:25:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:16,642 INFO L225 Difference]: With dead ends: 2884 [2020-09-04 23:25:16,643 INFO L226 Difference]: Without dead ends: 1667 [2020-09-04 23:25:16,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:25:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2020-09-04 23:25:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1256. [2020-09-04 23:25:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-09-04 23:25:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1520 transitions. [2020-09-04 23:25:16,848 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1520 transitions. Word has length 248 [2020-09-04 23:25:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:16,849 INFO L479 AbstractCegarLoop]: Abstraction has 1256 states and 1520 transitions. [2020-09-04 23:25:16,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:25:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1520 transitions. [2020-09-04 23:25:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-09-04 23:25:16,856 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:16,856 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:16,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:25:16,857 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash -469744976, now seen corresponding path program 1 times [2020-09-04 23:25:16,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:16,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [621601165] [2020-09-04 23:25:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:16,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:16,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:16,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:25:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 23:25:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 23:25:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 23:25:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-09-04 23:25:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-09-04 23:25:17,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [621601165] [2020-09-04 23:25:17,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:17,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:25:17,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143663851] [2020-09-04 23:25:17,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:17,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:17,273 INFO L87 Difference]: Start difference. First operand 1256 states and 1520 transitions. Second operand 10 states. [2020-09-04 23:25:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:21,245 INFO L93 Difference]: Finished difference Result 4318 states and 5461 transitions. [2020-09-04 23:25:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 23:25:21,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 248 [2020-09-04 23:25:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:21,283 INFO L225 Difference]: With dead ends: 4318 [2020-09-04 23:25:21,284 INFO L226 Difference]: Without dead ends: 3101 [2020-09-04 23:25:21,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 23:25:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2020-09-04 23:25:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2364. [2020-09-04 23:25:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2020-09-04 23:25:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2885 transitions. [2020-09-04 23:25:21,749 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2885 transitions. Word has length 248 [2020-09-04 23:25:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:21,750 INFO L479 AbstractCegarLoop]: Abstraction has 2364 states and 2885 transitions. [2020-09-04 23:25:21,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2885 transitions. [2020-09-04 23:25:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-09-04 23:25:21,761 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:21,762 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:21,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:25:21,762 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:21,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:21,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1876608160, now seen corresponding path program 1 times [2020-09-04 23:25:21,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:21,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456958960] [2020-09-04 23:25:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:21,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 23:25:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 23:25:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-09-04 23:25:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-09-04 23:25:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-09-04 23:25:22,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456958960] [2020-09-04 23:25:22,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:22,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 23:25:22,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065452783] [2020-09-04 23:25:22,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 23:25:22,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 23:25:22,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:25:22,314 INFO L87 Difference]: Start difference. First operand 2364 states and 2885 transitions. Second operand 14 states. [2020-09-04 23:25:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:27,481 INFO L93 Difference]: Finished difference Result 5265 states and 6747 transitions. [2020-09-04 23:25:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-09-04 23:25:27,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 254 [2020-09-04 23:25:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:27,507 INFO L225 Difference]: With dead ends: 5265 [2020-09-04 23:25:27,508 INFO L226 Difference]: Without dead ends: 2941 [2020-09-04 23:25:27,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=442, Invalid=1628, Unknown=0, NotChecked=0, Total=2070 [2020-09-04 23:25:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-09-04 23:25:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2370. [2020-09-04 23:25:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2020-09-04 23:25:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2841 transitions. [2020-09-04 23:25:27,967 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2841 transitions. Word has length 254 [2020-09-04 23:25:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:27,969 INFO L479 AbstractCegarLoop]: Abstraction has 2370 states and 2841 transitions. [2020-09-04 23:25:27,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 23:25:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2841 transitions. [2020-09-04 23:25:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-09-04 23:25:27,979 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:27,980 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:27,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:25:27,980 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 405313859, now seen corresponding path program 1 times [2020-09-04 23:25:27,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:27,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1897844011] [2020-09-04 23:25:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 23:25:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 23:25:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-09-04 23:25:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-09-04 23:25:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-09-04 23:25:28,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1897844011] [2020-09-04 23:25:28,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:28,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:25:28,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861460014] [2020-09-04 23:25:28,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:25:28,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:28,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:25:28,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:25:28,557 INFO L87 Difference]: Start difference. First operand 2370 states and 2841 transitions. Second operand 12 states. [2020-09-04 23:25:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:34,917 INFO L93 Difference]: Finished difference Result 7778 states and 9559 transitions. [2020-09-04 23:25:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-09-04 23:25:34,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 254 [2020-09-04 23:25:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:34,976 INFO L225 Difference]: With dead ends: 7778 [2020-09-04 23:25:34,976 INFO L226 Difference]: Without dead ends: 5452 [2020-09-04 23:25:34,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-09-04 23:25:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2020-09-04 23:25:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4339. [2020-09-04 23:25:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4339 states. [2020-09-04 23:25:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5251 transitions. [2020-09-04 23:25:36,312 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5251 transitions. Word has length 254 [2020-09-04 23:25:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:36,316 INFO L479 AbstractCegarLoop]: Abstraction has 4339 states and 5251 transitions. [2020-09-04 23:25:36,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:25:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5251 transitions. [2020-09-04 23:25:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2020-09-04 23:25:36,335 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:36,336 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:36,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:25:36,337 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1642237702, now seen corresponding path program 1 times [2020-09-04 23:25:36,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:36,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356868751] [2020-09-04 23:25:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:25:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:25:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:25:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 23:25:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2020-09-04 23:25:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-09-04 23:25:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-09-04 23:25:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-09-04 23:25:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-09-04 23:25:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-09-04 23:25:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2020-09-04 23:25:37,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356868751] [2020-09-04 23:25:37,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:37,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:25:37,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028502195] [2020-09-04 23:25:37,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:37,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:37,005 INFO L87 Difference]: Start difference. First operand 4339 states and 5251 transitions. Second operand 10 states. [2020-09-04 23:25:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:41,362 INFO L93 Difference]: Finished difference Result 9119 states and 11220 transitions. [2020-09-04 23:25:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 23:25:41,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2020-09-04 23:25:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:41,405 INFO L225 Difference]: With dead ends: 9119 [2020-09-04 23:25:41,406 INFO L226 Difference]: Without dead ends: 5371 [2020-09-04 23:25:41,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2020-09-04 23:25:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2020-09-04 23:25:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 4359. [2020-09-04 23:25:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2020-09-04 23:25:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 5213 transitions. [2020-09-04 23:25:42,646 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 5213 transitions. Word has length 270 [2020-09-04 23:25:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:42,648 INFO L479 AbstractCegarLoop]: Abstraction has 4359 states and 5213 transitions. [2020-09-04 23:25:42,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 5213 transitions. [2020-09-04 23:25:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2020-09-04 23:25:42,658 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:42,658 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:42,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:25:42,659 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:42,659 INFO L82 PathProgramCache]: Analyzing trace with hash -957347782, now seen corresponding path program 1 times [2020-09-04 23:25:42,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:42,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [112743805] [2020-09-04 23:25:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:25:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:25:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:25:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 23:25:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2020-09-04 23:25:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-09-04 23:25:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-09-04 23:25:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-09-04 23:25:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:42,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-09-04 23:25:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:43,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:43,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-09-04 23:25:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 23:25:43,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [112743805] [2020-09-04 23:25:43,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:43,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:43,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700546098] [2020-09-04 23:25:43,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:43,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:43,105 INFO L87 Difference]: Start difference. First operand 4359 states and 5213 transitions. Second operand 10 states. [2020-09-04 23:25:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:45,691 INFO L93 Difference]: Finished difference Result 8953 states and 10781 transitions. [2020-09-04 23:25:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 23:25:45,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2020-09-04 23:25:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:45,726 INFO L225 Difference]: With dead ends: 8953 [2020-09-04 23:25:45,726 INFO L226 Difference]: Without dead ends: 4631 [2020-09-04 23:25:45,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2020-09-04 23:25:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2020-09-04 23:25:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3789. [2020-09-04 23:25:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3789 states. [2020-09-04 23:25:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 4529 transitions. [2020-09-04 23:25:46,288 INFO L78 Accepts]: Start accepts. Automaton has 3789 states and 4529 transitions. Word has length 270 [2020-09-04 23:25:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:46,288 INFO L479 AbstractCegarLoop]: Abstraction has 3789 states and 4529 transitions. [2020-09-04 23:25:46,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 4529 transitions. [2020-09-04 23:25:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-09-04 23:25:46,297 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:46,298 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:46,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:25:46,298 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash 353572077, now seen corresponding path program 1 times [2020-09-04 23:25:46,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:46,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2145091901] [2020-09-04 23:25:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:25:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:25:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:25:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 23:25:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-09-04 23:25:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-09-04 23:25:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2020-09-04 23:25:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2020-09-04 23:25:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-09-04 23:25:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2020-09-04 23:25:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-09-04 23:25:46,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2145091901] [2020-09-04 23:25:46,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:46,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:25:46,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971251695] [2020-09-04 23:25:46,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:25:46,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:25:46,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:25:46,747 INFO L87 Difference]: Start difference. First operand 3789 states and 4529 transitions. Second operand 12 states. [2020-09-04 23:25:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:49,559 INFO L93 Difference]: Finished difference Result 7142 states and 8522 transitions. [2020-09-04 23:25:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:25:49,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 275 [2020-09-04 23:25:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:49,585 INFO L225 Difference]: With dead ends: 7142 [2020-09-04 23:25:49,586 INFO L226 Difference]: Without dead ends: 3391 [2020-09-04 23:25:49,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:25:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2020-09-04 23:25:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2619. [2020-09-04 23:25:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2020-09-04 23:25:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3026 transitions. [2020-09-04 23:25:50,175 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3026 transitions. Word has length 275 [2020-09-04 23:25:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:50,176 INFO L479 AbstractCegarLoop]: Abstraction has 2619 states and 3026 transitions. [2020-09-04 23:25:50,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:25:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3026 transitions. [2020-09-04 23:25:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-09-04 23:25:50,181 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:50,182 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:50,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 23:25:50,182 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1238866457, now seen corresponding path program 1 times [2020-09-04 23:25:50,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:50,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1382161477] [2020-09-04 23:25:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:25:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:25:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:25:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 23:25:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 23:25:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 23:25:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-09-04 23:25:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-09-04 23:25:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 23:25:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-09-04 23:25:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-09-04 23:25:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-09-04 23:25:50,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1382161477] [2020-09-04 23:25:50,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:50,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 23:25:50,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225718694] [2020-09-04 23:25:50,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:25:50,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:25:50,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:25:50,764 INFO L87 Difference]: Start difference. First operand 2619 states and 3026 transitions. Second operand 13 states. [2020-09-04 23:25:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:53,846 INFO L93 Difference]: Finished difference Result 5583 states and 6704 transitions. [2020-09-04 23:25:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 23:25:53,847 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2020-09-04 23:25:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:53,866 INFO L225 Difference]: With dead ends: 5583 [2020-09-04 23:25:53,867 INFO L226 Difference]: Without dead ends: 3045 [2020-09-04 23:25:53,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 23:25:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2020-09-04 23:25:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 2562. [2020-09-04 23:25:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-09-04 23:25:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 2887 transitions. [2020-09-04 23:25:54,482 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 2887 transitions. Word has length 284 [2020-09-04 23:25:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:54,482 INFO L479 AbstractCegarLoop]: Abstraction has 2562 states and 2887 transitions. [2020-09-04 23:25:54,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:25:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 2887 transitions. [2020-09-04 23:25:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-09-04 23:25:54,488 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:54,488 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:54,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 23:25:54,489 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1211508846, now seen corresponding path program 1 times [2020-09-04 23:25:54,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:54,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [629892450] [2020-09-04 23:25:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:25:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:25:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 23:25:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 23:25:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 23:25:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 23:25:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-09-04 23:25:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-09-04 23:25:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-09-04 23:25:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2020-09-04 23:25:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:54,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2020-09-04 23:25:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-09-04 23:25:55,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [629892450] [2020-09-04 23:25:55,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:55,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 23:25:55,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507828548] [2020-09-04 23:25:55,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:25:55,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:25:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:25:55,035 INFO L87 Difference]: Start difference. First operand 2562 states and 2887 transitions. Second operand 13 states. [2020-09-04 23:25:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:57,132 INFO L93 Difference]: Finished difference Result 3787 states and 4293 transitions. [2020-09-04 23:25:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 23:25:57,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 286 [2020-09-04 23:25:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:57,141 INFO L225 Difference]: With dead ends: 3787 [2020-09-04 23:25:57,141 INFO L226 Difference]: Without dead ends: 1308 [2020-09-04 23:25:57,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2020-09-04 23:25:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2020-09-04 23:25:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1120. [2020-09-04 23:25:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2020-09-04 23:25:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1240 transitions. [2020-09-04 23:25:57,430 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1240 transitions. Word has length 286 [2020-09-04 23:25:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:57,431 INFO L479 AbstractCegarLoop]: Abstraction has 1120 states and 1240 transitions. [2020-09-04 23:25:57,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:25:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1240 transitions. [2020-09-04 23:25:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2020-09-04 23:25:57,437 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:57,439 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:57,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 23:25:57,439 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash -537431486, now seen corresponding path program 1 times [2020-09-04 23:25:57,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:57,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [276473843] [2020-09-04 23:25:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 23:25:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:25:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:25:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 23:25:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:25:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 23:25:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 23:25:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-09-04 23:25:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2020-09-04 23:25:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2020-09-04 23:25:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2020-09-04 23:25:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2020-09-04 23:25:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2020-09-04 23:25:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2020-09-04 23:25:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2020-09-04 23:25:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:57,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2020-09-04 23:25:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 108 proven. 37 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2020-09-04 23:25:58,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [276473843] [2020-09-04 23:25:58,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:58,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 23:25:58,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113278298] [2020-09-04 23:25:58,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 23:25:58,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:58,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 23:25:58,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:25:58,226 INFO L87 Difference]: Start difference. First operand 1120 states and 1240 transitions. Second operand 14 states. [2020-09-04 23:26:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:26:01,190 INFO L93 Difference]: Finished difference Result 1600 states and 1784 transitions. [2020-09-04 23:26:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:26:01,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 421 [2020-09-04 23:26:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:26:01,194 INFO L225 Difference]: With dead ends: 1600 [2020-09-04 23:26:01,195 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 23:26:01,203 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=761, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 23:26:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 23:26:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 23:26:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 23:26:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 23:26:01,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2020-09-04 23:26:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:26:01,205 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 23:26:01,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 23:26:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 23:26:01,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 23:26:01,206 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 23:26:01,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 23:26:01,794 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:26:02,266 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:26:02,790 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:26:03,180 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2020-09-04 23:26:03,675 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:26:03,953 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:26:04,342 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2020-09-04 23:26:04,992 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2020-09-04 23:26:05,502 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2020-09-04 23:26:06,284 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 23:26:06,639 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 23:26:06,847 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2020-09-04 23:26:07,467 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 23:26:08,268 WARN L193 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 23:26:08,471 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2020-09-04 23:26:08,894 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72 [2020-09-04 23:26:09,778 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 93 [2020-09-04 23:26:10,083 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 93 [2020-09-04 23:26:10,210 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2020-09-04 23:26:11,082 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2020-09-04 23:26:11,610 WARN L193 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2020-09-04 23:26:12,195 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2020-09-04 23:26:12,708 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63 [2020-09-04 23:26:16,666 WARN L193 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-09-04 23:26:17,348 WARN L193 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-09-04 23:26:18,098 WARN L193 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-09-04 23:26:18,728 WARN L193 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-09-04 23:26:19,779 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2020-09-04 23:26:22,606 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 [2020-09-04 23:26:22,777 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2020-09-04 23:26:23,002 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 [2020-09-04 23:26:24,048 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2020-09-04 23:26:27,043 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 23:26:27,355 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 23:26:27,561 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2020-09-04 23:26:28,997 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2020-09-04 23:26:32,364 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-09-04 23:26:33,730 WARN L193 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 142 [2020-09-04 23:26:34,651 WARN L193 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 142 [2020-09-04 23:26:35,002 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2020-09-04 23:26:35,220 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-09-04 23:26:35,334 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-09-04 23:26:39,098 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:26:39,515 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:26:40,173 WARN L193 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-09-04 23:26:40,924 WARN L193 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-09-04 23:26:41,810 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-09-04 23:26:44,958 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2020-09-04 23:26:45,226 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2020-09-04 23:26:46,166 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:26:46,584 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:26:47,774 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2020-09-04 23:26:48,232 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2020-09-04 23:26:48,502 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2020-09-04 23:26:49,507 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2020-09-04 23:26:49,771 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2020-09-04 23:26:50,795 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:26:51,203 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:26:52,148 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 95 [2020-09-04 23:26:52,481 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 95 [2020-09-04 23:26:52,683 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2020-09-04 23:26:53,570 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2020-09-04 23:26:54,029 WARN L193 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2020-09-04 23:26:54,299 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2020-09-04 23:26:55,122 WARN L193 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-09-04 23:26:55,882 WARN L193 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-09-04 23:26:56,161 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2020-09-04 23:26:56,378 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2020-09-04 23:26:56,997 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2020-09-04 23:26:57,157 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2020-09-04 23:26:57,365 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2020-09-04 23:26:57,583 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72 [2020-09-04 23:26:57,894 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2020-09-04 23:26:58,504 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2020-09-04 23:26:59,009 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2020-09-04 23:26:59,885 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:27:00,257 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2020-09-04 23:27:02,641 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-09-04 23:27:03,310 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 99 [2020-09-04 23:27:03,735 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 99 [2020-09-04 23:27:04,000 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2020-09-04 23:27:04,583 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:27:04,957 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2020-09-04 23:27:05,962 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2020-09-04 23:27:06,166 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2020-09-04 23:27:06,806 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 82 [2020-09-04 23:27:07,566 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2020-09-04 23:27:08,656 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-09-04 23:27:08,812 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-09-04 23:27:09,206 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 76 [2020-09-04 23:27:10,198 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-09-04 23:27:13,945 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2020-09-04 23:27:14,526 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2020-09-04 23:27:17,771 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:27:18,021 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:27:21,383 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2020-09-04 23:27:23,452 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2020-09-04 23:27:24,299 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 85 [2020-09-04 23:27:24,524 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 85 [2020-09-04 23:27:24,750 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2020-09-04 23:27:25,671 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:27:26,047 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2020-09-04 23:27:27,304 WARN L193 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-09-04 23:27:27,945 WARN L193 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-09-04 23:27:31,936 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2020-09-04 23:27:32,455 WARN L193 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63 [2020-09-04 23:27:33,294 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2020-09-04 23:27:33,455 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-09-04 23:27:33,667 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2020-09-04 23:27:34,331 WARN L193 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-09-04 23:27:34,998 WARN L193 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-09-04 23:27:35,724 WARN L193 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-09-04 23:27:36,349 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-09-04 23:27:36,725 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72 [2020-09-04 23:27:37,667 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2020-09-04 23:27:37,861 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2020-09-04 23:27:38,462 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 82 [2020-09-04 23:27:39,220 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2020-09-04 23:27:40,351 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-09-04 23:27:40,525 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-09-04 23:27:40,914 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 76 [2020-09-04 23:27:41,898 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-09-04 23:27:43,215 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:27:43,466 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:27:43,835 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:27:44,084 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:27:44,543 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:27:44,894 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:27:45,314 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:27:45,660 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2020-09-04 23:27:46,209 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 99 [2020-09-04 23:27:46,626 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 99 [2020-09-04 23:27:46,886 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2020-09-04 23:27:47,326 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:27:47,578 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-09-04 23:27:48,811 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2020-09-04 23:27:52,739 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-09-04 23:27:53,787 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-09-04 23:27:54,426 WARN L193 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-09-04 23:27:55,349 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:27:55,696 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-09-04 23:27:56,110 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-09-04 23:27:56,457 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2020-09-04 23:27:58,227 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2020-09-04 23:27:58,462 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2020-09-04 23:27:59,803 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-09-04 23:28:00,159 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-09-04 23:28:00,996 WARN L193 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-09-04 23:28:01,441 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-09-04 23:28:01,661 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2020-09-04 23:28:02,174 WARN L193 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-09-04 23:28:02,304 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-09-04 23:28:03,642 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2020-09-04 23:28:04,979 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2020-09-04 23:28:05,237 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-09-04 23:28:05,756 WARN L193 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-09-04 23:28:06,551 WARN L193 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2020-09-04 23:28:06,667 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-09-04 23:28:06,790 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-09-04 23:28:07,047 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2020-09-04 23:28:07,727 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2020-09-04 23:28:08,437 WARN L193 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-09-04 23:28:08,835 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-09-04 23:28:09,201 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2020-09-04 23:28:09,589 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-09-04 23:28:09,720 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-09-04 23:28:09,911 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:10,098 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:10,232 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-09-04 23:28:10,979 WARN L193 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-09-04 23:28:11,471 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-09-04 23:28:12,168 WARN L193 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 45 [2020-09-04 23:28:13,445 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2020-09-04 23:28:13,819 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2020-09-04 23:28:14,532 WARN L193 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 58 [2020-09-04 23:28:15,802 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2020-09-04 23:28:17,160 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2020-09-04 23:28:17,722 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2020-09-04 23:28:19,008 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 128 DAG size of output: 72 [2020-09-04 23:28:19,587 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-09-04 23:28:20,112 WARN L193 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-09-04 23:28:21,204 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 164 DAG size of output: 92 [2020-09-04 23:28:21,745 WARN L193 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-09-04 23:28:21,847 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2020-09-04 23:28:21,952 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-09-04 23:28:22,138 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:22,523 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2020-09-04 23:28:22,769 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-09-04 23:28:22,966 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:23,220 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:23,417 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:23,536 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-09-04 23:28:23,713 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-09-04 23:28:23,912 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:24,649 WARN L193 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2020-09-04 23:28:25,032 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-09-04 23:28:25,549 WARN L193 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2020-09-04 23:28:25,659 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-09-04 23:28:26,873 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2020-09-04 23:28:27,043 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2020-09-04 23:28:28,076 WARN L193 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2020-09-04 23:28:28,321 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:28,659 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-09-04 23:28:28,786 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-09-04 23:28:29,136 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-09-04 23:28:29,830 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-09-04 23:28:31,466 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2020-09-04 23:28:31,998 WARN L193 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-09-04 23:28:32,736 WARN L193 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2020-09-04 23:28:33,121 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-09-04 23:28:33,429 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2020-09-04 23:28:33,906 WARN L193 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-09-04 23:28:35,374 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2020-09-04 23:28:35,517 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-09-04 23:28:35,630 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-09-04 23:28:35,828 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2020-09-04 23:28:37,402 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2020-09-04 23:28:37,957 WARN L193 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2020-09-04 23:28:38,484 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2020-09-04 23:28:39,216 WARN L193 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2020-09-04 23:28:39,475 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-09-04 23:28:39,674 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:39,794 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-09-04 23:28:39,914 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-09-04 23:28:40,380 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-09-04 23:28:40,626 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2020-09-04 23:28:40,954 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2020-09-04 23:28:41,768 WARN L193 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-09-04 23:28:42,326 WARN L193 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-09-04 23:28:42,682 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-09-04 23:28:43,031 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-09-04 23:28:43,292 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-09-04 23:28:43,463 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-09-04 23:28:45,066 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2020-09-04 23:28:45,169 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-09-04 23:28:45,486 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2020-09-04 23:28:46,836 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2020-09-04 23:28:46,957 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-09-04 23:28:47,757 WARN L193 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2020-09-04 23:28:48,272 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 45 [2020-09-04 23:28:49,020 WARN L193 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2020-09-04 23:28:49,367 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-09-04 23:28:49,842 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-09-04 23:28:50,597 WARN L193 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-09-04 23:28:51,140 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-09-04 23:28:51,665 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-09-04 23:28:52,508 WARN L193 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-09-04 23:28:52,912 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-09-04 23:28:53,246 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-09-04 23:28:53,586 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-09-04 23:28:53,780 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:28:54,509 WARN L193 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2020-09-04 23:28:55,798 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2020-09-04 23:28:55,983 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-09-04 23:28:56,553 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2020-09-04 23:28:56,664 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2020-09-04 23:28:57,296 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-09-04 23:28:57,610 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2020-09-04 23:28:57,734 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-09-04 23:28:58,014 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2020-09-04 23:28:58,150 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-09-04 23:28:58,450 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2020-09-04 23:28:58,556 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-09-04 23:28:58,982 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2020-09-04 23:28:59,631 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2020-09-04 23:29:00,071 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-09-04 23:29:00,510 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-09-04 23:29:00,763 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 34 [2020-09-04 23:29:01,101 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-09-04 23:29:01,467 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2020-09-04 23:29:01,641 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2020-09-04 23:29:02,033 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-09-04 23:29:02,274 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:29:03,030 WARN L193 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 64 [2020-09-04 23:29:03,687 WARN L193 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 45 [2020-09-04 23:29:03,885 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:29:03,990 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-09-04 23:29:04,321 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-09-04 23:29:04,635 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-09-04 23:29:06,002 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2020-09-04 23:29:06,854 WARN L193 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-09-04 23:29:07,709 WARN L193 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-09-04 23:29:08,154 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-09-04 23:29:09,815 WARN L193 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2020-09-04 23:29:10,658 WARN L193 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-09-04 23:29:12,085 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2020-09-04 23:29:12,569 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-09-04 23:29:12,817 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:29:13,016 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2020-09-04 23:29:13,710 WARN L193 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2020-09-04 23:29:14,002 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:29:14,427 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2020-09-04 23:29:15,046 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2020-09-04 23:29:15,241 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-09-04 23:29:15,623 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2020-09-04 23:29:15,856 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2020-09-04 23:29:16,094 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-09-04 23:29:16,591 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-09-04 23:29:17,321 WARN L193 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-09-04 23:29:17,700 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-09-04 23:29:18,443 WARN L193 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2020-09-04 23:29:18,886 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-09-04 23:29:19,267 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2020-09-04 23:29:19,275 INFO L264 CegarLoopResult]: At program point immediate_notifyEXIT(lines 326 336) the Hoare annotation is: (let ((.cse8 (= ~m_pc~0 1)) (.cse2 (= ~t1_pc~0 1)) (.cse14 (= ~m_i~0 1))) (let ((.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not .cse14)) (.cse12 (not .cse2)) (.cse1 (= |old(~t1_st~0)| 0)) (.cse10 (and (<= 2 ~m_st~0) (not .cse8) .cse14)) (.cse3 (= ~E_M~0 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse8 .cse11) (or .cse0 .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse7 .cse6 .cse9) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse12 (not (<= ~token~0 .cse13)) (not (<= .cse13 ~token~0)) .cse1 .cse10 (not .cse3) .cse7 (= ~m_st~0 0) .cse11 (not (<= 2 ~E_1~0))))))) [2020-09-04 23:29:19,276 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse6 (= ~E_M~0 0)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse2 (= ~m_pc~0 1)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse4 (not .cse11)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse5 (= ~E_M~0 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse1 (and .cse12 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse1 .cse9) (or .cse0 (not .cse10) .cse11 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse12 (= ~t1_st~0 0)) .cse9) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse13)) (not (<= .cse13 ~token~0)) .cse10 (not .cse5) .cse8 .cse1 .cse3 (not (<= 2 ~E_1~0))))))) [2020-09-04 23:29:19,276 INFO L264 CegarLoopResult]: At program point immediate_notifyFINAL(lines 326 336) the Hoare annotation is: (let ((.cse8 (= ~m_pc~0 1)) (.cse2 (= ~t1_pc~0 1)) (.cse14 (= ~m_i~0 1))) (let ((.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not .cse14)) (.cse12 (not .cse2)) (.cse1 (= |old(~t1_st~0)| 0)) (.cse10 (and (<= 2 ~m_st~0) (not .cse8) .cse14)) (.cse3 (= ~E_M~0 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse8 .cse11) (or .cse0 .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse7 .cse6 .cse9) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse12 (not (<= ~token~0 .cse13)) (not (<= .cse13 ~token~0)) .cse1 .cse10 (not .cse3) .cse7 (= ~m_st~0 0) .cse11 (not (<= 2 ~E_1~0))))))) [2020-09-04 23:29:19,277 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 1)) (.cse18 (= ~m_i~0 1))) (let ((.cse4 (not (<= |old(~token~0)| ~local~0))) (.cse1 (and (<= 2 ~m_st~0) (not .cse2) .cse18)) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse18)) (.cse12 (= ~m_st~0 0)) (.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0)) (.cse5 (= |old(~E_M~0)| 1)) (.cse7 (= |old(~E_M~0)| 0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse1 .cse9 .cse10 (let ((.cse11 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (<= .cse11 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse11) .cse12)) .cse3 .cse13) (or .cse0 .cse4 .cse5 .cse7 .cse8 (and (= ~m_st~0 |old(~m_st~0)|) .cse14 .cse15 .cse16 .cse17) .cse1 .cse6 .cse10 .cse9 .cse3 .cse13) (or .cse0 (and .cse12 .cse14 .cse15 .cse16 .cse17) .cse5 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse6 .cse9 .cse2 .cse13)))) [2020-09-04 23:29:19,277 INFO L264 CegarLoopResult]: At program point L81(lines 81 85) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse4 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_i~0 1))) (.cse8 (= |old(~E_M~0)| 1)) (.cse9 (= |old(~E_M~0)| 0)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (not (= ~t1_pc~0 0))) (.cse2 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (not (= ~t1_i~0 1))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7) (or .cse0 .cse8 .cse9 (not (= |old(~m_st~0)| 0)) .cse10 (= |old(~t1_pc~0)| 1) .cse11 .cse6 (and .cse12 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5) .cse13) (or .cse0 (not (<= |old(~token~0)| ~local~0)) .cse8 .cse9 .cse10 (and .cse1 .cse12 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0) .cse3 .cse5) (not (<= ~local~0 |old(~token~0)|)) .cse11 .cse7 .cse13))) [2020-09-04 23:29:19,277 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse8 (= |old(~E_M~0)| 1)) (.cse9 (= |old(~E_M~0)| 0)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse2 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= |old(~token~0)| ~token~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (not (= ~t1_i~0 1))) (.cse6 (= ~m_pc~0 1)) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7) (or (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0) .cse3 .cse5) .cse0 (not (<= |old(~token~0)| ~local~0)) .cse8 .cse9 .cse10 (not (<= ~local~0 |old(~token~0)|)) .cse11 .cse7 .cse12) (or .cse0 .cse8 .cse9 (not (= |old(~m_st~0)| 0)) .cse10 (and (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5) (= |old(~t1_pc~0)| 1) .cse11 .cse6 .cse12))) [2020-09-04 23:29:19,277 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse5 (= |old(~t1_pc~0)| 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~m_i~0 1))) (.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= ~m_pc~0 1)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (let ((.cse11 (+ |old(~token~0)| 1))) (and .cse10 (= ~t1_pc~0 1) (<= .cse11 ~token~0) (<= ~token~0 .cse11) .cse12 .cse13)) .cse9) (or .cse0 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse5 .cse7 .cse14 .cse9) (or .cse0 (and .cse10 .cse12 .cse13) .cse14 .cse8))) [2020-09-04 23:29:19,277 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 1)) (.cse18 (= ~m_i~0 1))) (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse5 (and (<= 2 ~m_st~0) (not .cse15) .cse18)) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse18)) (.cse10 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 0)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~m_st~0 |old(~m_st~0)|) .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse0 .cse5 .cse15 .cse9) (or .cse0 .cse1 .cse2 (not .cse6) .cse3 .cse4 .cse5 .cse8 .cse7 (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse10 (not (= ~E_M~0 0)) (<= .cse16 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse16) .cse17)) .cse9 .cse14) (or .cse0 (and .cse10 .cse17 .cse11 .cse13 .cse12) .cse2 .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse6 .cse8 .cse15 .cse14)))) [2020-09-04 23:29:19,278 INFO L264 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 1)) (.cse18 (= ~m_i~0 1))) (let ((.cse4 (not (<= |old(~token~0)| ~local~0))) (.cse1 (and (<= 2 ~m_st~0) (not .cse2) .cse18)) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse18)) (.cse12 (= ~m_st~0 0)) (.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0)) (.cse5 (= |old(~E_M~0)| 1)) (.cse7 (= |old(~E_M~0)| 0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse1 .cse9 .cse10 (let ((.cse11 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (<= .cse11 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse11) .cse12)) .cse3 .cse13) (or .cse0 .cse4 .cse5 .cse7 .cse8 (and (= ~m_st~0 |old(~m_st~0)|) .cse14 .cse15 .cse16 .cse17) .cse1 .cse6 .cse10 .cse9 .cse3 .cse13) (or .cse0 (and .cse12 .cse14 .cse15 .cse16 .cse17) .cse5 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse6 .cse9 .cse2 .cse13)))) [2020-09-04 23:29:19,278 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~local~0 |old(~token~0)|))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (= |old(~t1_st~0)| 0)) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse12 (= ~m_pc~0 1)) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (and .cse2 (= ~t1_pc~0 1) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (and .cse2 (= |old(~t1_pc~0)| ~t1_pc~0) .cse3 (= |old(~token~0)| ~token~0) .cse4) .cse12 .cse10) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse5 .cse6 (not (= |old(~m_st~0)| 0)) .cse7 .cse13 .cse9 .cse12 .cse11))) [2020-09-04 23:29:19,278 INFO L264 CegarLoopResult]: At program point transmit1EXIT(lines 74 109) the Hoare annotation is: (let ((.cse6 (<= 2 ~m_st~0)) (.cse16 (= ~m_pc~0 1)) (.cse19 (= ~m_i~0 1))) (let ((.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse0 (not .cse19)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~t1_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse10 (and .cse6 (not .cse16) .cse19)) (.cse13 (not (= ~t1_i~0 1))) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse10 .cse16 .cse14) (or .cse0 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse5 .cse7 .cse17 .cse8 .cse9) .cse4 .cse11 .cse13 .cse16 .cse15) (or .cse0 .cse1 .cse2 (not .cse11) .cse3 .cse4 .cse10 .cse13 .cse12 (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse5 .cse7 (not (= ~E_M~0 0)) (<= .cse18 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse18) .cse17)) .cse14 .cse15)))) [2020-09-04 23:29:19,279 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse6 (<= 2 ~m_st~0)) (.cse16 (= ~m_pc~0 1)) (.cse19 (= ~m_i~0 1))) (let ((.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse0 (not .cse19)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~t1_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse10 (and .cse6 (not .cse16) .cse19)) (.cse13 (not (= ~t1_i~0 1))) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse10 .cse16 .cse14) (or .cse0 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse5 .cse7 .cse17 .cse8 .cse9) .cse4 .cse11 .cse13 .cse16 .cse15) (or .cse0 .cse1 .cse2 (not .cse11) .cse3 .cse4 .cse10 .cse13 .cse12 (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse5 .cse7 (not (= ~E_M~0 0)) (<= .cse18 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse18) .cse17)) .cse14 .cse15)))) [2020-09-04 23:29:19,279 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse6 (= |old(~E_M~0)| 1)) (.cse7 (= |old(~E_M~0)| 0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse10 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1)) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse4 .cse11 (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse1 (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse2))) (or .cse0 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse4 .cse11) (or .cse0 .cse6 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse13 .cse10 .cse3 .cse11))) [2020-09-04 23:29:19,279 INFO L264 CegarLoopResult]: At program point L99-1(line 99) the Hoare annotation is: (let ((.cse11 (= ~m_pc~0 1)) (.cse13 (= ~m_i~0 1))) (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse5 (and (<= 2 ~m_st~0) (not .cse11) .cse13)) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse13)) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse5 .cse11 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 (let ((.cse12 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse12 ~token~0) (<= ~token~0 .cse12) (= ~m_st~0 0))) .cse9 .cse10) (or .cse0 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse6 .cse8 .cse11 .cse10)))) [2020-09-04 23:29:19,280 INFO L264 CegarLoopResult]: At program point L318(line 318) the Hoare annotation is: (let ((.cse23 (= |old(~t1_st~0)| 0)) (.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~m_pc~0 1)) (.cse19 (= ~m_i~0 1)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse8 (<= activate_threads_~tmp~1 0)) (.cse10 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse18 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (and .cse8 .cse10)) (.cse14 (not .cse5)) (.cse9 (= ~m_st~0 0)) (.cse2 (and (<= 2 ~m_st~0) .cse21 .cse8 (not .cse1) .cse10 .cse19 .cse11)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0))) (.cse0 (not .cse19)) (.cse4 (not .cse23)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse15 (not (<= ~token~0 ~local~0))) (.cse12 (not (= ~t1_i~0 1))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse17 (and .cse21 .cse8 .cse10 .cse11))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11) .cse12 .cse1 .cse13) (or .cse0 .cse4 .cse14 .cse7 .cse6 .cse15 .cse12 .cse16 .cse3 .cse13 .cse17) (or .cse0 .cse14 .cse18 .cse6 .cse7 .cse15 .cse12 .cse16 (and (or (and .cse5 .cse19 .cse9) .cse20) .cse21 .cse11)) (or .cse0 .cse14 .cse18 .cse6 .cse7 .cse15 .cse12 .cse1 .cse20 .cse16) (let ((.cse22 (+ ~local~0 1))) (or .cse0 .cse14 (not (<= ~token~0 .cse22)) (not (<= .cse22 ~token~0)) .cse23 (and .cse5 .cse19 .cse9 (<= 1 activate_threads_~tmp~1)) (not .cse6) .cse12 .cse2 .cse3 .cse13)) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse15 .cse12 .cse1 .cse16 .cse17)))) [2020-09-04 23:29:19,282 INFO L264 CegarLoopResult]: At program point L317(lines 317 321) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse1 .cse13 .cse10) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-09-04 23:29:19,282 INFO L264 CegarLoopResult]: At program point L315(line 315) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse1 .cse13 .cse10) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-09-04 23:29:19,282 INFO L264 CegarLoopResult]: At program point L317-2(lines 301 325) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= |old(~t1_st~0)| 0)) (.cse21 (<= 2 ~m_st~0)) (.cse20 (= ~m_pc~0 1)) (.cse25 (= ~m_i~0 1)) (.cse22 (= ~t1_pc~0 1)) (.cse23 (<= activate_threads_~tmp~1 0)) (.cse24 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse12 (and .cse23 .cse24)) (.cse1 (not .cse22)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and .cse21 .cse23 (not .cse20) .cse25 .cse24)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse11 (= ~m_st~0 0)) (.cse0 (not .cse25)) (.cse13 (not .cse19)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse16 (and .cse9 .cse23 .cse24 .cse10))) (and (let ((.cse7 (or .cse11 .cse12))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= ~t1_st~0 0) .cse7) .cse8 (and .cse9 .cse7 .cse10))) (or .cse0 .cse13 .cse1 .cse14 .cse4 .cse3 .cse5 .cse6 .cse8 .cse15 .cse16 .cse17) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse18)) .cse14 (not (<= .cse18 ~token~0)) .cse19 (and .cse11 (<= 1 activate_threads_~tmp~1)) (not .cse3) .cse6 .cse15 .cse17)) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse20 .cse12 .cse8) (or .cse21 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse8 .cse15 .cse17) (or .cse0 .cse14 .cse20 .cse15) (or .cse0 .cse13 .cse22 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse20 .cse17 (and .cse23 .cse24 .cse11 .cse10)) (or .cse0 .cse13 .cse22 .cse3 .cse4 .cse5 .cse6 .cse20 .cse8 .cse16)))) [2020-09-04 23:29:19,283 INFO L264 CegarLoopResult]: At program point L315-1(line 315) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse1 .cse13 .cse10) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-09-04 23:29:19,283 INFO L264 CegarLoopResult]: At program point L315-2(line 315) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse1 .cse13 .cse10) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-09-04 23:29:19,283 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1)) (.cse13 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse13)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse7 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse9 (not .cse2)) (.cse3 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse7 .cse10) (or .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse10) (or .cse0 .cse7 .cse11) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse9 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (<= 1 activate_threads_~tmp~1)) .cse13 (not .cse3) .cse6 .cse11 .cse10))))) [2020-09-04 23:29:19,284 INFO L264 CegarLoopResult]: At program point L309(lines 309 313) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0)) (.cse15 (= ~t1_pc~0 1)) (.cse18 (= |old(~t1_st~0)| 0)) (.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (<= activate_threads_~tmp~1 0)) (.cse2 (= ~m_pc~0 1)) (.cse12 (< 0 (+ activate_threads_~tmp~1 1))) (.cse21 (= ~m_i~0 1)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (and .cse10 .cse11 (not .cse2) .cse12 .cse21 .cse13)) (.cse0 (not .cse21)) (.cse14 (not .cse18)) (.cse4 (not .cse15)) (.cse6 (= ~E_M~0 0)) (.cse5 (= ~E_M~0 1)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse16 (and .cse10 .cse20 .cse11 .cse12)) (.cse19 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13)) (or .cse0 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 .cse16) (let ((.cse17 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse17)) (not (<= .cse17 ~token~0)) (and .cse10 .cse13 (<= 1 activate_threads_~tmp~1)) .cse18 .cse1 (not .cse5) .cse8 .cse3 .cse19)) (or .cse0 .cse14 (and .cse20 .cse11 .cse12 (= ~m_st~0 0)) .cse15 (not (= |old(~m_st~0)| 0)) .cse5 .cse6 .cse8 .cse2 .cse19) (or .cse0 .cse14 .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse3 .cse16 .cse19)))) [2020-09-04 23:29:19,284 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~t1_st~0 0)) (.cse16 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse16)) (.cse6 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse2 (= ~m_pc~0 1)) (.cse10 (and .cse17 .cse14)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (not .cse13)) (.cse7 (= ~E_M~0 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse1 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse12) (or .cse0 .cse4 .cse13 (not (= |old(~m_st~0)| 0)) .cse7 .cse6 (and .cse14 (= ~m_st~0 0)) .cse9 .cse2 .cse12) (or .cse0 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse6 .cse8 .cse9 .cse1 .cse11) (or .cse0 .cse4 .cse13 .cse7 .cse6 .cse8 .cse9 .cse2 .cse10 .cse11) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse5 (not (<= ~token~0 .cse15)) (not (<= .cse15 ~token~0)) .cse16 (not .cse7) .cse9 .cse1 .cse3 .cse12))))) [2020-09-04 23:29:19,285 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse13) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-09-04 23:29:19,285 INFO L264 CegarLoopResult]: At program point L307-1(line 307) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 1)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~m_i~0 1)) (.cse2 (= ~t1_pc~0 1)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (<= |activate_threads_#t~ret4| 0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (<= 0 |activate_threads_#t~ret4|)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse20)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (and .cse15 .cse10 .cse11 .cse12)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse14 (not .cse2)) (.cse3 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0))) (.cse0 (not .cse21)) (.cse18 (and .cse15 .cse10 .cse12 (not .cse7) .cse21 .cse16)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse7 (and .cse10 .cse11 .cse12 (= ~m_st~0 0)) .cse13) (or .cse0 .cse14 (and .cse15 .cse10 .cse12 .cse16) (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse1 .cse14 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse17 .cse13) (let ((.cse19 (+ ~local~0 1))) (or .cse0 .cse18 .cse14 (not (<= ~token~0 .cse19)) (and (<= 1 |activate_threads_#t~ret4|) .cse15 .cse16) (not (<= .cse19 ~token~0)) .cse20 (not .cse3) .cse6 .cse17 .cse13)) (or .cse0 .cse18 .cse7 .cse17)))) [2020-09-04 23:29:19,286 INFO L264 CegarLoopResult]: At program point L307-2(line 307) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 1)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~m_i~0 1)) (.cse2 (= ~t1_pc~0 1)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (<= |activate_threads_#t~ret4| 0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (<= 0 |activate_threads_#t~ret4|)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse20)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (and .cse15 .cse10 .cse11 .cse12)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse14 (not .cse2)) (.cse3 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0))) (.cse0 (not .cse21)) (.cse18 (and .cse15 .cse10 .cse12 (not .cse7) .cse21 .cse16)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse7 (and .cse10 .cse11 .cse12 (= ~m_st~0 0)) .cse13) (or .cse0 .cse14 (and .cse15 .cse10 .cse12 .cse16) (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse1 .cse14 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse17 .cse13) (let ((.cse19 (+ ~local~0 1))) (or .cse0 .cse18 .cse14 (not (<= ~token~0 .cse19)) (and (<= 1 |activate_threads_#t~ret4|) .cse15 .cse16) (not (<= .cse19 ~token~0)) .cse20 (not .cse3) .cse6 .cse17 .cse13)) (or .cse0 .cse18 .cse7 .cse17)))) [2020-09-04 23:29:19,286 INFO L264 CegarLoopResult]: At program point L307-3(line 307) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse23 (= ~m_i~0 1)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (<= |activate_threads_#t~ret4| 0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (<= activate_threads_~tmp~1 0)) (.cse10 (<= 0 |activate_threads_#t~ret4|)) (.cse11 (< 0 (+ activate_threads_~tmp~1 1))) (.cse22 (= |old(~t1_st~0)| 0)) (.cse2 (= ~t1_pc~0 1))) (let ((.cse12 (not (<= 2 ~E_1~0))) (.cse13 (not .cse2)) (.cse1 (not .cse22)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse14 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse17 (and .cse19 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse18 (and .cse19 .cse7 .cse9 .cse10 (not .cse6) .cse11 .cse23 .cse20)) (.cse0 (not .cse23)) (.cse16 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_st~0 0)) .cse12) (or .cse0 .cse1 .cse13 .cse4 .cse3 .cse14 .cse5 .cse15 .cse16 .cse17 .cse12) (let ((.cse21 (+ ~local~0 1))) (or .cse18 .cse0 .cse13 (and (<= 1 |activate_threads_#t~ret4|) .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (not (<= ~token~0 .cse21)) (not (<= .cse21 ~token~0)) .cse22 (not .cse3) .cse5 .cse16 .cse12)) (or .cse0 .cse13 (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse14 (and .cse19 .cse7 .cse9 .cse10 .cse11 .cse20) .cse5 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 .cse17) (or .cse18 .cse0 .cse6 .cse16)))) [2020-09-04 23:29:19,287 INFO L264 CegarLoopResult]: At program point L303(line 303) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~t1_st~0 0)) (.cse16 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse16)) (.cse6 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse2 (= ~m_pc~0 1)) (.cse10 (and .cse17 .cse14)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (not .cse13)) (.cse7 (= ~E_M~0 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse1 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse12) (or .cse0 .cse4 .cse13 (not (= |old(~m_st~0)| 0)) .cse7 .cse6 (and .cse14 (= ~m_st~0 0)) .cse9 .cse2 .cse12) (or .cse0 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse6 .cse8 .cse9 .cse1 .cse11) (or .cse0 .cse4 .cse13 .cse7 .cse6 .cse8 .cse9 .cse2 .cse10 .cse11) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse5 (not (<= ~token~0 .cse15)) (not (<= .cse15 ~token~0)) .cse16 (not .cse7) .cse9 .cse1 .cse3 .cse12))))) [2020-09-04 23:29:19,287 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~t1_st~0 0)) (.cse16 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse16)) (.cse6 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse2 (= ~m_pc~0 1)) (.cse10 (and .cse17 .cse14)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (not .cse13)) (.cse7 (= ~E_M~0 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse1 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse12) (or .cse0 .cse4 .cse13 (not (= |old(~m_st~0)| 0)) .cse7 .cse6 (and .cse14 (= ~m_st~0 0)) .cse9 .cse2 .cse12) (or .cse0 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse6 .cse8 .cse9 .cse1 .cse11) (or .cse0 .cse4 .cse13 .cse7 .cse6 .cse8 .cse9 .cse2 .cse10 .cse11) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse5 (not (<= ~token~0 .cse15)) (not (<= .cse15 ~token~0)) .cse16 (not .cse7) .cse9 .cse1 .cse3 .cse12))))) [2020-09-04 23:29:19,287 INFO L264 CegarLoopResult]: At program point activate_threadsEXIT(lines 301 325) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= |old(~t1_st~0)| 0)) (.cse21 (<= 2 ~m_st~0)) (.cse20 (= ~m_pc~0 1)) (.cse25 (= ~m_i~0 1)) (.cse22 (= ~t1_pc~0 1)) (.cse23 (<= activate_threads_~tmp~1 0)) (.cse24 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse12 (and .cse23 .cse24)) (.cse1 (not .cse22)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and .cse21 .cse23 (not .cse20) .cse25 .cse24)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse11 (= ~m_st~0 0)) (.cse0 (not .cse25)) (.cse13 (not .cse19)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse16 (and .cse9 .cse23 .cse24 .cse10))) (and (let ((.cse7 (or .cse11 .cse12))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= ~t1_st~0 0) .cse7) .cse8 (and .cse9 .cse7 .cse10))) (or .cse0 .cse13 .cse1 .cse14 .cse4 .cse3 .cse5 .cse6 .cse8 .cse15 .cse16 .cse17) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse18)) .cse14 (not (<= .cse18 ~token~0)) .cse19 (and .cse11 (<= 1 activate_threads_~tmp~1)) (not .cse3) .cse6 .cse15 .cse17)) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse20 .cse12 .cse8) (or .cse21 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse8 .cse15 .cse17) (or .cse0 .cse14 .cse20 .cse15) (or .cse0 .cse13 .cse22 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse20 .cse17 (and .cse23 .cse24 .cse11 .cse10)) (or .cse0 .cse13 .cse22 .cse3 .cse4 .cse5 .cse6 .cse20 .cse8 .cse16)))) [2020-09-04 23:29:19,288 INFO L264 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse12)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse11 (not (= ~t1_st~0 0))) (.cse7 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse3 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9)) (or .cse0 (not (<= 2 ~m_st~0)) .cse3 .cse2 (not (<= ~token~0 ~local~0)) .cse4 .cse11 .cse7 (not (<= ~local~0 ~token~0)) .cse9) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse11 .cse7 .cse8 .cse9)))) [2020-09-04 23:29:19,288 INFO L264 CegarLoopResult]: At program point exists_runnable_threadEXIT(lines 174 193) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse12)) (.cse7 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse4 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse5 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) (not (<= .cse2 ~token~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse0 (not (<= 2 ~m_st~0)) .cse4 .cse3 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse10 (not (<= ~local~0 ~token~0)) .cse9) (or .cse0 .cse1 .cse4 .cse3 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse4 .cse3 .cse5 .cse6 .cse11 .cse10 .cse8 .cse9)))) [2020-09-04 23:29:19,288 INFO L264 CegarLoopResult]: At program point L189(line 189) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (<= 2 ~m_st~0)) .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse9 (not (<= ~local~0 ~token~0)) .cse8) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse3 .cse2 .cse4 .cse6 .cse7 .cse8)) (or .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse8)))) [2020-09-04 23:29:19,289 INFO L264 CegarLoopResult]: At program point L183(line 183) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse10)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (<= 2 ~m_st~0)) .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse6 (not (<= ~local~0 ~token~0)) .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse3 .cse2 .cse4 .cse6 .cse7 .cse8)) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse7 .cse8)))) [2020-09-04 23:29:19,289 INFO L264 CegarLoopResult]: At program point L182(lines 182 187) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse10)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse3 .cse2 .cse4 .cse6 .cse7 .cse8)) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse7 .cse8)))) [2020-09-04 23:29:19,289 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-09-04 23:29:19,289 INFO L264 CegarLoopResult]: At program point L179(line 179) the Hoare annotation is: (let ((.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7) (or .cse0 .cse1 (not (= ~t1_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7) (or .cse0 .cse1 (= ~m_pc~0 1)))) [2020-09-04 23:29:19,289 INFO L271 CegarLoopResult]: At program point L178(lines 178 188) the Hoare annotation is: true [2020-09-04 23:29:19,290 INFO L264 CegarLoopResult]: At program point exists_runnable_threadFINAL(lines 174 193) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse12)) (.cse7 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse4 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse5 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) (not (<= .cse2 ~token~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse0 (not (<= 2 ~m_st~0)) .cse4 .cse3 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse10 (not (<= ~local~0 ~token~0)) .cse9) (or .cse0 .cse1 .cse4 .cse3 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse4 .cse3 .cse5 .cse6 .cse11 .cse10 .cse8 .cse9)))) [2020-09-04 23:29:19,290 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredFINAL(lines 129 147) the Hoare annotation is: true [2020-09-04 23:29:19,290 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-09-04 23:29:19,290 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredEXIT(lines 129 147) the Hoare annotation is: true [2020-09-04 23:29:19,290 INFO L271 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: true [2020-09-04 23:29:19,290 INFO L264 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: (let ((.cse10 (= ~t1_st~0 0)) (.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not .cse12)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (= ~m_pc~0 1)) (.cse14 (not .cse10)) (.cse11 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse2 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse10 (not .cse3) .cse6 .cse11 .cse8)) (or .cse0 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse14 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (or .cse0 .cse12 .cse3 .cse4 .cse6 .cse13 .cse14 .cse11 .cse8)))) [2020-09-04 23:29:19,291 INFO L264 CegarLoopResult]: At program point L134(lines 134 139) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0))))) [2020-09-04 23:29:19,291 INFO L271 CegarLoopResult]: At program point L133(lines 133 142) the Hoare annotation is: true [2020-09-04 23:29:19,291 INFO L271 CegarLoopResult]: At program point L133-2(lines 133 142) the Hoare annotation is: true [2020-09-04 23:29:19,291 INFO L264 CegarLoopResult]: At program point L287-1(lines 276 299) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not .cse13)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (and .cse10 (= ~E_M~0 |old(~E_M~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse12 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse1 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9) (or .cse0 .cse3 .cse13 .cse4 .cse5 .cse7 .cse8 .cse11 .cse12 (not (= ~m_st~0 0)))))) [2020-09-04 23:29:19,291 INFO L264 CegarLoopResult]: At program point L283(line 283) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not .cse12)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse5 .cse12 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 (not (= ~m_st~0 0)))))) [2020-09-04 23:29:19,292 INFO L264 CegarLoopResult]: At program point L277-1(lines 276 299) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not .cse12)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse5 .cse12 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 (not (= ~m_st~0 0)))))) [2020-09-04 23:29:19,292 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (not .cse11)) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse10) (or .cse0 .cse1 .cse5 .cse11 .cse6 .cse8 .cse9 .cse3 .cse12 (not (= ~m_st~0 0))) (or .cse0 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10)))) [2020-09-04 23:29:19,292 INFO L264 CegarLoopResult]: At program point L292-1(lines 273 300) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse7 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse8 (not (<= 2 ~m_st~0))) (.cse9 (not .cse2)) (.cse1 (= |old(~E_M~0)| 1)) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) .cse7 (not (= ~m_st~0 0))) (or .cse0 .cse8 .cse9 .cse1 .cse4 .cse3 .cse10 .cse5 .cse6 .cse7 .cse11) (or .cse0 .cse8 .cse9 .cse1 .cse3 .cse4 .cse10 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse11)))) [2020-09-04 23:29:19,292 INFO L264 CegarLoopResult]: At program point L288(line 288) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse2 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not .cse11)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse3 .cse11 .cse5 .cse7 .cse8 .cse2 .cse9 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse10)))) [2020-09-04 23:29:19,293 INFO L264 CegarLoopResult]: At program point L282-1(lines 276 299) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not .cse12)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse5 .cse12 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 (not (= ~m_st~0 0)))))) [2020-09-04 23:29:19,293 INFO L264 CegarLoopResult]: At program point L278(line 278) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (not .cse11)) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse10) (or .cse0 .cse1 .cse5 .cse11 .cse6 .cse8 .cse9 .cse3 .cse12 (not (= ~m_st~0 0))) (or .cse0 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10)))) [2020-09-04 23:29:19,293 INFO L264 CegarLoopResult]: At program point reset_delta_eventsEXIT(lines 273 300) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse7 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse8 (not (<= 2 ~m_st~0))) (.cse9 (not .cse2)) (.cse1 (= |old(~E_M~0)| 1)) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) .cse7 (not (= ~m_st~0 0))) (or .cse0 .cse8 .cse9 .cse1 .cse4 .cse3 .cse10 .cse5 .cse6 .cse7 .cse11) (or .cse0 .cse8 .cse9 .cse1 .cse3 .cse4 .cse10 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse11)))) [2020-09-04 23:29:19,294 INFO L264 CegarLoopResult]: At program point L293(line 293) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse2 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not .cse11)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse3 .cse11 .cse5 .cse7 .cse8 .cse2 .cse9 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse10)))) [2020-09-04 23:29:19,294 INFO L264 CegarLoopResult]: At program point L161(line 161) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-09-04 23:29:19,294 INFO L264 CegarLoopResult]: At program point L160-1(lines 159 172) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-09-04 23:29:19,294 INFO L264 CegarLoopResult]: At program point init_threadsEXIT(lines 156 173) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-09-04 23:29:19,295 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-09-04 23:29:19,295 INFO L264 CegarLoopResult]: At program point L168(line 168) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-09-04 23:29:19,295 INFO L264 CegarLoopResult]: At program point L166(line 166) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-09-04 23:29:19,295 INFO L264 CegarLoopResult]: At program point L165-1(lines 156 173) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-09-04 23:29:19,295 INFO L264 CegarLoopResult]: At program point L163(line 163) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-09-04 23:29:19,295 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-09-04 23:29:19,296 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 462 473) the Hoare annotation is: true [2020-09-04 23:29:19,296 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 462 473) the Hoare annotation is: true [2020-09-04 23:29:19,296 INFO L271 CegarLoopResult]: At program point L471(line 471) the Hoare annotation is: true [2020-09-04 23:29:19,296 INFO L271 CegarLoopResult]: At program point L468(line 468) the Hoare annotation is: true [2020-09-04 23:29:19,296 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-09-04 23:29:19,296 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~t1_i~0 1) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~m_i~0 1) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-09-04 23:29:19,296 INFO L271 CegarLoopResult]: At program point errorEXIT(lines 6 13) the Hoare annotation is: true [2020-09-04 23:29:19,297 INFO L271 CegarLoopResult]: At program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: true [2020-09-04 23:29:19,297 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-09-04 23:29:19,297 INFO L271 CegarLoopResult]: At program point errorFINAL(lines 6 13) the Hoare annotation is: true [2020-09-04 23:29:19,297 INFO L264 CegarLoopResult]: At program point masterEXIT(lines 30 73) the Hoare annotation is: (let ((.cse5 (= ~E_M~0 1)) (.cse6 (= ~E_M~0 0))) (let ((.cse13 (= ~t1_st~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse19 (not .cse6)) (.cse20 (not .cse5)) (.cse14 (<= ~token~0 ~local~0)) (.cse17 (= ~t1_i~0 1)) (.cse15 (<= 2 ~E_1~0)) (.cse18 (= ~m_i~0 1)) (.cse16 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse2 (and (<= 2 ~t1_st~0) .cse12 .cse11 .cse19 .cse20 .cse14 .cse17 .cse15 .cse18 .cse16)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (and .cse12 .cse11 .cse19 .cse13 .cse20 .cse14 .cse17 .cse15 .cse18 .cse16)) (.cse0 (not .cse18)) (.cse3 (= |old(~m_pc~0)| 1)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse10)) .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse11 .cse3 (and .cse12 .cse13 .cse14 .cse15 .cse16) .cse5 .cse6 .cse7 .cse8))))) [2020-09-04 23:29:19,297 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (let ((.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0))) (let ((.cse12 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse18 (not .cse7)) (.cse19 (not .cse6)) (.cse13 (<= ~token~0 ~local~0)) (.cse16 (= ~t1_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse17 (= ~m_i~0 1)) (.cse15 (<= ~local~0 ~token~0))) (let ((.cse0 (and (<= 2 ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) .cse11 .cse18 .cse19 .cse13 .cse16 .cse14 .cse17 .cse15 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not .cse11)) (.cse2 (and .cse11 .cse18 .cse12 .cse19 .cse16 .cse13 .cse14 .cse17 .cse15)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not .cse17)) (.cse4 (= |old(~m_pc~0)| 1)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 .cse2 (not (<= |old(~token~0)| .cse10)) .cse5 .cse7 .cse6 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 .cse11 .cse4 .cse6 .cse7 .cse8 (and .cse12 .cse13 .cse14 .cse15) .cse9))))) [2020-09-04 23:29:19,298 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1))) (let ((.cse7 (= |old(~m_pc~0)| 1)) (.cse4 (not (= ~m_pc~0 1))) (.cse0 (not (= ~m_i~0 1))) (.cse12 (not .cse6)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 1)) (.cse9 (= ~E_M~0 0)) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse14)) (let ((.cse15 (+ |old(~local~0)| 1))) (or .cse0 .cse12 (not (<= |old(~token~0)| .cse15)) .cse13 (and .cse1 .cse2 .cse3 .cse5 .cse14) .cse8 .cse9 .cse10 .cse11 (not (<= .cse15 |old(~token~0)|))))))) [2020-09-04 23:29:19,298 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-09-04 23:29:19,298 INFO L264 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1))) (let ((.cse5 (= |old(~m_pc~0)| 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~m_i~0 1))) (.cse10 (not .cse4)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1)))) (and (or (and .cse0 .cse1 (= ~t1_st~0 0) .cse2) (not (= |old(~t1_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 (and .cse0 .cse1 .cse2 .cse12)) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse3 .cse10 (not (<= |old(~token~0)| .cse13)) .cse11 .cse6 .cse7 (and .cse0 .cse1 .cse12) .cse8 .cse9 (not (<= .cse13 |old(~token~0)|))))))) [2020-09-04 23:29:19,299 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-09-04 23:29:19,299 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse7 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse0 .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse3 .cse4 .cse5 .cse6 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= .cse8 |old(~token~0)|)))) (or .cse0 .cse7 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6)))) [2020-09-04 23:29:19,299 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse5 (= ~E_M~0 1)) (.cse6 (= ~E_M~0 0))) (let ((.cse13 (= ~t1_st~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse19 (not .cse6)) (.cse20 (not .cse5)) (.cse14 (<= ~token~0 ~local~0)) (.cse17 (= ~t1_i~0 1)) (.cse15 (<= 2 ~E_1~0)) (.cse18 (= ~m_i~0 1)) (.cse16 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse2 (and (<= 2 ~t1_st~0) .cse12 .cse11 .cse19 .cse20 .cse14 .cse17 .cse15 .cse18 .cse16)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (and .cse12 .cse11 .cse19 .cse13 .cse20 .cse14 .cse17 .cse15 .cse18 .cse16)) (.cse0 (not .cse18)) (.cse3 (= |old(~m_pc~0)| 1)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse10)) .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse11 .cse3 (and .cse12 .cse13 .cse14 .cse15 .cse16) .cse5 .cse6 .cse7 .cse8))))) [2020-09-04 23:29:19,300 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse8 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not .cse8)) (.cse9 (= |old(~m_pc~0)| 1)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (= ~E_M~0 1)) (.cse5 (= ~E_M~0 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse2 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse8 .cse9 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-09-04 23:29:19,300 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-09-04 23:29:19,301 INFO L264 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0))) (let ((.cse6 (= ~t1_st~0 0)) (.cse1 (= ~t1_pc~0 1)) (.cse16 (not .cse4)) (.cse17 (not .cse3)) (.cse7 (<= ~token~0 ~local~0)) (.cse18 (= ~t1_i~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse19 (= ~m_i~0 1)) (.cse9 (<= ~local~0 ~token~0))) (let ((.cse11 (and (<= 2 ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse16 .cse17 .cse7 .cse18 .cse8 .cse19 .cse9 (= |old(~t1_st~0)| ~t1_st~0))) (.cse0 (not .cse19)) (.cse12 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not .cse18)) (.cse15 (and .cse1 .cse16 .cse6 .cse17 .cse7 .cse18 .cse8 .cse19 .cse9))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse11 .cse0 .cse12 (not (<= |old(~token~0)| .cse13)) .cse14 .cse4 .cse3 .cse5 .cse10 .cse15 (not (<= .cse13 |old(~token~0)|)))) (or .cse11 .cse0 .cse12 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse15))))) [2020-09-04 23:29:19,301 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse6 (not .cse14)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (not (= ~m_i~0 1))) (.cse7 (= |old(~m_pc~0)| 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (<= ~local~0 ~token~0)) (.cse9 (= ~E_M~0 1)) (.cse10 (= ~E_M~0 0)) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse12 (not (= ~t1_i~0 1)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse6 (not (<= |old(~token~0)| .cse13)) .cse8 .cse9 .cse10 (and .cse1 .cse2 .cse4 .cse5) .cse11 .cse12 (not (<= .cse13 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse14 .cse7 (and .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4) .cse9 .cse10 .cse11 .cse12)))) [2020-09-04 23:29:19,304 INFO L264 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse5 (= ~E_M~0 0)) (.cse4 (= ~E_M~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse12 (= ~t1_st~0 0)) (.cse13 (<= ~token~0 ~local~0)) (.cse16 (= ~m_i~0 1)) (.cse14 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (and .cse11 .cse12 .cse13 .cse16 .cse14)) (.cse9 (and (<= 2 ~t1_st~0) .cse11 (= ~m_st~0 |old(~m_st~0)|) (not .cse5) (not .cse4) .cse13 .cse15 .cse16 .cse14 (= |old(~t1_st~0)| ~t1_st~0))) (.cse0 (not .cse16)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse10)) .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse11 .cse2 .cse4 .cse5 .cse7 (and .cse12 .cse13 .cse14) .cse8)))) [2020-09-04 23:29:19,304 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1))) (let ((.cse5 (= |old(~m_pc~0)| 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~m_i~0 1))) (.cse10 (not .cse4)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1)))) (and (or (and .cse0 .cse1 (= ~t1_st~0 0) .cse2) (not (= |old(~t1_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 (and .cse0 .cse1 .cse2 .cse12)) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse3 .cse10 (not (<= |old(~token~0)| .cse13)) .cse11 .cse6 .cse7 (and .cse0 .cse1 .cse12) .cse8 .cse9 (not (<= .cse13 |old(~token~0)|))))))) [2020-09-04 23:29:19,304 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-09-04 23:29:19,305 INFO L264 CegarLoopResult]: At program point L37(lines 37 41) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-09-04 23:29:19,305 INFO L271 CegarLoopResult]: At program point fire_time_eventsEXIT(lines 337 345) the Hoare annotation is: true [2020-09-04 23:29:19,305 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= ~E_M~0 0)) (.cse4 (= ~E_M~0 1)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (= ~M_E~0 |old(~M_E~0)|)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8 .cse9) (or .cse0 .cse1 (= ~m_pc~0 1) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8 .cse9))) [2020-09-04 23:29:19,305 INFO L271 CegarLoopResult]: At program point fire_time_eventsFINAL(lines 337 345) the Hoare annotation is: true [2020-09-04 23:29:19,305 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0)) [2020-09-04 23:29:19,305 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0)) [2020-09-04 23:29:19,306 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,306 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (= ~m_st~0 0) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,306 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,306 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,306 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,306 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,307 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,307 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,307 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-09-04 23:29:19,307 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-09-04 23:29:19,307 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-09-04 23:29:19,307 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0)) [2020-09-04 23:29:19,308 INFO L264 CegarLoopResult]: At program point L225(line 225) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-09-04 23:29:19,308 INFO L264 CegarLoopResult]: At program point L213(lines 213 220) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-09-04 23:29:19,309 INFO L264 CegarLoopResult]: At program point L205(lines 205 209) the Hoare annotation is: (let ((.cse25 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse26 (= ~m_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse16 (= ~t1_st~0 0)) (.cse35 (not (= ~E_M~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse32 (= ~t1_i~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse31 (= ~m_i~0 1)) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse1 (and .cse15 .cse24 .cse34 .cse16 .cse35 .cse17 .cse32 .cse18 .cse19 .cse31 .cse20)) (.cse3 (and .cse23 .cse15 .cse24 .cse34 .cse35 .cse17 .cse32 .cse18 .cse31 .cse20)) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse13 (let ((.cse33 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse33) (<= .cse33 ~token~0) .cse24 .cse34 .cse35 .cse32 .cse18 .cse26 .cse19))) (.cse7 (= |old(~E_M~0)| 1)) (.cse0 (not .cse29)) (.cse22 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse27 (= |old(~token~0)| ~token~0)) (.cse2 (= |old(~E_M~0)| 0)) (.cse8 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse32)) (.cse5 (not .cse31)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 .cse25 .cse31)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse14 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse5 .cse6 .cse7 .cse10 (and .cse22 (or (and .cse23 .cse24 .cse25 .cse26 .cse19 .cse27) (let ((.cse28 (+ |old(~token~0)| 1))) (and .cse23 .cse24 (<= .cse28 ~token~0) (<= ~token~0 .cse28) .cse25 .cse26 .cse19))) .cse21) .cse11 .cse29 (and (= ~local~0 |old(~local~0)|) .cse22 (= ~m_pc~0 |old(~m_pc~0)|) .cse26 .cse19 (= |old(~t1_pc~0)| ~t1_pc~0) .cse30 .cse21 .cse27) .cse13) (or .cse5 .cse7 .cse0 (and (= ~m_st~0 |old(~m_st~0)|) .cse24 .cse22 .cse17 .cse20 .cse30 .cse21 .cse27) .cse2 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse9 .cse10 .cse11 .cse4 .cse12) (or .cse5 .cse14 .cse10 .cse12)))) [2020-09-04 23:29:19,309 INFO L264 CegarLoopResult]: At program point L205-1(lines 200 238) the Hoare annotation is: (let ((.cse25 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse26 (= ~m_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse16 (= ~t1_st~0 0)) (.cse35 (not (= ~E_M~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse32 (= ~t1_i~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse31 (= ~m_i~0 1)) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse1 (and .cse15 .cse24 .cse34 .cse16 .cse35 .cse17 .cse32 .cse18 .cse19 .cse31 .cse20)) (.cse4 (and .cse23 .cse15 .cse24 .cse34 .cse35 .cse17 .cse32 .cse18 .cse19 .cse20)) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse13 (let ((.cse33 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse33) (<= .cse33 ~token~0) .cse24 .cse34 .cse35 .cse32 .cse18 .cse26 .cse19))) (.cse7 (= |old(~E_M~0)| 1)) (.cse0 (not .cse29)) (.cse2 (= |old(~E_M~0)| 0)) (.cse8 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse32)) (.cse22 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse27 (= |old(~token~0)| ~token~0)) (.cse5 (not .cse31)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 .cse25 .cse31)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse14 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse5 .cse6 .cse7 .cse10 (and .cse22 (or (and .cse23 .cse24 .cse25 .cse26 .cse19 .cse27) (let ((.cse28 (+ |old(~token~0)| 1))) (and .cse23 .cse24 (<= .cse28 ~token~0) (<= ~token~0 .cse28) .cse25 .cse26 .cse19))) .cse21) .cse11 .cse29 (and (= ~local~0 |old(~local~0)|) .cse22 (= ~m_pc~0 |old(~m_pc~0)|) .cse26 .cse19 (= |old(~t1_pc~0)| ~t1_pc~0) .cse30 .cse21 .cse27) .cse13) (or .cse5 .cse7 .cse0 .cse2 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse9 .cse10 .cse11 .cse3 (and .cse24 (= ~m_st~0 |old(~m_st~0)|) .cse22 .cse17 .cse19 .cse20 .cse30 .cse21 .cse27) .cse12) (or .cse5 .cse14 .cse10 .cse12)))) [2020-09-04 23:29:19,309 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse32 (not (= ~m_pc~0 1))) (.cse15 (= ~local~0 |old(~local~0)|)) (.cse19 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse17 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= ~m_st~0 0)) (.cse30 (<= 2 ~t1_st~0)) (.cse24 (<= 2 ~m_st~0)) (.cse36 (not (= ~E_M~0 0))) (.cse25 (= ~t1_st~0 0)) (.cse37 (not (= ~E_M~0 1))) (.cse41 (= ~t1_i~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (not (= eval_~tmp~0 0))) (.cse35 (= ~m_i~0 1)) (.cse39 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (= ~t1_pc~0 1)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (<= ~token~0 ~local~0)) (.cse29 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (= |old(~token~0)| ~token~0)) (.cse34 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse34)) (.cse3 (and .cse39 .cse31 .cse16 .cse26 .cse29 .cse20 .cse21 .cse22)) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (and .cse24 .cse31 .cse36 .cse25 .cse37 .cse26 .cse41 .cse27 .cse28 .cse35 .cse29)) (.cse4 (= |old(~E_M~0)| 0)) (.cse9 (not .cse41)) (.cse12 (and .cse30 .cse24 .cse31 .cse36 .cse37 .cse26 .cse41 .cse27 .cse28 .cse29)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse14 (and .cse36 .cse37 (let ((.cse42 (+ ~local~0 1))) (let ((.cse38 (<= ~token~0 .cse42)) (.cse40 (<= .cse42 ~token~0))) (or (and .cse38 .cse15 .cse39 .cse18 .cse19 .cse21 .cse30 .cse40 .cse31 .cse16 .cse17 .cse41 .cse35 .cse20 .cse22) (and .cse30 .cse38 .cse40 .cse31 .cse41 .cse27 .cse18 .cse28 .cse35)))))) (.cse0 (not .cse35)) (.cse23 (= |old(~m_pc~0)| 1)) (.cse7 (and .cse24 .cse32 .cse35)) (.cse10 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse11 .cse4 .cse9 .cse12 .cse0 .cse13 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse14 .cse10) (or (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse11 .cse23 .cse4 (not (= |old(~m_st~0)| 0)) .cse9 .cse12 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse21) .cse0 .cse13 .cse1 .cse7 (and .cse16 (or (and .cse30 .cse31 .cse32 .cse18 .cse28 .cse22) (let ((.cse33 (+ |old(~token~0)| 1))) (and .cse30 .cse31 (<= .cse33 ~token~0) (<= ~token~0 .cse33) .cse32 .cse18 .cse28))) .cse21) .cse8 .cse34 .cse14) (or .cse0 .cse23 .cse7 .cse10)))) [2020-09-04 23:29:19,310 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse13 (not (= ~m_pc~0 1))) (.cse23 (= ~m_i~0 1)) (.cse18 (<= 2 ~m_st~0)) (.cse12 (= ~t1_pc~0 1)) (.cse19 (<= ~token~0 ~local~0)) (.cse24 (= ~t1_i~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse20 (<= 2 ~E_1~0)) (.cse15 (not (= eval_~tmp~0 0))) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse22)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (and .cse18 .cse12 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse19 .cse24 .cse14 .cse20 .cse15 .cse21)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse24)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not .cse23)) (.cse17 (= |old(~m_pc~0)| 1)) (.cse6 (and .cse18 .cse13 .cse23)) (.cse9 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 (and (not .cse12) (= ~E_1~0 |old(~E_1~0)|) .cse13 .cse14 (= ~m_st~0 0) .cse15 .cse16 (= |old(~token~0)| ~token~0)) .cse17 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse18 .cse19 .cse14 .cse20 .cse15 .cse21 .cse16) .cse8 .cse0 .cse10 .cse1 .cse6 .cse7 .cse22)) (or .cse0 .cse17 .cse6 .cse9)))) [2020-09-04 23:29:19,310 INFO L264 CegarLoopResult]: At program point L226(line 226) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-09-04 23:29:19,310 INFO L264 CegarLoopResult]: At program point L226-1(line 226) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-09-04 23:29:19,311 INFO L264 CegarLoopResult]: At program point L226-2(line 226) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-09-04 23:29:19,311 INFO L264 CegarLoopResult]: At program point evalEXIT(lines 194 244) the Hoare annotation is: (let ((.cse18 (= ~m_i~0 1)) (.cse17 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse13 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse15)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse16 (and (<= 2 ~t1_st~0) .cse17 .cse3 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse4 (<= 2 ~E_1~0) .cse5)) (.cse0 (not .cse18)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse9 (and .cse17 (not (= ~m_pc~0 1)) .cse18)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and (= ~m_st~0 |old(~m_st~0)|) .cse3 (= ~E_1~0 |old(~E_1~0)|) .cse4 .cse5 (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) .cse6 .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse1 .cse14 .cse6 (not (= |old(~m_st~0)| 0)) .cse9 .cse10 .cse15 .cse11 .cse16) (or .cse0 .cse13 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (or .cse0 .cse14 .cse9 .cse12)))) [2020-09-04 23:29:19,311 INFO L264 CegarLoopResult]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse25 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse26 (= ~m_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse16 (= ~t1_st~0 0)) (.cse35 (not (= ~E_M~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse32 (= ~t1_i~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse31 (= ~m_i~0 1)) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse1 (and .cse15 .cse24 .cse34 .cse16 .cse35 .cse17 .cse32 .cse18 .cse19 .cse31 .cse20)) (.cse4 (and .cse23 .cse15 .cse24 .cse34 .cse35 .cse17 .cse32 .cse18 .cse19 .cse20)) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse13 (let ((.cse33 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse33) (<= .cse33 ~token~0) .cse24 .cse34 .cse35 .cse32 .cse18 .cse26 .cse19))) (.cse7 (= |old(~E_M~0)| 1)) (.cse0 (not .cse29)) (.cse2 (= |old(~E_M~0)| 0)) (.cse8 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse32)) (.cse22 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse27 (= |old(~token~0)| ~token~0)) (.cse5 (not .cse31)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 .cse25 .cse31)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse14 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse5 .cse6 .cse7 .cse10 (and .cse22 (or (and .cse23 .cse24 .cse25 .cse26 .cse19 .cse27) (let ((.cse28 (+ |old(~token~0)| 1))) (and .cse23 .cse24 (<= .cse28 ~token~0) (<= ~token~0 .cse28) .cse25 .cse26 .cse19))) .cse21) .cse11 .cse29 (and (= ~local~0 |old(~local~0)|) .cse22 (= ~m_pc~0 |old(~m_pc~0)|) .cse26 .cse19 (= |old(~t1_pc~0)| ~t1_pc~0) .cse30 .cse21 .cse27) .cse13) (or .cse5 .cse7 .cse0 .cse2 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse9 .cse10 .cse11 .cse3 (and .cse24 (= ~m_st~0 |old(~m_st~0)|) .cse22 .cse17 .cse19 .cse20 .cse30 .cse21 .cse27) .cse12) (or .cse5 .cse14 .cse10 .cse12)))) [2020-09-04 23:29:19,312 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse18 (= ~m_i~0 1)) (.cse17 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse13 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse15)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse16 (and (<= 2 ~t1_st~0) .cse17 .cse3 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse4 (<= 2 ~E_1~0) .cse5)) (.cse0 (not .cse18)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse9 (and .cse17 (not (= ~m_pc~0 1)) .cse18)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and (= ~m_st~0 |old(~m_st~0)|) .cse3 (= ~E_1~0 |old(~E_1~0)|) .cse4 .cse5 (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) .cse6 .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse1 .cse14 .cse6 (not (= |old(~m_st~0)| 0)) .cse9 .cse10 .cse15 .cse11 .cse16) (or .cse0 .cse13 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (or .cse0 .cse14 .cse9 .cse12)))) [2020-09-04 23:29:19,312 INFO L264 CegarLoopResult]: At program point L227(lines 227 234) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-09-04 23:29:19,312 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse13 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (= ~local~0 |old(~local~0)|)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (= |old(~m_pc~0)| 1)) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse4 (= ~t1_st~0 0)) (.cse0 (not (= ~m_i~0 1))) (.cse9 (= |old(~E_M~0)| 1)) (.cse18 (not .cse13)) (.cse11 (= |old(~E_M~0)| 0)) (.cse19 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse20 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse12 (not (<= 2 |old(~E_1~0)|))) (.cse14 (not (= ~t1_i~0 1))) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (= ~t1_pc~0 1)) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse22 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 (not (= |old(~m_st~0)| 0)) .cse12 .cse13 .cse14) (or .cse0 (and .cse2 .cse15 .cse3 .cse5 .cse6 .cse16 .cse7 .cse8) .cse10 .cse17) (or .cse0 .cse1 .cse9 .cse18 .cse11 .cse19 .cse20 (and .cse15 .cse21 .cse3 .cse4 .cse5 .cse22 .cse23 .cse7 .cse8) .cse12 .cse14 .cse17) (or .cse0 .cse9 .cse18 .cse11 .cse19 (not (<= 2 |old(~t1_st~0)|)) .cse20 .cse12 .cse14 (and .cse15 .cse21 .cse3 .cse5 .cse22 .cse23 .cse16 .cse7 .cse8) .cse17)))) [2020-09-04 23:29:19,313 INFO L264 CegarLoopResult]: At program point L215(line 215) the Hoare annotation is: (let ((.cse13 (<= 2 ~t1_st~0)) (.cse14 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 0)) (.cse20 (not (= eval_~tmp~0 0))) (.cse24 (= ~t1_i~0 1)) (.cse18 (= ~m_i~0 1)) (.cse22 (= |old(~t1_pc~0)| 1))) (let ((.cse4 (not .cse22)) (.cse6 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse7 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse18)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not .cse24)) (.cse11 (let ((.cse23 (+ ~local~0 1))) (and .cse13 (<= ~token~0 .cse23) (<= .cse23 ~token~0) .cse14 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse24 (<= 2 ~E_1~0) .cse18 .cse17 .cse20)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse4 .cse5 .cse6 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse8 .cse9 .cse2) (or .cse0 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse2 .cse11) (let ((.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse19 (= |old(~token~0)| ~token~0))) (or .cse0 .cse10 (and .cse12 (let ((.cse16 (not (= ~m_pc~0 1)))) (or (let ((.cse15 (+ |old(~token~0)| 1))) (and .cse13 .cse14 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse16 .cse17 .cse18)) (and .cse13 .cse14 .cse16 .cse17 .cse18 .cse19))) .cse20 .cse21) .cse3 .cse1 .cse5 (not (= |old(~m_st~0)| 0)) .cse8 .cse22 .cse9 (and (= ~local~0 |old(~local~0)|) .cse12 (= ~m_pc~0 |old(~m_pc~0)|) .cse17 .cse20 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse21 .cse19) .cse11))))) [2020-09-04 23:29:19,313 INFO L264 CegarLoopResult]: At program point L211(line 211) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-09-04 23:29:19,313 INFO L264 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse23 (not (= ~m_pc~0 1))) (.cse18 (= ~m_st~0 0)) (.cse31 (= ~t1_st~0 0)) (.cse33 (= ~m_i~0 1)) (.cse19 (not (= |eval_#t~ret1| 0))) (.cse22 (<= 2 ~t1_st~0)) (.cse30 (<= 2 ~m_st~0)) (.cse4 (= ~t1_pc~0 1)) (.cse35 (not (= ~E_M~0 0))) (.cse36 (not (= ~E_M~0 1))) (.cse6 (<= ~token~0 ~local~0)) (.cse32 (<= 2 ~E_1~0)) (.cse24 (not (= eval_~tmp~0 0))) (.cse7 (<= ~local~0 ~token~0)) (.cse37 (= ~t1_i~0 1)) (.cse28 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse28)) (.cse11 (= |old(~E_M~0)| 0)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= |old(~token~0)| ~token~0)) (.cse16 (not .cse37)) (.cse21 (and .cse22 .cse30 .cse4 .cse35 .cse36 .cse6 .cse37 .cse32 .cse24 .cse7)) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse27 (and .cse30 .cse4 .cse35 .cse31 .cse36 .cse6 .cse37 .cse32 .cse24 .cse33 .cse7 .cse19)) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse13 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= 2 |old(~E_1~0)|))) (.cse29 (let ((.cse34 (+ ~local~0 1))) (and .cse22 (<= ~token~0 .cse34) (<= .cse34 ~token~0) .cse4 .cse35 .cse36 .cse37 .cse32 .cse18 .cse24 .cse19))) (.cse0 (not .cse33)) (.cse20 (= |old(~m_pc~0)| 1)) (.cse14 (and .cse30 .cse23 .cse33)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse13 .cse14 .cse15 .cse16 .cse17) (or (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse18 (= |old(~t1_pc~0)| ~t1_pc~0) .cse19 .cse8 .cse9 .cse10) .cse20 .cse11 (not (= |old(~m_st~0)| 0)) .cse16 .cse21 (and .cse5 (or (and .cse22 .cse4 .cse23 .cse18 .cse24 .cse19 .cse10) (let ((.cse25 (+ |old(~token~0)| 1))) (and .cse22 .cse4 (<= .cse25 ~token~0) (<= ~token~0 .cse25) .cse23 .cse18 .cse24 .cse19))) .cse9) .cse0 .cse26 .cse1 .cse27 .cse14 .cse15 .cse28 .cse29 (and .cse30 .cse31 .cse6 .cse32 .cse24 .cse7 .cse19 .cse9)) (or .cse2 .cse11 (and .cse4 .cse3 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10) .cse16 .cse21 .cse0 .cse26 .cse1 .cse27 .cse12 .cse13 .cse14 .cse15 .cse29 .cse17) (or .cse0 .cse20 .cse14 .cse17)))) [2020-09-04 23:29:19,314 INFO L264 CegarLoopResult]: At program point L203-1(line 203) the Hoare annotation is: (let ((.cse23 (not (= ~m_pc~0 1))) (.cse18 (= ~m_st~0 0)) (.cse31 (= ~t1_st~0 0)) (.cse33 (= ~m_i~0 1)) (.cse19 (not (= |eval_#t~ret1| 0))) (.cse22 (<= 2 ~t1_st~0)) (.cse30 (<= 2 ~m_st~0)) (.cse4 (= ~t1_pc~0 1)) (.cse35 (not (= ~E_M~0 0))) (.cse36 (not (= ~E_M~0 1))) (.cse6 (<= ~token~0 ~local~0)) (.cse32 (<= 2 ~E_1~0)) (.cse24 (not (= eval_~tmp~0 0))) (.cse7 (<= ~local~0 ~token~0)) (.cse37 (= ~t1_i~0 1)) (.cse28 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse28)) (.cse11 (= |old(~E_M~0)| 0)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= |old(~token~0)| ~token~0)) (.cse16 (not .cse37)) (.cse21 (and .cse22 .cse30 .cse4 .cse35 .cse36 .cse6 .cse37 .cse32 .cse24 .cse7)) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse27 (and .cse30 .cse4 .cse35 .cse31 .cse36 .cse6 .cse37 .cse32 .cse24 .cse33 .cse7 .cse19)) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse13 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= 2 |old(~E_1~0)|))) (.cse29 (let ((.cse34 (+ ~local~0 1))) (and .cse22 (<= ~token~0 .cse34) (<= .cse34 ~token~0) .cse4 .cse35 .cse36 .cse37 .cse32 .cse18 .cse24 .cse19))) (.cse0 (not .cse33)) (.cse20 (= |old(~m_pc~0)| 1)) (.cse14 (and .cse30 .cse23 .cse33)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse13 .cse14 .cse15 .cse16 .cse17) (or (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse18 (= |old(~t1_pc~0)| ~t1_pc~0) .cse19 .cse8 .cse9 .cse10) .cse20 .cse11 (not (= |old(~m_st~0)| 0)) .cse16 .cse21 (and .cse5 (or (and .cse22 .cse4 .cse23 .cse18 .cse24 .cse19 .cse10) (let ((.cse25 (+ |old(~token~0)| 1))) (and .cse22 .cse4 (<= .cse25 ~token~0) (<= ~token~0 .cse25) .cse23 .cse18 .cse24 .cse19))) .cse9) .cse0 .cse26 .cse1 .cse27 .cse14 .cse15 .cse28 .cse29 (and .cse30 .cse31 .cse6 .cse32 .cse24 .cse7 .cse19 .cse9)) (or .cse2 .cse11 (and .cse4 .cse3 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10) .cse16 .cse21 .cse0 .cse26 .cse1 .cse27 .cse12 .cse13 .cse14 .cse15 .cse29 .cse17) (or .cse0 .cse20 .cse14 .cse17)))) [2020-09-04 23:29:19,315 INFO L264 CegarLoopResult]: At program point L203-2(line 203) the Hoare annotation is: (let ((.cse26 (not (= ~m_pc~0 1))) (.cse23 (= ~m_st~0 0)) (.cse30 (= ~t1_st~0 0)) (.cse22 (not (= eval_~tmp~0 0))) (.cse24 (not (= |eval_#t~ret1| 0))) (.cse25 (<= 2 ~t1_st~0)) (.cse29 (<= 2 ~m_st~0)) (.cse14 (= ~t1_pc~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse35 (not (= ~E_M~0 1))) (.cse16 (<= ~token~0 ~local~0)) (.cse36 (= ~t1_i~0 1)) (.cse31 (<= 2 ~E_1~0)) (.cse32 (= ~m_i~0 1)) (.cse17 (<= ~local~0 ~token~0)) (.cse28 (= |old(~t1_pc~0)| 1))) (let ((.cse0 (not .cse28)) (.cse8 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (= |old(~E_M~0)| 0)) (.cse2 (and .cse25 .cse29 .cse14 .cse34 .cse35 .cse16 .cse36 .cse31 .cse32 .cse17)) (.cse3 (not .cse36)) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= ~E_1~0 |old(~E_1~0)|)) (.cse20 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~t1_st~0)| 0))) (.cse6 (= |old(~E_M~0)| 1)) (.cse7 (and .cse29 .cse14 .cse34 .cse30 .cse35 .cse16 .cse36 .cse31 .cse22 .cse32 .cse17 .cse24)) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (let ((.cse33 (+ ~local~0 1))) (and .cse25 (<= ~token~0 .cse33) (<= .cse33 ~token~0) .cse14 .cse34 .cse35 .cse36 .cse31 .cse23 .cse22 .cse32 .cse24))) (.cse4 (not .cse32)) (.cse21 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse29 .cse26 .cse32)) (.cse13 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse6 .cse0 (and (= ~m_st~0 |old(~m_st~0)|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse1 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse9 .cse10 .cse11 .cse3 .cse13) (or .cse21 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and (= ~local~0 |old(~local~0)|) .cse15 (= ~m_pc~0 |old(~m_pc~0)|) .cse22 .cse23 (= |old(~t1_pc~0)| ~t1_pc~0) .cse24 .cse18 .cse19 .cse20) (and .cse15 (or (and .cse25 .cse14 .cse26 .cse23 .cse22 .cse24 .cse20) (let ((.cse27 (+ |old(~token~0)| 1))) (and .cse25 .cse14 (<= .cse27 ~token~0) (<= ~token~0 .cse27) .cse26 .cse23 .cse22 .cse24))) .cse19) .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse28 (and .cse29 .cse30 .cse16 .cse31 .cse22 .cse17 .cse24 .cse19) .cse12) (or .cse4 .cse21 .cse10 .cse13)))) [2020-09-04 23:29:19,315 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse32 (not (= ~m_pc~0 1))) (.cse15 (= ~local~0 |old(~local~0)|)) (.cse19 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse17 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= ~m_st~0 0)) (.cse30 (<= 2 ~t1_st~0)) (.cse24 (<= 2 ~m_st~0)) (.cse36 (not (= ~E_M~0 0))) (.cse25 (= ~t1_st~0 0)) (.cse37 (not (= ~E_M~0 1))) (.cse41 (= ~t1_i~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (not (= eval_~tmp~0 0))) (.cse35 (= ~m_i~0 1)) (.cse39 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (= ~t1_pc~0 1)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (<= ~token~0 ~local~0)) (.cse29 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (= |old(~token~0)| ~token~0)) (.cse34 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse34)) (.cse3 (and .cse39 .cse31 .cse16 .cse26 .cse29 .cse20 .cse21 .cse22)) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (and .cse24 .cse31 .cse36 .cse25 .cse37 .cse26 .cse41 .cse27 .cse28 .cse35 .cse29)) (.cse4 (= |old(~E_M~0)| 0)) (.cse9 (not .cse41)) (.cse12 (and .cse30 .cse24 .cse31 .cse36 .cse37 .cse26 .cse41 .cse27 .cse28 .cse29)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse14 (and .cse36 .cse37 (let ((.cse42 (+ ~local~0 1))) (let ((.cse38 (<= ~token~0 .cse42)) (.cse40 (<= .cse42 ~token~0))) (or (and .cse38 .cse15 .cse39 .cse18 .cse19 .cse21 .cse30 .cse40 .cse31 .cse16 .cse17 .cse41 .cse35 .cse20 .cse22) (and .cse30 .cse38 .cse40 .cse31 .cse41 .cse27 .cse18 .cse28 .cse35)))))) (.cse0 (not .cse35)) (.cse23 (= |old(~m_pc~0)| 1)) (.cse7 (and .cse24 .cse32 .cse35)) (.cse10 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse11 .cse4 .cse9 .cse12 .cse0 .cse13 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse14 .cse10) (or (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse11 .cse23 .cse4 (not (= |old(~m_st~0)| 0)) .cse9 .cse12 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse21) .cse0 .cse13 .cse1 .cse7 (and .cse16 (or (and .cse30 .cse31 .cse32 .cse18 .cse28 .cse22) (let ((.cse33 (+ |old(~token~0)| 1))) (and .cse30 .cse31 (<= .cse33 ~token~0) (<= ~token~0 .cse33) .cse32 .cse18 .cse28))) .cse21) .cse8 .cse34 .cse14) (or .cse0 .cse23 .cse7 .cse10)))) [2020-09-04 23:29:19,316 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse19 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse16 (not (= eval_~tmp~0 0))) (.cse12 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (not .cse12)) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~m_pc~0)| 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse7 (let ((.cse21 (+ ~local~0 1))) (and .cse19 (<= ~token~0 .cse21) (<= .cse21 ~token~0) .cse13 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= 2 ~E_1~0) .cse16))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse8 .cse9 .cse10) (let ((.cse14 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse17 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 .cse1 .cse2 .cse11 .cse4 (not (= |old(~m_st~0)| 0)) .cse7 .cse8 .cse12 .cse9 (and (not .cse13) .cse14 (= ~t1_st~0 0) .cse15 .cse16 .cse17 .cse18) (and .cse14 .cse16 (or (and .cse19 .cse13 .cse15 .cse18) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse19 .cse13 (<= .cse20 ~token~0) (<= ~token~0 .cse20) .cse15))) .cse17)))))) [2020-09-04 23:29:19,316 INFO L264 CegarLoopResult]: At program point L212(line 212) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-09-04 23:29:19,316 INFO L264 CegarLoopResult]: At program point L212-1(line 212) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-09-04 23:29:19,317 INFO L264 CegarLoopResult]: At program point L212-2(line 212) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-09-04 23:29:19,317 INFO L264 CegarLoopResult]: At program point L229(line 229) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-09-04 23:29:19,317 INFO L271 CegarLoopResult]: At program point stop_simulationFINAL(lines 384 402) the Hoare annotation is: true [2020-09-04 23:29:19,317 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-09-04 23:29:19,317 INFO L271 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: true [2020-09-04 23:29:19,317 INFO L271 CegarLoopResult]: At program point L393(line 393) the Hoare annotation is: true [2020-09-04 23:29:19,317 INFO L271 CegarLoopResult]: At program point L392(lines 392 397) the Hoare annotation is: true [2020-09-04 23:29:19,317 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-09-04 23:29:19,317 INFO L271 CegarLoopResult]: At program point stop_simulationEXIT(lines 384 402) the Hoare annotation is: true [2020-09-04 23:29:19,318 INFO L271 CegarLoopResult]: At program point L390-1(line 390) the Hoare annotation is: true [2020-09-04 23:29:19,318 INFO L271 CegarLoopResult]: At program point L390-2(line 390) the Hoare annotation is: true [2020-09-04 23:29:19,318 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-09-04 23:29:19,318 INFO L271 CegarLoopResult]: At program point L390-3(line 390) the Hoare annotation is: true [2020-09-04 23:29:19,318 INFO L271 CegarLoopResult]: At program point L386(line 386) the Hoare annotation is: true [2020-09-04 23:29:19,318 INFO L271 CegarLoopResult]: At program point update_channelsEXIT(lines 148 155) the Hoare annotation is: true [2020-09-04 23:29:19,318 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-09-04 23:29:19,318 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse2 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 (not .cse4) .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse5 .cse4 .cse6 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-09-04 23:29:19,318 INFO L264 CegarLoopResult]: At program point L254-1(lines 248 271) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (not .cse4) .cse5 .cse2 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse5 .cse4 .cse6 .cse2 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-09-04 23:29:19,318 INFO L264 CegarLoopResult]: At program point L250(line 250) the Hoare annotation is: (let ((.cse2 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 (not .cse4) .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse5 .cse4 .cse6 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-09-04 23:29:19,319 INFO L264 CegarLoopResult]: At program point L265(line 265) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) .cse2) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse2 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 (not .cse4) .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-09-04 23:29:19,319 INFO L264 CegarLoopResult]: At program point L259-1(lines 248 271) the Hoare annotation is: (let ((.cse8 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse2 (= ~t1_pc~0 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (and .cse8 (= ~E_M~0 |old(~E_M~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse9 (= ~m_pc~0 1))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse8 .cse9) (or .cse0 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)))))) [2020-09-04 23:29:19,319 INFO L264 CegarLoopResult]: At program point L255(line 255) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (not .cse4) .cse5 .cse2 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse5 .cse4 .cse6 .cse2 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-09-04 23:29:19,319 INFO L264 CegarLoopResult]: At program point L249-1(lines 248 271) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (not .cse4) .cse5 .cse2 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse5 .cse4 .cse6 .cse2 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-09-04 23:29:19,319 INFO L264 CegarLoopResult]: At program point fire_delta_eventsEXIT(lines 245 272) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~t1_pc~0 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 (not (<= 2 ~m_st~0)) (not .cse2) .cse1 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-09-04 23:29:19,319 INFO L264 CegarLoopResult]: At program point L264-1(lines 245 272) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~t1_pc~0 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 (not (<= 2 ~m_st~0)) (not .cse2) .cse1 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-09-04 23:29:19,319 INFO L264 CegarLoopResult]: At program point L260(line 260) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse2 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 (not .cse4) .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-09-04 23:29:19,320 INFO L264 CegarLoopResult]: At program point L448(line 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,320 INFO L264 CegarLoopResult]: At program point L448-1(line 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,320 INFO L264 CegarLoopResult]: At program point L448-2(line 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,320 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-09-04 23:29:19,320 INFO L271 CegarLoopResult]: At program point start_simulationEXIT(lines 403 461) the Hoare annotation is: true [2020-09-04 23:29:19,320 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-09-04 23:29:19,320 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,321 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,321 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,321 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-09-04 23:29:19,321 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0))) [2020-09-04 23:29:19,321 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,321 INFO L264 CegarLoopResult]: At program point L437(lines 437 446) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,321 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,321 INFO L264 CegarLoopResult]: At program point L450(lines 450 454) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,322 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-09-04 23:29:19,322 INFO L264 CegarLoopResult]: At program point L405(line 405) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-09-04 23:29:19,322 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-09-04 23:29:19,322 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-09-04 23:29:19,322 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-09-04 23:29:19,322 INFO L264 CegarLoopResult]: At program point L426-1(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-09-04 23:29:19,322 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse3 (= ~t1_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse4 (not (= ~E_M~0 1))) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= ~t1_i~0 1)) (and .cse0 .cse8) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-09-04 23:29:19,323 INFO L264 CegarLoopResult]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-09-04 23:29:19,323 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse3 (= ~t1_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse4 (not (= ~E_M~0 1))) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= ~t1_i~0 1)) (and .cse0 .cse8) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-09-04 23:29:19,323 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-09-04 23:29:19,323 INFO L264 CegarLoopResult]: At program point L410(line 410) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-09-04 23:29:19,323 INFO L264 CegarLoopResult]: At program point L439(line 439) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,323 INFO L264 CegarLoopResult]: At program point L406(line 406) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-09-04 23:29:19,323 INFO L264 CegarLoopResult]: At program point L435(line 435) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,323 INFO L264 CegarLoopResult]: At program point L435-1(line 435) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,324 INFO L264 CegarLoopResult]: At program point L435-2(line 435) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,324 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 23:29:19,324 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-09-04 23:29:19,324 INFO L264 CegarLoopResult]: At program point L419(line 419) the Hoare annotation is: (let ((.cse3 (= ~t1_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse4 (not (= ~E_M~0 1))) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= ~t1_i~0 1)) (and .cse0 .cse8) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-09-04 23:29:19,324 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse15 (= ~t1_st~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse16 (<= 0 is_master_triggered_~__retres1~0)) (.cse3 (= ~m_pc~0 1)) (.cse17 (<= is_master_triggered_~__retres1~0 0)) (.cse18 (= ~m_i~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (and .cse16 (not .cse3) .cse17 .cse18)) (.cse12 (not (<= 2 ~E_1~0))) (.cse4 (not .cse13)) (.cse0 (not .cse18)) (.cse5 (and .cse16 .cse17)) (.cse7 (= ~E_M~0 1)) (.cse6 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not .cse15)) (.cse11 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse5 .cse13 .cse7 .cse6 .cse9 .cse3 .cse10 (not (= ~m_st~0 0)) .cse12) (let ((.cse14 (+ ~local~0 1))) (or .cse0 .cse1 .cse4 (not (<= ~token~0 .cse14)) (<= 1 is_master_triggered_~__retres1~0) .cse2 (not (<= .cse14 ~token~0)) .cse15 (not .cse7) .cse9 .cse12)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse5 .cse13 .cse7 .cse6 .cse8 .cse9 .cse3 .cse10 .cse11)))) [2020-09-04 23:29:19,324 INFO L264 CegarLoopResult]: At program point is_master_triggeredFINAL(lines 110 128) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse15 (= ~t1_st~0 0)) (.cse16 (<= 0 |is_master_triggered_#res|)) (.cse17 (<= |is_master_triggered_#res| 0)) (.cse18 (<= 0 is_master_triggered_~__retres1~0)) (.cse7 (= ~m_pc~0 1)) (.cse19 (<= is_master_triggered_~__retres1~0 0)) (.cse20 (= ~m_i~0 1))) (let ((.cse12 (and .cse16 .cse17 .cse18 (not .cse7) .cse19 .cse20)) (.cse11 (not (<= 2 ~m_st~0))) (.cse8 (not .cse15)) (.cse10 (not (<= 2 ~E_1~0))) (.cse0 (not .cse20)) (.cse13 (not .cse1)) (.cse2 (and .cse16 .cse17 .cse18 .cse19)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse10) (or .cse0 .cse11 .cse7 .cse12) (let ((.cse14 (+ ~local~0 1))) (or .cse0 .cse11 .cse13 (not (<= ~token~0 .cse14)) (not (<= .cse14 ~token~0)) .cse15 (not .cse3) .cse6 (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0)) .cse12 .cse10)) (or .cse0 .cse11 .cse13 .cse2 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse9)))) [2020-09-04 23:29:19,325 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse9 (= ~t1_pc~0 1))) (let ((.cse7 (not (<= 2 ~m_st~0))) (.cse1 (not .cse9)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6) (or .cse0 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse8 .cse10 .cse6) (or .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse0 .cse9 .cse2 .cse3 .cse5 .cse8 .cse10 (not (= ~m_st~0 0)) .cse11)))) [2020-09-04 23:29:19,325 INFO L264 CegarLoopResult]: At program point L115(lines 115 120) the Hoare annotation is: (let ((.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse6 (not (= ~t1_i~0 1))) (.cse1 (= ~m_pc~0 1)) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 (not (<= 2 ~m_st~0)) .cse1) (or .cse0 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse1 (not (<= 2 ~t1_st~0)) .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse1 .cse8 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse1 .cse8 (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0))))) [2020-09-04 23:29:19,325 INFO L271 CegarLoopResult]: At program point L114(lines 114 123) the Hoare annotation is: true [2020-09-04 23:29:19,325 INFO L264 CegarLoopResult]: At program point L114-2(lines 114 123) the Hoare annotation is: (let ((.cse0 (+ ~local~0 1))) (or (not (= ~m_i~0 1)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (<= ~token~0 .cse0)) (not (<= .cse0 ~token~0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~E_1~0)))) [2020-09-04 23:29:19,325 INFO L264 CegarLoopResult]: At program point is_master_triggeredEXIT(lines 110 128) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse15 (= ~t1_st~0 0)) (.cse16 (<= 0 |is_master_triggered_#res|)) (.cse17 (<= |is_master_triggered_#res| 0)) (.cse18 (<= 0 is_master_triggered_~__retres1~0)) (.cse7 (= ~m_pc~0 1)) (.cse19 (<= is_master_triggered_~__retres1~0 0)) (.cse20 (= ~m_i~0 1))) (let ((.cse12 (and .cse16 .cse17 .cse18 (not .cse7) .cse19 .cse20)) (.cse11 (not (<= 2 ~m_st~0))) (.cse8 (not .cse15)) (.cse10 (not (<= 2 ~E_1~0))) (.cse0 (not .cse20)) (.cse13 (not .cse1)) (.cse2 (and .cse16 .cse17 .cse18 .cse19)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse10) (or .cse0 .cse11 .cse7 .cse12) (let ((.cse14 (+ ~local~0 1))) (or .cse0 .cse11 .cse13 (not (<= ~token~0 .cse14)) (not (<= .cse14 ~token~0)) .cse15 (not .cse3) .cse6 (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0)) .cse12 .cse10)) (or .cse0 .cse11 .cse13 .cse2 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse9)))) [2020-09-04 23:29:19,326 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-09-04 23:29:19,326 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:29:19,326 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0)) [2020-09-04 23:29:19,326 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 23:29:19,326 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:29:19,326 INFO L264 CegarLoopResult]: At program point L351(line 351) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9))) [2020-09-04 23:29:19,326 INFO L264 CegarLoopResult]: At program point reset_time_eventsEXIT(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse5 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-09-04 23:29:19,326 INFO L264 CegarLoopResult]: At program point L366(line 366) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8))) [2020-09-04 23:29:19,326 INFO L264 CegarLoopResult]: At program point L360-1(lines 349 372) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (and .cse10 (= ~E_M~0 |old(~E_M~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse1 .cse10 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9)))) [2020-09-04 23:29:19,327 INFO L264 CegarLoopResult]: At program point L356(line 356) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-09-04 23:29:19,327 INFO L264 CegarLoopResult]: At program point L350-1(lines 349 372) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-09-04 23:29:19,327 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9))) [2020-09-04 23:29:19,327 INFO L264 CegarLoopResult]: At program point L365-1(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse5 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-09-04 23:29:19,327 INFO L264 CegarLoopResult]: At program point L361(line 361) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8))) [2020-09-04 23:29:19,327 INFO L264 CegarLoopResult]: At program point L355-1(lines 349 372) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-09-04 23:29:19,327 INFO L264 CegarLoopResult]: At program point init_modelFINAL(lines 374 383) the Hoare annotation is: (or (= ~t1_pc~0 1) (= ~E_M~0 1) (= ~E_M~0 0) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (and (= ~t1_i~0 1) (= ~m_i~0 1)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-09-04 23:29:19,328 INFO L264 CegarLoopResult]: At program point init_modelEXIT(lines 374 383) the Hoare annotation is: (or (= ~t1_pc~0 1) (= ~E_M~0 1) (= ~E_M~0 0) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (and (= ~t1_i~0 1) (= ~m_i~0 1)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-09-04 23:29:19,328 INFO L264 CegarLoopResult]: At program point L379(line 379) the Hoare annotation is: (or (= ~t1_pc~0 1) (= ~E_M~0 1) (= ~E_M~0 0) (and (not (= ~t1_i~0 1)) (= ~m_i~0 1)) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-09-04 23:29:19,328 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: (or (= ~t1_pc~0 1) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-09-04 23:29:19,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:29:19 BoogieIcfgContainer [2020-09-04 23:29:19,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:29:19,411 INFO L168 Benchmark]: Toolchain (without parser) took 264594.06 ms. Allocated memory was 138.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 102.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2020-09-04 23:29:19,411 INFO L168 Benchmark]: CDTParser took 0.90 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 23:29:19,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.20 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 88.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 23:29:19,412 INFO L168 Benchmark]: Boogie Preprocessor took 143.56 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 88.9 MB in the beginning and 178.5 MB in the end (delta: -89.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 23:29:19,412 INFO L168 Benchmark]: RCFGBuilder took 705.59 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 141.5 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:29:19,412 INFO L168 Benchmark]: TraceAbstraction took 263323.70 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 141.5 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2020-09-04 23:29:19,421 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.90 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 414.20 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 88.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.56 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 88.9 MB in the beginning and 178.5 MB in the end (delta: -89.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 705.59 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 141.5 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263323.70 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 141.5 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 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: (((((((((((!(m_i == 1) || !(t1_pc == 1)) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(2 <= t1_st)) || 1 <= __retres1) || !(m_st == 0)) || !(2 <= E_1)) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 0) || E_M == 1) || !(t1_i == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || !(2 <= m_st)) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(local <= token)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || 1 <= __retres1) || !(m_st == 0)) || !(2 <= E_1)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((!(m_i == 1) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || (((((((m_st == \old(m_st) && t1_pc == 1) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((((((((!(\old(t1_pc) == 1) || ((((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && !(tmp == 0)) && m_i == 1) && local <= token)) || \old(E_M) == 0) || !(t1_i == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(m_i == 1)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || (((((((m_st == \old(m_st) && t1_pc == 1) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || ((!(E_M == 0) && !(E_M == 1)) && (((((((((((((((token <= local + 1 && local == \old(local)) && m_st == \old(m_st)) && m_st == 0) && \old(t1_pc) == t1_pc) && E_M == \old(E_M)) && 2 <= t1_st) && local + 1 <= token) && t1_pc == 1) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && t1_i == 1) && m_i == 1) && \old(t1_st) == t1_st) && \old(token) == token) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0)) && m_i == 1)))) || !(2 <= \old(m_st)))) && ((((((((((((((((((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || ((((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && !(tmp == 0)) && m_i == 1) && local <= token)) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || !(t1_i == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || ((((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && !(tmp == 0)) && local <= token) && E_M == \old(E_M))) || !(m_i == 1)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || ((E_1 == \old(E_1) && ((((((2 <= t1_st && t1_pc == 1) && !(m_pc == 1)) && m_st == 0) && !(tmp == 0)) && \old(token) == token) || ((((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && token <= \old(token) + 1) && !(m_pc == 1)) && m_st == 0) && !(tmp == 0)))) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || ((!(E_M == 0) && !(E_M == 1)) && (((((((((((((((token <= local + 1 && local == \old(local)) && m_st == \old(m_st)) && m_st == 0) && \old(t1_pc) == t1_pc) && E_M == \old(E_M)) && 2 <= t1_st) && local + 1 <= token) && t1_pc == 1) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && t1_i == 1) && m_i == 1) && \old(t1_st) == t1_st) && \old(token) == token) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0)) && m_i == 1))))) && (((!(m_i == 1) || \old(m_pc) == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(m_st))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((!(m_i == 1) || !(2 <= m_st)) || (((0 <= __retres1 && !(m_pc == 1)) && __retres1 <= 0) && m_i == 1)) || m_pc == 1) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || 1 <= __retres1) || (((0 <= __retres1 && !(m_pc == 1)) && __retres1 <= 0) && m_i == 1)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(2 <= E_1))) && ((((((((!(m_i == 1) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token))) && (((((((((!(m_i == 1) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(local <= token)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(\old(t1_st) == 0) || !(m_i == 1)) || t1_pc == 1) || \old(m_pc) == 1) || ((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token)) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((!(m_i == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || m_pc == 1) || !(2 <= \old(m_st))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(t1_i == 1)) || !(local <= \old(token))) || (((((t1_pc == 1 && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((!(m_i == 1) || ((((m_st == 0 && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || \old(E_M) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(m_i == 1) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || (((((((m_st == \old(m_st) && t1_pc == 1) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(t1_i == 1)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((!(m_i == 1) || \old(m_pc) == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(m_st))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M)) && \old(token) == token)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((!(m_i == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || \old(E_M) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(t1_i == 1)) || !(local <= \old(token))) || ((((((2 <= t1_st && t1_pc == 1) && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((!(m_i == 1) || !(\old(token) <= local)) || (((((m_st == \old(m_st) && t1_pc == 1) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((!(m_i == 1) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token) && E_M == \old(E_M))) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((!(m_i == 1) || \old(E_M) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((((((!(t1_pc == 1) && t1_st == 0) && !(m_pc == 1)) && 2 <= E_1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(m_i == 1)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_st) == 0) || !(m_i == 1)) || t1_pc == 1) || \old(m_pc) == 1) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(\old(local) + 1 <= \old(token)))) && (((((((!(m_i == 1) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(m_i == 1)) || t1_pc == 1) || \old(m_pc) == 1) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(m_i == 1) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) - ProcedureContractResult [Line: 74]: Procedure Contract for transmit1 Derived contract for procedure transmit1: (((((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M)) && \old(token) == token)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((!(m_i == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || \old(E_M) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(t1_i == 1)) || !(local <= \old(token))) || ((((((2 <= t1_st && t1_pc == 1) && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - ProcedureContractResult [Line: 301]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: (((((((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || (t1_st == 0 && (m_st == 0 || (tmp <= 0 && 0 < tmp + 1)))) || !(local <= token)) || ((m_st == \old(m_st) && (m_st == 0 || (tmp <= 0 && 0 < tmp + 1))) && \old(t1_st) == t1_st)) && (((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || !(t1_pc == 1)) || ((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && m_i == 1) && 0 < tmp + 1)) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || ((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && m_i == 1) && 0 < tmp + 1)) || !(local + 1 <= token)) || \old(t1_st) == 0) || (m_st == 0 && 1 <= tmp)) || !(E_M == 1)) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || (tmp <= 0 && 0 < tmp + 1)) || !(local <= token))) && ((((((((((2 <= m_st || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((!(m_i == 1) || ((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && m_i == 1) && 0 < tmp + 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || t1_pc == 1) || !(\old(m_st) == 0)) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) || (((tmp <= 0 && 0 < tmp + 1) && m_st == 0) && \old(t1_st) == t1_st))) && (((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(local <= token)) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) - ProcedureContractResult [Line: 326]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: (((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(token <= local)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || m_pc == 1) || !(local <= token)) && (((!(m_i == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(token <= local)) || t1_st == 0) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(local <= token))) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || \old(t1_st) == 0) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(E_M == 1)) || !(t1_i == 1)) || m_st == 0) || !(2 <= \old(m_st))) || !(2 <= E_1)) - ProcedureContractResult [Line: 174]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: ((((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 0) || E_M == 1) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(m_st == 0)) || !(2 <= E_1)) && (((((((((!(m_i == 1) || !(2 <= m_st)) || E_M == 1) || E_M == 0) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || E_M == 1) || E_M == 0) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= t1_st)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || t1_pc == 1) || E_M == 1) || E_M == 0) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) || !(2 <= E_1)) - ProcedureContractResult [Line: 129]: Procedure Contract for is_transmit1_triggered Derived contract for procedure is_transmit1_triggered: 1 - ProcedureContractResult [Line: 273]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events: ((((((((((!(m_i == 1) || \old(E_M) == 1) || t1_pc == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || \old(E_M) == 0) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token))) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token)) - ProcedureContractResult [Line: 156]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || t1_pc == 1) || !(\old(m_st) == 0)) || E_M == 1) || E_M == 0) || (t1_st == 0 && m_st == 0)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1) - ProcedureContractResult [Line: 462]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for error Derived contract for procedure error: 1 - ProcedureContractResult [Line: 30]: Procedure Contract for master Derived contract for procedure master: ((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(\old(t1_st) == 0) || !(m_i == 1)) || t1_pc == 1) || \old(m_pc) == 1) || ((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token)) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - ProcedureContractResult [Line: 337]: Procedure Contract for fire_time_events Derived contract for procedure fire_time_events: 1 - ProcedureContractResult [Line: 194]: Procedure Contract for eval Derived contract for procedure eval: (((((((((((((!(m_i == 1) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || (((((((m_st == \old(m_st) && t1_pc == 1) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(t1_i == 1)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((!(m_i == 1) || \old(m_pc) == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(m_st))) - ProcedureContractResult [Line: 384]: Procedure Contract for stop_simulation Derived contract for procedure stop_simulation: 1 - ProcedureContractResult [Line: 148]: Procedure Contract for update_channels Derived contract for procedure update_channels: 1 - ProcedureContractResult [Line: 245]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events: (((((((((!(m_i == 1) || \old(E_M) == 1) || t1_pc == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token)) - ProcedureContractResult [Line: 403]: Procedure Contract for start_simulation Derived contract for procedure start_simulation: 1 - ProcedureContractResult [Line: 110]: Procedure Contract for is_master_triggered Derived contract for procedure is_master_triggered: (((((((((((((!(m_i == 1) || t1_pc == 1) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(local <= token)) && (((((((((!(m_i == 1) || t1_pc == 1) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) || !(2 <= E_1))) && (((!(m_i == 1) || !(2 <= m_st)) || m_pc == 1) || (((((0 <= \result && \result <= 0) && 0 <= __retres1) && !(m_pc == 1)) && __retres1 <= 0) && m_i == 1))) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || (1 <= \result && 1 <= __retres1)) || (((((0 <= \result && \result <= 0) && 0 <= __retres1) && !(m_pc == 1)) && __retres1 <= 0) && m_i == 1)) || !(2 <= E_1))) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_i == 1) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token)) - ProcedureContractResult [Line: 346]: Procedure Contract for reset_time_events Derived contract for procedure reset_time_events: ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || \old(E_M) == 0) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token)) - ProcedureContractResult [Line: 374]: Procedure Contract for init_model Derived contract for procedure init_model: ((((((((t1_pc == 1 || E_M == 1) || E_M == 0) || m_pc == 1) || !(t1_st == 0)) || (t1_i == 1 && m_i == 1)) || !(m_st == 0)) || !(2 <= E_1)) || \old(m_i) == 1) || \old(t1_i) == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 218 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 65.0s, OverallIterations: 15, TraceHistogramMax: 7, AutomataDifference: 50.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 198.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3987 SDtfs, 15508 SDslu, 1708 SDs, 0 SdLazy, 23563 SolverSat, 5654 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1274 GetRequests, 855 SyntacticMatches, 1 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4359occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 7567 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 218 LocationsWithAnnotation, 31527 PreInvPairs, 37526 NumberOfFragments, 29585 HoareAnnotationTreeSize, 31527 FomulaSimplifications, 28585733061 FormulaSimplificationTreeSizeReduction, 117.6s HoareSimplificationTime, 218 FomulaSimplificationsInter, 776259 FormulaSimplificationTreeSizeReductionInter, 79.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3809 NumberOfCodeBlocks, 3809 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3794 ConstructedInterpolants, 0 QuantifiedInterpolants, 1954346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 2361/2470 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...