/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 -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-72570d3 [2020-08-22 19:50:53,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 19:50:53,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 19:50:53,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 19:50:53,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 19:50:53,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 19:50:53,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 19:50:53,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 19:50:53,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 19:50:53,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 19:50:53,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 19:50:53,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 19:50:53,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 19:50:53,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 19:50:53,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 19:50:53,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 19:50:53,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 19:50:53,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 19:50:53,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 19:50:53,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 19:50:53,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 19:50:53,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 19:50:53,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 19:50:53,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 19:50:53,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 19:50:53,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 19:50:53,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 19:50:53,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 19:50:53,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 19:50:53,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 19:50:53,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 19:50:53,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 19:50:53,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 19:50:53,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 19:50:53,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 19:50:53,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 19:50:53,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 19:50:53,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 19:50:53,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 19:50:53,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 19:50:53,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 19:50:53,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 19:50:53,511 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 19:50:53,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 19:50:53,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 19:50:53,512 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 19:50:53,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 19:50:53,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 19:50:53,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 19:50:53,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 19:50:53,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 19:50:53,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 19:50:53,514 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 19:50:53,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 19:50:53,514 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 19:50:53,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 19:50:53,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 19:50:53,515 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 19:50:53,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 19:50:53,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 19:50:53,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 19:50:53,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 19:50:53,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 19:50:53,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 19:50:53,516 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 19:50:53,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 19:50:53,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 19:50:53,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 19:50:53,871 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 19:50:53,872 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 19:50:53,872 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-08-22 19:50:53,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3f604cb/6a6ad7c03f4b44b19ed16ce91a7f56b6/FLAG317db5856 [2020-08-22 19:50:54,453 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 19:50:54,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-08-22 19:50:54,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3f604cb/6a6ad7c03f4b44b19ed16ce91a7f56b6/FLAG317db5856 [2020-08-22 19:50:54,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3f604cb/6a6ad7c03f4b44b19ed16ce91a7f56b6 [2020-08-22 19:50:54,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 19:50:54,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 19:50:54,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 19:50:54,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 19:50:54,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 19:50:54,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 07:50:54" (1/1) ... [2020-08-22 19:50:54,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547fd1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:54, skipping insertion in model container [2020-08-22 19:50:54,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 07:50:54" (1/1) ... [2020-08-22 19:50:54,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 19:50:54,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 19:50:55,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 19:50:55,072 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 19:50:55,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 19:50:55,149 INFO L208 MainTranslator]: Completed translation [2020-08-22 19:50:55,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55 WrapperNode [2020-08-22 19:50:55,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 19:50:55,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 19:50:55,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 19:50:55,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 19:50:55,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (1/1) ... [2020-08-22 19:50:55,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (1/1) ... [2020-08-22 19:50:55,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (1/1) ... [2020-08-22 19:50:55,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (1/1) ... [2020-08-22 19:50:55,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (1/1) ... [2020-08-22 19:50:55,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (1/1) ... [2020-08-22 19:50:55,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (1/1) ... [2020-08-22 19:50:55,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 19:50:55,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 19:50:55,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 19:50:55,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 19:50:55,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-08-22 19:50:55,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 19:50:55,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 19:50:55,372 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-08-22 19:50:55,372 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-08-22 19:50:55,372 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-08-22 19:50:55,372 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-08-22 19:50:55,372 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-08-22 19:50:55,373 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-08-22 19:50:55,373 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-08-22 19:50:55,373 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-08-22 19:50:55,373 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-08-22 19:50:55,373 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-08-22 19:50:55,373 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-08-22 19:50:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-08-22 19:50:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-08-22 19:50:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-08-22 19:50:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-08-22 19:50:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-08-22 19:50:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-08-22 19:50:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-08-22 19:50:55,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 19:50:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 19:50:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-08-22 19:50:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-08-22 19:50:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-08-22 19:50:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-08-22 19:50:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 19:50:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-08-22 19:50:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-08-22 19:50:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-08-22 19:50:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-08-22 19:50:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-08-22 19:50:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-08-22 19:50:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-08-22 19:50:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-08-22 19:50:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-08-22 19:50:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-08-22 19:50:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-08-22 19:50:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-08-22 19:50:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-08-22 19:50:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-08-22 19:50:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 19:50:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 19:50:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 19:50:55,941 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 19:50:55,941 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-08-22 19:50:55,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 07:50:55 BoogieIcfgContainer [2020-08-22 19:50:55,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 19:50:55,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 19:50:55,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 19:50:55,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 19:50:55,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 07:50:54" (1/3) ... [2020-08-22 19:50:55,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561ffbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 07:50:55, skipping insertion in model container [2020-08-22 19:50:55,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:50:55" (2/3) ... [2020-08-22 19:50:55,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561ffbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 07:50:55, skipping insertion in model container [2020-08-22 19:50:55,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 07:50:55" (3/3) ... [2020-08-22 19:50:55,961 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-08-22 19:50:55,972 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 19:50:55,982 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 19:50:55,995 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 19:50:56,018 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 19:50:56,018 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 19:50:56,018 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 19:50:56,019 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 19:50:56,019 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 19:50:56,019 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 19:50:56,019 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 19:50:56,019 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 19:50:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states. [2020-08-22 19:50:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-08-22 19:50:56,058 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:50:56,060 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-08-22 19:50:56,060 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:50:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:50:56,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1066956110, now seen corresponding path program 1 times [2020-08-22 19:50:56,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:50:56,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705914736] [2020-08-22 19:50:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:50:56,131 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:50:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:50:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:50:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:50:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:50:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:50:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:50:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:50:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:50:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:50:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:50:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:50:56,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705914736] [2020-08-22 19:50:56,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:50:56,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 19:50:56,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260267241] [2020-08-22 19:50:56,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 19:50:56,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:50:56,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 19:50:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 19:50:56,755 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 7 states. [2020-08-22 19:50:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:50:58,900 INFO L93 Difference]: Finished difference Result 774 states and 1050 transitions. [2020-08-22 19:50:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 19:50:58,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2020-08-22 19:50:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:50:58,925 INFO L225 Difference]: With dead ends: 774 [2020-08-22 19:50:58,926 INFO L226 Difference]: Without dead ends: 573 [2020-08-22 19:50:58,933 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-08-22 19:50:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-08-22 19:50:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 419. [2020-08-22 19:50:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-08-22 19:50:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 521 transitions. [2020-08-22 19:50:59,117 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 521 transitions. Word has length 107 [2020-08-22 19:50:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:50:59,118 INFO L479 AbstractCegarLoop]: Abstraction has 419 states and 521 transitions. [2020-08-22 19:50:59,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 19:50:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 521 transitions. [2020-08-22 19:50:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-08-22 19:50:59,125 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:50:59,126 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-08-22 19:50:59,126 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 19:50:59,127 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:50:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:50:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash -517401199, now seen corresponding path program 1 times [2020-08-22 19:50:59,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:50:59,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128978523] [2020-08-22 19:50:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:50:59,133 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:50:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:50:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:50:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:50:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:50:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:50:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:50:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:50:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:50:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:50:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:50:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 19:50:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:50:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:50:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:50:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:50:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-08-22 19:50:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:50:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-22 19:50:59,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128978523] [2020-08-22 19:50:59,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:50:59,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 19:50:59,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593100054] [2020-08-22 19:50:59,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 19:50:59,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:50:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 19:50:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-08-22 19:50:59,531 INFO L87 Difference]: Start difference. First operand 419 states and 521 transitions. Second operand 9 states. [2020-08-22 19:51:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:02,725 INFO L93 Difference]: Finished difference Result 1504 states and 2005 transitions. [2020-08-22 19:51:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 19:51:02,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2020-08-22 19:51:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:02,741 INFO L225 Difference]: With dead ends: 1504 [2020-08-22 19:51:02,741 INFO L226 Difference]: Without dead ends: 1125 [2020-08-22 19:51:02,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2020-08-22 19:51:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2020-08-22 19:51:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 835. [2020-08-22 19:51:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2020-08-22 19:51:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1076 transitions. [2020-08-22 19:51:02,878 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1076 transitions. Word has length 170 [2020-08-22 19:51:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:02,879 INFO L479 AbstractCegarLoop]: Abstraction has 835 states and 1076 transitions. [2020-08-22 19:51:02,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 19:51:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1076 transitions. [2020-08-22 19:51:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-08-22 19:51:02,887 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:02,888 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-08-22 19:51:02,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 19:51:02,888 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 214480794, now seen corresponding path program 1 times [2020-08-22 19:51:02,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:02,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565642167] [2020-08-22 19:51:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:02,893 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:02,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:02,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:02,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:02,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:51:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 19:51:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 19:51:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-08-22 19:51:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 19:51:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-08-22 19:51:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 19:51:03,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565642167] [2020-08-22 19:51:03,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:03,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 19:51:03,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942043329] [2020-08-22 19:51:03,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 19:51:03,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 19:51:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-08-22 19:51:03,236 INFO L87 Difference]: Start difference. First operand 835 states and 1076 transitions. Second operand 12 states. [2020-08-22 19:51:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:05,481 INFO L93 Difference]: Finished difference Result 1994 states and 2678 transitions. [2020-08-22 19:51:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 19:51:05,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 220 [2020-08-22 19:51:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:05,492 INFO L225 Difference]: With dead ends: 1994 [2020-08-22 19:51:05,493 INFO L226 Difference]: Without dead ends: 941 [2020-08-22 19:51:05,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2020-08-22 19:51:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2020-08-22 19:51:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 679. [2020-08-22 19:51:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2020-08-22 19:51:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 841 transitions. [2020-08-22 19:51:05,636 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 841 transitions. Word has length 220 [2020-08-22 19:51:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:05,638 INFO L479 AbstractCegarLoop]: Abstraction has 679 states and 841 transitions. [2020-08-22 19:51:05,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 19:51:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 841 transitions. [2020-08-22 19:51:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-08-22 19:51:05,656 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:05,656 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-08-22 19:51:05,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 19:51:05,657 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 144736441, now seen corresponding path program 2 times [2020-08-22 19:51:05,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:05,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [81823856] [2020-08-22 19:51:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:05,667 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:51:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 19:51:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-08-22 19:51:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 19:51:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:05,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-08-22 19:51:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:51:06,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [81823856] [2020-08-22 19:51:06,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:06,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 19:51:06,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342888266] [2020-08-22 19:51:06,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 19:51:06,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 19:51:06,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 19:51:06,014 INFO L87 Difference]: Start difference. First operand 679 states and 841 transitions. Second operand 10 states. [2020-08-22 19:51:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:08,900 INFO L93 Difference]: Finished difference Result 2297 states and 3039 transitions. [2020-08-22 19:51:08,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 19:51:08,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2020-08-22 19:51:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:08,911 INFO L225 Difference]: With dead ends: 2297 [2020-08-22 19:51:08,911 INFO L226 Difference]: Without dead ends: 1656 [2020-08-22 19:51:08,917 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2020-08-22 19:51:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-08-22 19:51:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1256. [2020-08-22 19:51:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-08-22 19:51:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1532 transitions. [2020-08-22 19:51:09,092 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1532 transitions. Word has length 219 [2020-08-22 19:51:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:09,093 INFO L479 AbstractCegarLoop]: Abstraction has 1256 states and 1532 transitions. [2020-08-22 19:51:09,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 19:51:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1532 transitions. [2020-08-22 19:51:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-08-22 19:51:09,101 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:09,101 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-08-22 19:51:09,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 19:51:09,102 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2140706519, now seen corresponding path program 1 times [2020-08-22 19:51:09,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:09,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271313113] [2020-08-22 19:51:09,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:09,109 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:51:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 19:51:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-08-22 19:51:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-08-22 19:51:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-08-22 19:51:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 19:51:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-08-22 19:51:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:51:09,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271313113] [2020-08-22 19:51:09,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:09,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 19:51:09,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722026685] [2020-08-22 19:51:09,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 19:51:09,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 19:51:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-08-22 19:51:09,435 INFO L87 Difference]: Start difference. First operand 1256 states and 1532 transitions. Second operand 9 states. [2020-08-22 19:51:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:11,647 INFO L93 Difference]: Finished difference Result 2884 states and 3650 transitions. [2020-08-22 19:51:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 19:51:11,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2020-08-22 19:51:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:11,662 INFO L225 Difference]: With dead ends: 2884 [2020-08-22 19:51:11,662 INFO L226 Difference]: Without dead ends: 1667 [2020-08-22 19:51:11,670 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-08-22 19:51:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2020-08-22 19:51:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1256. [2020-08-22 19:51:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-08-22 19:51:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1520 transitions. [2020-08-22 19:51:11,854 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1520 transitions. Word has length 248 [2020-08-22 19:51:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:11,855 INFO L479 AbstractCegarLoop]: Abstraction has 1256 states and 1520 transitions. [2020-08-22 19:51:11,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 19:51:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1520 transitions. [2020-08-22 19:51:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-08-22 19:51:11,862 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:11,862 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-08-22 19:51:11,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 19:51:11,863 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:11,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash -469744976, now seen corresponding path program 1 times [2020-08-22 19:51:11,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:11,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478012670] [2020-08-22 19:51:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:11,869 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:11,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:51:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 19:51:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-08-22 19:51:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-08-22 19:51:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-08-22 19:51:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 19:51:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-08-22 19:51:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:51:12,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478012670] [2020-08-22 19:51:12,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:12,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 19:51:12,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493935175] [2020-08-22 19:51:12,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 19:51:12,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 19:51:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 19:51:12,189 INFO L87 Difference]: Start difference. First operand 1256 states and 1520 transitions. Second operand 10 states. [2020-08-22 19:51:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:15,205 INFO L93 Difference]: Finished difference Result 4318 states and 5461 transitions. [2020-08-22 19:51:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-08-22 19:51:15,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 248 [2020-08-22 19:51:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:15,227 INFO L225 Difference]: With dead ends: 4318 [2020-08-22 19:51:15,228 INFO L226 Difference]: Without dead ends: 3101 [2020-08-22 19:51:15,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2020-08-22 19:51:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2020-08-22 19:51:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2364. [2020-08-22 19:51:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2020-08-22 19:51:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2885 transitions. [2020-08-22 19:51:15,583 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2885 transitions. Word has length 248 [2020-08-22 19:51:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:15,584 INFO L479 AbstractCegarLoop]: Abstraction has 2364 states and 2885 transitions. [2020-08-22 19:51:15,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 19:51:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2885 transitions. [2020-08-22 19:51:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-22 19:51:15,600 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:15,600 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-08-22 19:51:15,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 19:51:15,601 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1876608160, now seen corresponding path program 1 times [2020-08-22 19:51:15,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:15,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1242746790] [2020-08-22 19:51:15,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:15,608 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:51:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 19:51:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 19:51:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-08-22 19:51:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-08-22 19:51:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 19:51:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:15,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-08-22 19:51:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:51:16,000 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1242746790] [2020-08-22 19:51:16,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:16,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 19:51:16,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117922637] [2020-08-22 19:51:16,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 19:51:16,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:16,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 19:51:16,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-08-22 19:51:16,003 INFO L87 Difference]: Start difference. First operand 2364 states and 2885 transitions. Second operand 14 states. [2020-08-22 19:51:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:20,098 INFO L93 Difference]: Finished difference Result 5265 states and 6747 transitions. [2020-08-22 19:51:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 19:51:20,099 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 254 [2020-08-22 19:51:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:20,119 INFO L225 Difference]: With dead ends: 5265 [2020-08-22 19:51:20,120 INFO L226 Difference]: Without dead ends: 2941 [2020-08-22 19:51:20,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=442, Invalid=1628, Unknown=0, NotChecked=0, Total=2070 [2020-08-22 19:51:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-08-22 19:51:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2370. [2020-08-22 19:51:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2020-08-22 19:51:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2841 transitions. [2020-08-22 19:51:20,479 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2841 transitions. Word has length 254 [2020-08-22 19:51:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:20,480 INFO L479 AbstractCegarLoop]: Abstraction has 2370 states and 2841 transitions. [2020-08-22 19:51:20,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 19:51:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2841 transitions. [2020-08-22 19:51:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-22 19:51:20,489 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:20,489 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-08-22 19:51:20,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 19:51:20,490 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash 405313859, now seen corresponding path program 1 times [2020-08-22 19:51:20,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:20,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1978464494] [2020-08-22 19:51:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:20,497 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:51:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 19:51:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 19:51:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-08-22 19:51:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-08-22 19:51:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 19:51:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-08-22 19:51:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:51:20,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1978464494] [2020-08-22 19:51:20,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:20,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 19:51:20,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936092905] [2020-08-22 19:51:20,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 19:51:20,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 19:51:20,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-08-22 19:51:20,912 INFO L87 Difference]: Start difference. First operand 2370 states and 2841 transitions. Second operand 12 states. [2020-08-22 19:51:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:26,588 INFO L93 Difference]: Finished difference Result 7778 states and 9559 transitions. [2020-08-22 19:51:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-08-22 19:51:26,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 254 [2020-08-22 19:51:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:26,625 INFO L225 Difference]: With dead ends: 7778 [2020-08-22 19:51:26,625 INFO L226 Difference]: Without dead ends: 5452 [2020-08-22 19:51:26,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-08-22 19:51:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2020-08-22 19:51:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4339. [2020-08-22 19:51:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4339 states. [2020-08-22 19:51:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5251 transitions. [2020-08-22 19:51:27,530 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5251 transitions. Word has length 254 [2020-08-22 19:51:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:27,533 INFO L479 AbstractCegarLoop]: Abstraction has 4339 states and 5251 transitions. [2020-08-22 19:51:27,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 19:51:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5251 transitions. [2020-08-22 19:51:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-08-22 19:51:27,542 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:27,542 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] [2020-08-22 19:51:27,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 19:51:27,543 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2130201920, now seen corresponding path program 1 times [2020-08-22 19:51:27,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:27,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [44157237] [2020-08-22 19:51:27,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:27,549 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 19:51:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 19:51:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-22 19:51:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-08-22 19:51:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-08-22 19:51:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 19:51:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-08-22 19:51:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2020-08-22 19:51:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2020-08-22 19:51:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-08-22 19:51:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-08-22 19:51:27,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [44157237] [2020-08-22 19:51:27,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:27,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 19:51:27,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89874587] [2020-08-22 19:51:27,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 19:51:27,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 19:51:27,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-22 19:51:27,964 INFO L87 Difference]: Start difference. First operand 4339 states and 5251 transitions. Second operand 10 states. [2020-08-22 19:51:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:29,945 INFO L93 Difference]: Finished difference Result 8896 states and 10813 transitions. [2020-08-22 19:51:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 19:51:29,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 271 [2020-08-22 19:51:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:29,974 INFO L225 Difference]: With dead ends: 8896 [2020-08-22 19:51:29,974 INFO L226 Difference]: Without dead ends: 4594 [2020-08-22 19:51:29,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2020-08-22 19:51:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2020-08-22 19:51:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 3774. [2020-08-22 19:51:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2020-08-22 19:51:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 4561 transitions. [2020-08-22 19:51:30,697 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 4561 transitions. Word has length 271 [2020-08-22 19:51:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:30,698 INFO L479 AbstractCegarLoop]: Abstraction has 3774 states and 4561 transitions. [2020-08-22 19:51:30,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 19:51:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 4561 transitions. [2020-08-22 19:51:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2020-08-22 19:51:30,704 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:30,705 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-08-22 19:51:30,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 19:51:30,705 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1642237702, now seen corresponding path program 1 times [2020-08-22 19:51:30,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:30,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907992590] [2020-08-22 19:51:30,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:30,715 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 19:51:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 19:51:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:30,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 19:51:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-08-22 19:51:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2020-08-22 19:51:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-08-22 19:51:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-08-22 19:51:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-08-22 19:51:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-08-22 19:51:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-08-22 19:51:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-08-22 19:51:31,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907992590] [2020-08-22 19:51:31,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:31,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 19:51:31,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452266796] [2020-08-22 19:51:31,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 19:51:31,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 19:51:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-22 19:51:31,079 INFO L87 Difference]: Start difference. First operand 3774 states and 4561 transitions. Second operand 10 states. [2020-08-22 19:51:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:35,840 INFO L93 Difference]: Finished difference Result 8378 states and 10292 transitions. [2020-08-22 19:51:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 19:51:35,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2020-08-22 19:51:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:35,896 INFO L225 Difference]: With dead ends: 8378 [2020-08-22 19:51:35,897 INFO L226 Difference]: Without dead ends: 4642 [2020-08-22 19:51:35,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2020-08-22 19:51:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2020-08-22 19:51:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 3789. [2020-08-22 19:51:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3789 states. [2020-08-22 19:51:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 4529 transitions. [2020-08-22 19:51:36,794 INFO L78 Accepts]: Start accepts. Automaton has 3789 states and 4529 transitions. Word has length 270 [2020-08-22 19:51:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:36,795 INFO L479 AbstractCegarLoop]: Abstraction has 3789 states and 4529 transitions. [2020-08-22 19:51:36,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 19:51:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 4529 transitions. [2020-08-22 19:51:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-08-22 19:51:36,805 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:36,805 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-08-22 19:51:36,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 19:51:36,806 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:36,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash 353572077, now seen corresponding path program 1 times [2020-08-22 19:51:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:36,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [279806458] [2020-08-22 19:51:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:36,815 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 19:51:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 19:51:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 19:51:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-08-22 19:51:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-08-22 19:51:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-08-22 19:51:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2020-08-22 19:51:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2020-08-22 19:51:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-08-22 19:51:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2020-08-22 19:51:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-08-22 19:51:37,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [279806458] [2020-08-22 19:51:37,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:37,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 19:51:37,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185011383] [2020-08-22 19:51:37,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 19:51:37,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 19:51:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-08-22 19:51:37,282 INFO L87 Difference]: Start difference. First operand 3789 states and 4529 transitions. Second operand 12 states. [2020-08-22 19:51:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:39,499 INFO L93 Difference]: Finished difference Result 7142 states and 8522 transitions. [2020-08-22 19:51:39,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 19:51:39,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 275 [2020-08-22 19:51:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:39,521 INFO L225 Difference]: With dead ends: 7142 [2020-08-22 19:51:39,522 INFO L226 Difference]: Without dead ends: 3391 [2020-08-22 19:51:39,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2020-08-22 19:51:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2020-08-22 19:51:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2619. [2020-08-22 19:51:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2020-08-22 19:51:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3026 transitions. [2020-08-22 19:51:40,026 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3026 transitions. Word has length 275 [2020-08-22 19:51:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:40,026 INFO L479 AbstractCegarLoop]: Abstraction has 2619 states and 3026 transitions. [2020-08-22 19:51:40,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 19:51:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3026 transitions. [2020-08-22 19:51:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-08-22 19:51:40,032 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:40,032 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-08-22 19:51:40,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 19:51:40,032 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:40,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:40,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1238866457, now seen corresponding path program 1 times [2020-08-22 19:51:40,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:40,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1472066102] [2020-08-22 19:51:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:40,039 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 19:51:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 19:51:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 19:51:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-22 19:51:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-08-22 19:51:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-08-22 19:51:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-08-22 19:51:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-08-22 19:51:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 19:51:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-08-22 19:51:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-08-22 19:51:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-08-22 19:51:40,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1472066102] [2020-08-22 19:51:40,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:40,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 19:51:40,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123440207] [2020-08-22 19:51:40,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 19:51:40,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:40,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 19:51:40,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-08-22 19:51:40,403 INFO L87 Difference]: Start difference. First operand 2619 states and 3026 transitions. Second operand 13 states. [2020-08-22 19:51:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:42,563 INFO L93 Difference]: Finished difference Result 5583 states and 6704 transitions. [2020-08-22 19:51:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-22 19:51:42,564 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2020-08-22 19:51:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:42,576 INFO L225 Difference]: With dead ends: 5583 [2020-08-22 19:51:42,576 INFO L226 Difference]: Without dead ends: 3045 [2020-08-22 19:51:42,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2020-08-22 19:51:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2020-08-22 19:51:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 2562. [2020-08-22 19:51:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-08-22 19:51:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 2887 transitions. [2020-08-22 19:51:42,940 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 2887 transitions. Word has length 284 [2020-08-22 19:51:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:42,940 INFO L479 AbstractCegarLoop]: Abstraction has 2562 states and 2887 transitions. [2020-08-22 19:51:42,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 19:51:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 2887 transitions. [2020-08-22 19:51:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-22 19:51:42,944 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:42,945 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-08-22 19:51:42,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 19:51:42,945 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1211508846, now seen corresponding path program 1 times [2020-08-22 19:51:42,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:42,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791676594] [2020-08-22 19:51:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:42,951 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 19:51:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 19:51:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 19:51:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-22 19:51:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-08-22 19:51:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-08-22 19:51:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-08-22 19:51:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-08-22 19:51:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-08-22 19:51:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2020-08-22 19:51:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2020-08-22 19:51:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-08-22 19:51:43,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791676594] [2020-08-22 19:51:43,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:43,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 19:51:43,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637357951] [2020-08-22 19:51:43,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 19:51:43,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 19:51:43,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-08-22 19:51:43,334 INFO L87 Difference]: Start difference. First operand 2562 states and 2887 transitions. Second operand 13 states. [2020-08-22 19:51:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:44,994 INFO L93 Difference]: Finished difference Result 3787 states and 4293 transitions. [2020-08-22 19:51:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 19:51:44,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 286 [2020-08-22 19:51:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:45,000 INFO L225 Difference]: With dead ends: 3787 [2020-08-22 19:51:45,000 INFO L226 Difference]: Without dead ends: 1308 [2020-08-22 19:51:45,007 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-08-22 19:51:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2020-08-22 19:51:45,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1120. [2020-08-22 19:51:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2020-08-22 19:51:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1240 transitions. [2020-08-22 19:51:45,239 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1240 transitions. Word has length 286 [2020-08-22 19:51:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:45,239 INFO L479 AbstractCegarLoop]: Abstraction has 1120 states and 1240 transitions. [2020-08-22 19:51:45,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 19:51:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1240 transitions. [2020-08-22 19:51:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2020-08-22 19:51:45,244 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:51:45,244 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-08-22 19:51:45,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 19:51:45,245 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:51:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:51:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash -537431486, now seen corresponding path program 1 times [2020-08-22 19:51:45,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:51:45,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1392196620] [2020-08-22 19:51:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:51:45,255 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:51:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 19:51:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:51:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 19:51:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 19:51:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:51:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 19:51:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 19:51:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 19:51:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 19:51:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-08-22 19:51:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 19:51:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 19:51:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-08-22 19:51:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 19:51:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 19:51:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-08-22 19:51:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-08-22 19:51:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2020-08-22 19:51:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2020-08-22 19:51:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 19:51:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2020-08-22 19:51:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2020-08-22 19:51:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2020-08-22 19:51:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2020-08-22 19:51:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2020-08-22 19:51:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 19:51:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:51:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 19:51:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 19:51:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2020-08-22 19:51:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:51:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-08-22 19:51:45,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1392196620] [2020-08-22 19:51:45,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:51:45,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 19:51:45,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864330734] [2020-08-22 19:51:45,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 19:51:45,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:51:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 19:51:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-08-22 19:51:45,724 INFO L87 Difference]: Start difference. First operand 1120 states and 1240 transitions. Second operand 14 states. [2020-08-22 19:51:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:51:48,363 INFO L93 Difference]: Finished difference Result 1600 states and 1784 transitions. [2020-08-22 19:51:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 19:51:48,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 421 [2020-08-22 19:51:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:51:48,366 INFO L225 Difference]: With dead ends: 1600 [2020-08-22 19:51:48,366 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 19:51:48,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=761, Unknown=0, NotChecked=0, Total=1056 [2020-08-22 19:51:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 19:51:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 19:51:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 19:51:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 19:51:48,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2020-08-22 19:51:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:51:48,373 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 19:51:48,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 19:51:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 19:51:48,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 19:51:48,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 19:51:48,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 19:51:48,654 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2020-08-22 19:51:48,788 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2020-08-22 19:51:48,933 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-08-22 19:51:49,071 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-08-22 19:51:50,804 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2020-08-22 19:51:50,936 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2020-08-22 19:51:51,118 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2020-08-22 19:51:51,234 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2020-08-22 19:51:52,234 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2020-08-22 19:51:52,343 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2020-08-22 19:51:52,464 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2020-08-22 19:51:52,569 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2020-08-22 19:51:54,993 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 133 [2020-08-22 19:51:55,150 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 133 [2020-08-22 19:51:56,391 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2020-08-22 19:51:56,514 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2020-08-22 19:51:58,987 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2020-08-22 19:51:59,110 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2020-08-22 19:52:01,853 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2020-08-22 19:52:03,976 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2020-08-22 19:52:05,252 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2020-08-22 19:52:05,456 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2020-08-22 19:52:05,573 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2020-08-22 19:52:08,085 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2020-08-22 19:52:09,420 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2020-08-22 19:52:09,689 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-08-22 19:52:10,338 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2020-08-22 19:52:10,673 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-08-22 19:52:10,847 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2020-08-22 19:52:11,288 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2020-08-22 19:52:12,403 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2020-08-22 19:52:13,418 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2020-08-22 19:52:13,619 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-08-22 19:52:14,013 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-08-22 19:52:14,609 WARN L193 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2020-08-22 19:52:14,999 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-08-22 19:52:15,624 WARN L193 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 43 [2020-08-22 19:52:16,135 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2020-08-22 19:52:16,420 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-08-22 19:52:16,672 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-08-22 19:52:16,958 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-08-22 19:52:17,210 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:17,364 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:17,971 WARN L193 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2020-08-22 19:52:18,334 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-22 19:52:18,941 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 43 [2020-08-22 19:52:19,922 WARN L193 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2020-08-22 19:52:20,215 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-08-22 19:52:20,494 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-08-22 19:52:21,413 WARN L193 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2020-08-22 19:52:22,416 WARN L193 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2020-08-22 19:52:22,684 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2020-08-22 19:52:23,621 WARN L193 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2020-08-22 19:52:24,075 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-08-22 19:52:24,478 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-08-22 19:52:25,304 WARN L193 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 88 [2020-08-22 19:52:25,738 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-08-22 19:52:26,062 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:26,383 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2020-08-22 19:52:26,514 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-08-22 19:52:26,664 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:26,859 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:27,007 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:27,366 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:27,939 WARN L193 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2020-08-22 19:52:28,200 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2020-08-22 19:52:28,588 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2020-08-22 19:52:29,516 WARN L193 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2020-08-22 19:52:29,631 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2020-08-22 19:52:30,413 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2020-08-22 19:52:30,610 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:30,858 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2020-08-22 19:52:31,203 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2020-08-22 19:52:31,701 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2020-08-22 19:52:32,902 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2020-08-22 19:52:33,282 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-08-22 19:52:33,822 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2020-08-22 19:52:34,093 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2020-08-22 19:52:34,306 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2020-08-22 19:52:34,644 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2020-08-22 19:52:35,707 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2020-08-22 19:52:36,004 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-08-22 19:52:37,209 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2020-08-22 19:52:37,626 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2020-08-22 19:52:37,922 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-22 19:52:38,221 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-08-22 19:52:38,427 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-08-22 19:52:38,590 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:39,101 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-08-22 19:52:39,291 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 37 [2020-08-22 19:52:39,525 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2020-08-22 19:52:40,120 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2020-08-22 19:52:40,553 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2020-08-22 19:52:40,819 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2020-08-22 19:52:41,116 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-08-22 19:52:42,385 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2020-08-22 19:52:42,508 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-08-22 19:52:42,807 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2020-08-22 19:52:43,825 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2020-08-22 19:52:44,536 WARN L193 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2020-08-22 19:52:44,949 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2020-08-22 19:52:45,512 WARN L193 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2020-08-22 19:52:45,806 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2020-08-22 19:52:46,160 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2020-08-22 19:52:46,709 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2020-08-22 19:52:47,112 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2020-08-22 19:52:47,515 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2020-08-22 19:52:48,185 WARN L193 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2020-08-22 19:52:48,495 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-22 19:52:48,746 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-08-22 19:52:48,990 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2020-08-22 19:52:49,143 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:49,671 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2020-08-22 19:52:50,662 WARN L193 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 69 [2020-08-22 19:52:51,272 WARN L193 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2020-08-22 19:52:51,407 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-08-22 19:52:51,930 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2020-08-22 19:52:52,155 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2020-08-22 19:52:52,436 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-08-22 19:52:52,753 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2020-08-22 19:52:52,873 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-08-22 19:52:53,375 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-08-22 19:52:53,722 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 38 [2020-08-22 19:52:54,056 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-08-22 19:52:54,405 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2020-08-22 19:52:54,842 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2020-08-22 19:52:55,297 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 40 [2020-08-22 19:52:55,420 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 31 [2020-08-22 19:52:55,693 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2020-08-22 19:52:55,885 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:56,411 WARN L193 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 43 [2020-08-22 19:52:56,706 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-08-22 19:52:56,868 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:52:57,186 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-08-22 19:52:57,430 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-08-22 19:52:58,474 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2020-08-22 19:52:59,117 WARN L193 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2020-08-22 19:52:59,803 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2020-08-22 19:53:00,149 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2020-08-22 19:53:01,333 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2020-08-22 19:53:02,002 WARN L193 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2020-08-22 19:53:03,084 WARN L193 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2020-08-22 19:53:03,452 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2020-08-22 19:53:03,664 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:53:03,821 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 35 [2020-08-22 19:53:04,410 WARN L193 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2020-08-22 19:53:04,675 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:53:04,994 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2020-08-22 19:53:05,458 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2020-08-22 19:53:05,623 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 19:53:05,800 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2020-08-22 19:53:06,176 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 38 [2020-08-22 19:53:06,357 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-08-22 19:53:06,694 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2020-08-22 19:53:07,276 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2020-08-22 19:53:07,715 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-08-22 19:53:08,284 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2020-08-22 19:53:08,637 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-08-22 19:53:08,934 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2020-08-22 19:53:08,942 INFO L264 CegarLoopResult]: At program point immediate_notifyEXIT(lines 326 336) the Hoare annotation is: (let ((.cse12 (= ~m_pc~0 1)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse11)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse1 (= ~E_M~0 1)) (.cse2 (= ~E_M~0 0)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse4 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse9 (and (<= 2 ~m_st~0) (not .cse12))) (.cse10 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) (= ~t1_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse7 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse7)) (not (<= .cse7 ~token~0)) .cse8 (not .cse1) .cse5 .cse9 (= ~m_st~0 0) .cse10 (not (<= 2 ~E_1~0)))) (or (not .cse8) .cse11 .cse1 .cse2 .cse3 .cse5 .cse4 .cse12 .cse6) (or .cse12 .cse9 .cse10)))) [2020-08-22 19:53:08,943 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~t1_pc~0 1))) (let ((.cse6 (= ~m_pc~0 1)) (.cse0 (= |old(~t1_st~0)| 0)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not .cse1)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse9 (and .cse7 (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~t1_st~0 0)) .cse8) (or .cse9 .cse6 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) .cse0 (not .cse2) .cse9 .cse5 .cse10 (not (<= 2 ~E_1~0)))) (or .cse11 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse9 .cse8)))) [2020-08-22 19:53:08,943 INFO L264 CegarLoopResult]: At program point immediate_notifyFINAL(lines 326 336) the Hoare annotation is: (let ((.cse12 (= ~m_pc~0 1)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse11)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse1 (= ~E_M~0 1)) (.cse2 (= ~E_M~0 0)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse4 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse9 (and (<= 2 ~m_st~0) (not .cse12))) (.cse10 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) (= ~t1_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse7 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse7)) (not (<= .cse7 ~token~0)) .cse8 (not .cse1) .cse5 .cse9 (= ~m_st~0 0) .cse10 (not (<= 2 ~E_1~0)))) (or (not .cse8) .cse11 .cse1 .cse2 .cse3 .cse5 .cse4 .cse12 .cse6) (or .cse12 .cse9 .cse10)))) [2020-08-22 19:53:08,943 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse16 (= ~m_pc~0 1))) (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (<= ~local~0 |old(~token~0)|))) (.cse15 (= ~m_st~0 0)) (.cse4 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (= |old(~t1_st~0)| 0)) (.cse8 (= |old(~t1_pc~0)| 1)) (.cse10 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0))) (.cse11 (and (<= 2 ~m_st~0) (not .cse16))) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= ~m_st~0 |old(~m_st~0)|) .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 (not .cse8) .cse2 .cse3 .cse9 .cse10 .cse11 .cse12 (let ((.cse14 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (<= .cse14 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse14) .cse15)) .cse13) (or (and .cse15 .cse4 .cse5 .cse6 .cse7) .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse8 .cse10 .cse16 .cse13) (or .cse16 .cse11 .cse12)))) [2020-08-22 19:53:08,944 INFO L264 CegarLoopResult]: At program point L81(lines 81 85) the Hoare annotation is: (let ((.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (= |old(~E_M~0)| 1)) (.cse8 (= |old(~E_M~0)| 0)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse11 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_pc~0 0))) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= |old(~token~0)| ~token~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (not (<= 2 ~E_1~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or (not (<= |old(~token~0)| ~local~0)) .cse7 .cse8 .cse9 (and .cse0 .cse10 (<= ~token~0 ~local~0) .cse1 (<= ~local~0 ~token~0) .cse2 .cse4) (not (<= ~local~0 |old(~token~0)|)) .cse11 .cse6 .cse12) (or .cse7 .cse8 (not (= |old(~m_st~0)| 0)) .cse9 (= |old(~t1_pc~0)| 1) .cse11 .cse5 (and .cse10 (= ~m_st~0 0) .cse1 .cse2 .cse3 .cse4) .cse12))) [2020-08-22 19:53:08,944 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse3 (= |old(~token~0)| ~token~0)) (.cse5 (= ~m_pc~0 1)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= |old(~E_M~0)| 1)) (.cse8 (= |old(~E_M~0)| 0)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 (not (= |old(~m_st~0)| 0)) (and (= ~m_st~0 0) .cse1 .cse2 .cse3 .cse4) .cse9 (= |old(~t1_pc~0)| 1) .cse10 .cse5 .cse11) (or (and .cse0 (<= ~token~0 ~local~0) .cse1 (<= ~local~0 ~token~0) .cse2 .cse4) (not (<= |old(~token~0)| ~local~0)) .cse7 .cse8 .cse9 (not (<= ~local~0 |old(~token~0)|)) .cse10 .cse6 .cse11))) [2020-08-22 19:53:08,944 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= ~m_pc~0 1)) (.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (= |old(~t1_st~0)| 0)) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse4 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (+ |old(~token~0)| 1))) (and .cse8 (= ~t1_pc~0 1) (<= .cse9 ~token~0) (<= ~token~0 .cse9) .cse10 .cse11))) (or (and .cse8 .cse10 .cse11) .cse12 .cse6) (or .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse13 .cse5 .cse12 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7))) [2020-08-22 19:53:08,944 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse10 (= ~m_pc~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse12 (not (<= |old(~token~0)| ~local~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (= |old(~t1_st~0)| 0)) (.cse8 (= |old(~t1_pc~0)| 1)) (.cse13 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse3 (= |old(~token~0)| ~token~0)) (.cse14 (and (<= 2 ~m_st~0) (not .cse10))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (not (= |old(~m_st~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse5 (not .cse8) .cse6 .cse7 .cse13 .cse9 .cse14 .cse15 (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse0 (not (= ~E_M~0 0)) (<= .cse16 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse16) .cse1)) .cse11) (or .cse12 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse15 .cse11 (and (= ~m_st~0 |old(~m_st~0)|) .cse0 .cse2 .cse4 .cse3)) (or .cse10 .cse14 .cse15)))) [2020-08-22 19:53:08,944 INFO L264 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse16 (= ~m_pc~0 1))) (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (<= ~local~0 |old(~token~0)|))) (.cse15 (= ~m_st~0 0)) (.cse4 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (= |old(~t1_st~0)| 0)) (.cse8 (= |old(~t1_pc~0)| 1)) (.cse10 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0))) (.cse11 (and (<= 2 ~m_st~0) (not .cse16))) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= ~m_st~0 |old(~m_st~0)|) .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 (not .cse8) .cse2 .cse3 .cse9 .cse10 .cse11 .cse12 (let ((.cse14 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (<= .cse14 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse14) .cse15)) .cse13) (or (and .cse15 .cse4 .cse5 .cse6 .cse7) .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse8 .cse10 .cse16 .cse13) (or .cse16 .cse11 .cse12)))) [2020-08-22 19:53:08,945 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (not (<= |old(~token~0)| ~local~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (= |old(~t1_st~0)| 0)) (.cse8 (= |old(~t1_pc~0)| 1)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or (and .cse0 (= |old(~t1_pc~0)| ~t1_pc~0) .cse1 (= |old(~token~0)| ~token~0) .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) .cse7 .cse8 .cse9 .cse3 .cse10) (or (and .cse0 (= ~t1_pc~0 1) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse1 .cse2) .cse11 .cse5 .cse6 .cse7 .cse12 .cse9 .cse4 .cse10) (or .cse11 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse4 .cse10))) [2020-08-22 19:53:08,945 INFO L264 CegarLoopResult]: At program point transmit1EXIT(lines 74 109) the Hoare annotation is: (let ((.cse14 (<= 2 ~m_st~0)) (.cse17 (= ~m_pc~0 1))) (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (and .cse14 (not .cse17))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse1 (= |old(~E_M~0)| 1)) (.cse7 (<= 2 ~t1_st~0)) (.cse8 (= ~t1_pc~0 1)) (.cse10 (= ~m_st~0 0)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse16 (= |old(~token~0)| ~token~0)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 (let ((.cse9 (+ |old(~token~0)| 1))) (and .cse7 .cse8 (not (= ~E_M~0 0)) (<= .cse9 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse9) .cse10)) .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse3 (and .cse7 .cse14 .cse8 .cse15 .cse16) .cse4 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13) (or .cse17 .cse11 .cse12) (or .cse1 (and .cse7 .cse8 .cse10 .cse15 .cse16) .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse2 .cse6 .cse17 .cse13)))) [2020-08-22 19:53:08,945 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse14 (<= 2 ~m_st~0)) (.cse17 (= ~m_pc~0 1))) (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (and .cse14 (not .cse17))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse1 (= |old(~E_M~0)| 1)) (.cse7 (<= 2 ~t1_st~0)) (.cse8 (= ~t1_pc~0 1)) (.cse10 (= ~m_st~0 0)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse16 (= |old(~token~0)| ~token~0)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 (let ((.cse9 (+ |old(~token~0)| 1))) (and .cse7 .cse8 (not (= ~E_M~0 0)) (<= .cse9 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse9) .cse10)) .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse3 (and .cse7 .cse14 .cse8 .cse15 .cse16) .cse4 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13) (or .cse17 .cse11 .cse12) (or .cse1 (and .cse7 .cse8 .cse10 .cse15 .cse16) .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse2 .cse6 .cse17 .cse13)))) [2020-08-22 19:53:08,945 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse3 (= |old(~t1_pc~0)| 1)) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse0 (= |old(~E_M~0)| 1)) (.cse1 (= |old(~E_M~0)| 0)) (.cse2 (= |old(~t1_st~0)| 0)) (.cse8 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~E_1~0))) (.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_pc~0 1)) (.cse9 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse8 .cse4 .cse9 .cse6 (let ((.cse11 (+ |old(~token~0)| 1))) (and .cse10 (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse11 ~token~0) (<= ~token~0 .cse11) .cse12))) (or (and .cse10 .cse12) .cse5 .cse9))) [2020-08-22 19:53:08,946 INFO L264 CegarLoopResult]: At program point L99-1(line 99) the Hoare annotation is: (let ((.cse11 (= ~m_pc~0 1))) (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (= |old(~t1_st~0)| 0)) (.cse10 (= |old(~t1_pc~0)| 1)) (.cse4 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~E_1~0))) (.cse6 (and (<= 2 ~m_st~0) (not .cse11))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse7 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse7 ~token~0) (= ~E_M~0 1) (<= ~token~0 .cse7) (= ~m_st~0 0))) .cse8 .cse9) (or .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse10 .cse5 .cse11 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse8 .cse9) (or .cse11 .cse6 .cse8)))) [2020-08-22 19:53:08,946 INFO L264 CegarLoopResult]: At program point L318(line 318) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse10 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse17 (<= activate_threads_~tmp~1 0)) (.cse18 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (and .cse17 .cse18)) (.cse13 (not .cse20)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse15 (and .cse9 .cse17 .cse18 .cse12)) (.cse0 (not .cse10)) (.cse11 (= ~m_st~0 0)) (.cse2 (= ~E_M~0 1)) (.cse5 (not (= ~t1_i~0 1))) (.cse16 (not (<= 2 ~E_1~0))) (.cse21 (and .cse9 .cse17 (not .cse6) .cse18 .cse12)) (.cse14 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse9 (or (and .cse10 .cse11) .cse8) .cse12) .cse7) (or .cse13 .cse0 .cse3 .cse2 .cse4 .cse5 .cse7 .cse14 .cse15 .cse16) (or .cse13 .cse10 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse17 .cse11 .cse18 .cse12) .cse5 .cse6 .cse16) (or .cse13 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15) (let ((.cse19 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse19)) (not (<= .cse19 ~token~0)) .cse20 (and .cse10 .cse11 (<= 1 activate_threads_~tmp~1)) (not .cse2) .cse5 .cse21 .cse14 .cse16)) (or .cse21 .cse6 .cse14)))) [2020-08-22 19:53:08,947 INFO L264 CegarLoopResult]: At program point L317(lines 317 321) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= activate_threads_~tmp~1 0)) (.cse15 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (and .cse14 .cse15)) (.cse0 (not .cse13)) (.cse10 (= ~m_st~0 0)) (.cse16 (not (<= 2 ~E_1~0))) (.cse12 (not .cse20)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse18 (and .cse9 .cse14 .cse15 .cse11)) (.cse21 (and .cse9 .cse14 (not .cse6) .cse15 .cse11)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse9 (or .cse10 .cse8) .cse11)) (or .cse12 .cse13 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse14 .cse10 .cse15 .cse11) .cse5 .cse6 .cse16) (or .cse12 .cse0 .cse3 .cse2 .cse4 .cse5 .cse7 .cse17 .cse18 .cse16) (let ((.cse19 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse19)) (and (not (= ~t1_st~0 0)) .cse10 (<= 1 activate_threads_~tmp~1)) (not (<= .cse19 ~token~0)) .cse20 (not .cse2) .cse5 .cse21 .cse17 .cse16)) (or .cse12 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18) (or .cse21 .cse6 .cse17)))) [2020-08-22 19:53:08,947 INFO L264 CegarLoopResult]: At program point L315(line 315) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= activate_threads_~tmp~1 0)) (.cse15 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (and .cse14 .cse15)) (.cse0 (not .cse13)) (.cse10 (= ~m_st~0 0)) (.cse16 (not (<= 2 ~E_1~0))) (.cse12 (not .cse20)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse18 (and .cse9 .cse14 .cse15 .cse11)) (.cse21 (and .cse9 .cse14 (not .cse6) .cse15 .cse11)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse9 (or .cse10 .cse8) .cse11)) (or .cse12 .cse13 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse14 .cse10 .cse15 .cse11) .cse5 .cse6 .cse16) (or .cse12 .cse0 .cse3 .cse2 .cse4 .cse5 .cse7 .cse17 .cse18 .cse16) (let ((.cse19 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse19)) (and (not (= ~t1_st~0 0)) .cse10 (<= 1 activate_threads_~tmp~1)) (not (<= .cse19 ~token~0)) .cse20 (not .cse2) .cse5 .cse21 .cse17 .cse16)) (or .cse12 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18) (or .cse21 .cse6 .cse17)))) [2020-08-22 19:53:08,947 INFO L264 CegarLoopResult]: At program point L317-2(lines 301 325) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse20 (<= 2 ~m_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse4 (<= activate_threads_~tmp~1 0)) (.cse6 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse14 (and .cse4 .cse6)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= ~m_st~0 0)) (.cse18 (and .cse20 .cse4 (not .cse9) .cse6)) (.cse0 (not .cse23)) (.cse11 (not .cse1)) (.cse3 (= ~E_M~0 0)) (.cse2 (= ~E_M~0 1)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse19 (not (<= 2 |old(~m_st~0)|))) (.cse21 (and .cse17 .cse4 .cse6 .cse7)) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse2 .cse3 .cse13 .cse8 .cse9 .cse14 .cse15) (let ((.cse16 (or .cse5 .cse14))) (or .cse11 .cse12 .cse2 .cse3 .cse13 .cse8 (and (= ~t1_st~0 0) .cse16) .cse15 (and .cse17 .cse16 .cse7))) (or .cse18 .cse9 .cse19) (or .cse20 .cse11 .cse12 .cse3 .cse2 .cse13 .cse8 .cse15 .cse19 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse8 .cse9 .cse15 .cse21) (let ((.cse22 (+ ~local~0 1))) (or .cse18 .cse11 (not (<= ~token~0 .cse22)) (not (<= .cse22 ~token~0)) .cse23 (and .cse5 (<= 1 activate_threads_~tmp~1)) (not .cse2) .cse8 .cse19 .cse10)) (or .cse18 .cse0 .cse11 .cse3 .cse2 .cse13 .cse8 .cse15 .cse19 .cse21 .cse10)))) [2020-08-22 19:53:08,948 INFO L264 CegarLoopResult]: At program point L315-1(line 315) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= activate_threads_~tmp~1 0)) (.cse15 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (and .cse14 .cse15)) (.cse0 (not .cse13)) (.cse10 (= ~m_st~0 0)) (.cse16 (not (<= 2 ~E_1~0))) (.cse12 (not .cse20)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse18 (and .cse9 .cse14 .cse15 .cse11)) (.cse21 (and .cse9 .cse14 (not .cse6) .cse15 .cse11)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse9 (or .cse10 .cse8) .cse11)) (or .cse12 .cse13 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse14 .cse10 .cse15 .cse11) .cse5 .cse6 .cse16) (or .cse12 .cse0 .cse3 .cse2 .cse4 .cse5 .cse7 .cse17 .cse18 .cse16) (let ((.cse19 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse19)) (and (not (= ~t1_st~0 0)) .cse10 (<= 1 activate_threads_~tmp~1)) (not (<= .cse19 ~token~0)) .cse20 (not .cse2) .cse5 .cse21 .cse17 .cse16)) (or .cse12 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18) (or .cse21 .cse6 .cse17)))) [2020-08-22 19:53:08,948 INFO L264 CegarLoopResult]: At program point L315-2(line 315) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (<= activate_threads_~tmp~1 0)) (.cse13 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (and .cse11 .cse13)) (.cse0 (not .cse10)) (.cse12 (= ~m_st~0 0)) (.cse15 (not (<= 2 ~E_1~0))) (.cse9 (not .cse20)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse17 (and .cse18 .cse11 .cse13 .cse14)) (.cse21 (and .cse18 .cse11 (not .cse6) .cse13 .cse14)) (.cse16 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse11 .cse12 .cse13 .cse14) .cse5 .cse6 .cse15) (or .cse9 .cse0 .cse3 .cse2 .cse4 .cse5 .cse7 .cse16 .cse17 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse18 (or .cse12 .cse8) .cse14)) (let ((.cse19 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse19)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse19 ~token~0)) .cse20 (not .cse2) .cse5 .cse21 .cse16 .cse15)) (or .cse9 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17) (or .cse21 .cse6 .cse16)))) [2020-08-22 19:53:08,948 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| 0)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse8 (not (<= 2 ~E_1~0))) (.cse0 (not .cse10)) (.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))) (.cse12 (= ~m_pc~0 1)) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (<= 1 activate_threads_~tmp~1)) .cse10 (not .cse2) .cse5 .cse7 .cse8)) (or .cse1 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse11 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 .cse5 .cse12 .cse8) (or .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6) (or .cse12 .cse7)))) [2020-08-22 19:53:08,948 INFO L264 CegarLoopResult]: At program point L309(lines 309 313) the Hoare annotation is: (let ((.cse16 (= ~m_pc~0 1)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~t1_st~0 0)) (.cse7 (<= activate_threads_~tmp~1 0)) (.cse8 (< 0 (+ activate_threads_~tmp~1 1))) (.cse18 (= |old(~t1_st~0)| 0))) (let ((.cse10 (not .cse18)) (.cse2 (= ~E_M~0 0)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= ~local~0 ~token~0))) (.cse13 (and .cse6 .cse14 .cse7 .cse8)) (.cse0 (not .cse15)) (.cse1 (= ~E_M~0 1)) (.cse4 (not (= ~t1_i~0 1))) (.cse12 (not (<= 2 ~E_1~0))) (.cse19 (and .cse6 .cse7 (not .cse16) .cse8 .cse9)) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9)) (or .cse10 .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse11 .cse12 .cse13) (or (and .cse14 .cse7 (= ~m_st~0 0) .cse8) .cse10 .cse15 (not (= |old(~m_st~0)| 0)) .cse1 .cse2 .cse4 .cse16 .cse12) (or .cse10 .cse15 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse13) (let ((.cse17 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse17)) (not (<= .cse17 ~token~0)) (and .cse6 .cse9 (<= 1 activate_threads_~tmp~1)) .cse18 (not .cse1) .cse4 .cse19 .cse11 .cse12)) (or .cse19 .cse16 .cse11)))) [2020-08-22 19:53:08,949 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~t1_st~0 0)) (.cse15 (= |old(~t1_st~0)| 0))) (let ((.cse6 (= ~m_pc~0 1)) (.cse0 (not .cse15)) (.cse9 (and .cse16 .cse4)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 ~E_1~0))) (.cse13 (not .cse1)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (and .cse16 (= |old(~t1_st~0)| ~t1_st~0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse4 (= ~m_st~0 0)) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6 .cse9 .cse10) (or .cse11 .cse6 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse8 .cse5 .cse9 .cse10 .cse12 .cse7) (let ((.cse14 (+ ~local~0 1))) (or .cse13 (not (<= ~token~0 .cse14)) (not (<= .cse14 ~token~0)) .cse15 (not .cse2) .cse11 .cse5 .cse12 .cse7)) (or .cse13 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse8 .cse5 .cse11 .cse10)))) [2020-08-22 19:53:08,949 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (<= activate_threads_~tmp~1 0)) (.cse13 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (and .cse11 .cse13)) (.cse0 (not .cse10)) (.cse12 (= ~m_st~0 0)) (.cse15 (not (<= 2 ~E_1~0))) (.cse9 (not .cse20)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse18 (and .cse16 .cse11 .cse13 .cse14)) (.cse21 (and .cse16 .cse11 (not .cse6) .cse13 .cse14)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse11 .cse12 .cse13 .cse14) .cse5 .cse6 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse16 (or .cse12 .cse8) .cse14)) (or .cse9 .cse0 .cse3 .cse2 .cse4 .cse5 .cse7 .cse17 .cse18 .cse15) (let ((.cse19 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse19)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse19 ~token~0)) .cse20 (not .cse2) .cse5 .cse21 .cse17 .cse15)) (or .cse9 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18) (or .cse21 .cse6 .cse17)))) [2020-08-22 19:53:08,949 INFO L264 CegarLoopResult]: At program point L307-1(line 307) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 1)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (<= |activate_threads_#t~ret4| 0)) (.cse19 (= ~t1_st~0 0)) (.cse11 (<= 0 |activate_threads_#t~ret4|)) (.cse16 (= ~t1_pc~0 1)) (.cse4 (= |old(~t1_st~0)| 0))) (let ((.cse15 (not .cse4)) (.cse0 (not .cse16)) (.cse12 (= ~E_M~0 0)) (.cse6 (= ~E_M~0 1)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~t1_i~0 1))) (.cse18 (and .cse2 .cse10 .cse19 .cse11)) (.cse14 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse5 (and .cse2 .cse10 .cse11 (not .cse17) .cse3)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse1 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse1)) (and (<= 1 |activate_threads_#t~ret4|) .cse2 .cse3) (not (<= .cse1 ~token~0)) .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse9)) (or .cse0 (and .cse2 .cse10 .cse11 .cse3) (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse12 .cse13 .cse7 .cse14) (or .cse15 .cse16 .cse6 .cse12 .cse13 .cse7 .cse17 .cse18 .cse14) (or .cse15 .cse16 (not (= |old(~m_st~0)| 0)) .cse6 .cse12 .cse7 .cse17 (and .cse10 .cse19 .cse11 (= ~m_st~0 0)) .cse9) (or .cse15 .cse0 .cse12 .cse6 .cse13 .cse7 .cse18 .cse14 .cse8 .cse9) (or .cse5 .cse17 .cse8)))) [2020-08-22 19:53:08,950 INFO L264 CegarLoopResult]: At program point L307-2(line 307) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 1)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (<= |activate_threads_#t~ret4| 0)) (.cse19 (= ~t1_st~0 0)) (.cse11 (<= 0 |activate_threads_#t~ret4|)) (.cse16 (= ~t1_pc~0 1)) (.cse4 (= |old(~t1_st~0)| 0))) (let ((.cse15 (not .cse4)) (.cse0 (not .cse16)) (.cse12 (= ~E_M~0 0)) (.cse6 (= ~E_M~0 1)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~t1_i~0 1))) (.cse18 (and .cse2 .cse10 .cse19 .cse11)) (.cse14 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse5 (and .cse2 .cse10 .cse11 (not .cse17) .cse3)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse1 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse1)) (and (<= 1 |activate_threads_#t~ret4|) .cse2 .cse3) (not (<= .cse1 ~token~0)) .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse9)) (or .cse0 (and .cse2 .cse10 .cse11 .cse3) (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse12 .cse13 .cse7 .cse14) (or .cse15 .cse16 .cse6 .cse12 .cse13 .cse7 .cse17 .cse18 .cse14) (or .cse15 .cse16 (not (= |old(~m_st~0)| 0)) .cse6 .cse12 .cse7 .cse17 (and .cse10 .cse19 .cse11 (= ~m_st~0 0)) .cse9) (or .cse15 .cse0 .cse12 .cse6 .cse13 .cse7 .cse18 .cse14 .cse8 .cse9) (or .cse5 .cse17 .cse8)))) [2020-08-22 19:53:08,950 INFO L264 CegarLoopResult]: At program point L307-3(line 307) the Hoare annotation is: (let ((.cse5 (= ~m_pc~0 1)) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (<= |activate_threads_#t~ret4| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (<= activate_threads_~tmp~1 0)) (.cse9 (<= 0 |activate_threads_#t~ret4|)) (.cse10 (< 0 (+ activate_threads_~tmp~1 1))) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse0 (not .cse21)) (.cse16 (and .cse17 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse3 (= ~E_M~0 0)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse14 (not (<= ~local~0 ~token~0))) (.cse12 (not .cse1)) (.cse2 (= ~E_M~0 1)) (.cse4 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~E_1~0))) (.cse19 (and (<= 2 ~m_st~0) .cse17 .cse6 .cse8 .cse9 (not .cse5) .cse10 .cse18)) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_st~0 0)) .cse11) (or .cse0 .cse12 .cse3 .cse2 .cse13 .cse4 .cse14 .cse15 .cse16 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse16) (or .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse13 (and .cse17 .cse6 .cse8 .cse9 .cse10 .cse18) .cse4 .cse14) (let ((.cse20 (+ ~local~0 1))) (or .cse19 (and (<= 1 |activate_threads_#t~ret4|) .cse17 .cse18 (<= 1 activate_threads_~tmp~1)) .cse12 (not (<= ~token~0 .cse20)) (not (<= .cse20 ~token~0)) .cse21 (not .cse2) .cse4 .cse15 .cse11)) (or .cse19 .cse5 .cse15)))) [2020-08-22 19:53:08,951 INFO L264 CegarLoopResult]: At program point L303(line 303) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~t1_st~0 0)) (.cse15 (= |old(~t1_st~0)| 0))) (let ((.cse6 (= ~m_pc~0 1)) (.cse0 (not .cse15)) (.cse9 (and .cse16 .cse4)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 ~E_1~0))) (.cse13 (not .cse1)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (and .cse16 (= |old(~t1_st~0)| ~t1_st~0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse4 (= ~m_st~0 0)) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6 .cse9 .cse10) (or .cse11 .cse6 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse8 .cse5 .cse9 .cse10 .cse12 .cse7) (let ((.cse14 (+ ~local~0 1))) (or .cse13 (not (<= ~token~0 .cse14)) (not (<= .cse14 ~token~0)) .cse15 (not .cse2) .cse11 .cse5 .cse12 .cse7)) (or .cse13 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse8 .cse5 .cse11 .cse10)))) [2020-08-22 19:53:08,951 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~t1_st~0 0)) (.cse15 (= |old(~t1_st~0)| 0))) (let ((.cse6 (= ~m_pc~0 1)) (.cse0 (not .cse15)) (.cse9 (and .cse16 .cse4)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 ~E_1~0))) (.cse13 (not .cse1)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (and .cse16 (= |old(~t1_st~0)| ~t1_st~0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse4 (= ~m_st~0 0)) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6 .cse9 .cse10) (or .cse11 .cse6 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse8 .cse5 .cse9 .cse10 .cse12 .cse7) (let ((.cse14 (+ ~local~0 1))) (or .cse13 (not (<= ~token~0 .cse14)) (not (<= .cse14 ~token~0)) .cse15 (not .cse2) .cse11 .cse5 .cse12 .cse7)) (or .cse13 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse8 .cse5 .cse11 .cse10)))) [2020-08-22 19:53:08,951 INFO L264 CegarLoopResult]: At program point activate_threadsEXIT(lines 301 325) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse20 (<= 2 ~m_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse4 (<= activate_threads_~tmp~1 0)) (.cse6 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse14 (and .cse4 .cse6)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= ~m_st~0 0)) (.cse18 (and .cse20 .cse4 (not .cse9) .cse6)) (.cse0 (not .cse23)) (.cse11 (not .cse1)) (.cse3 (= ~E_M~0 0)) (.cse2 (= ~E_M~0 1)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse19 (not (<= 2 |old(~m_st~0)|))) (.cse21 (and .cse17 .cse4 .cse6 .cse7)) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse2 .cse3 .cse13 .cse8 .cse9 .cse14 .cse15) (let ((.cse16 (or .cse5 .cse14))) (or .cse11 .cse12 .cse2 .cse3 .cse13 .cse8 (and (= ~t1_st~0 0) .cse16) .cse15 (and .cse17 .cse16 .cse7))) (or .cse18 .cse9 .cse19) (or .cse20 .cse11 .cse12 .cse3 .cse2 .cse13 .cse8 .cse15 .cse19 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse8 .cse9 .cse15 .cse21) (let ((.cse22 (+ ~local~0 1))) (or .cse18 .cse11 (not (<= ~token~0 .cse22)) (not (<= .cse22 ~token~0)) .cse23 (and .cse5 (<= 1 activate_threads_~tmp~1)) (not .cse2) .cse8 .cse19 .cse10)) (or .cse18 .cse0 .cse11 .cse3 .cse2 .cse13 .cse8 .cse15 .cse19 .cse21 .cse10)))) [2020-08-22 19:53:08,952 INFO L264 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse10)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse4 (= ~m_pc~0 1)) (.cse7 (not (= ~m_st~0 0))) (.cse1 (= ~E_M~0 1)) (.cse2 (= ~E_M~0 0)) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (= ~t1_st~0 0))) (.cse6 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse2 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8)) (or .cse10 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8) (or (not (<= 2 ~m_st~0)) .cse1 .cse2 (not (<= ~token~0 ~local~0)) .cse3 .cse11 .cse6 (not (<= ~local~0 ~token~0)) .cse8)))) [2020-08-22 19:53:08,952 INFO L264 CegarLoopResult]: At program point exists_runnable_threadEXIT(lines 174 193) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1))) (let ((.cse4 (not (= ~t1_st~0 0))) (.cse7 (= ~m_pc~0 1)) (.cse9 (not .cse6)) (.cse1 (= ~E_M~0 0)) (.cse0 (= ~E_M~0 1)) (.cse2 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse3 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse8 (not (= ~m_st~0 0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or (not (<= 2 ~m_st~0)) .cse0 .cse1 (not (<= ~token~0 ~local~0)) .cse2 .cse3 .cse4 (not (<= ~local~0 ~token~0)) .cse5) (or .cse6 .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse8 .cse5) (or .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse10 .cse8 .cse5) (let ((.cse11 (+ ~local~0 1))) (or .cse9 (not (<= ~token~0 .cse11)) (not (<= .cse11 ~token~0)) .cse1 .cse0 .cse2 .cse3 .cse10 .cse8 .cse5))))) [2020-08-22 19:53:08,952 INFO L264 CegarLoopResult]: At program point L189(line 189) the Hoare annotation is: (let ((.cse9 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse0 (not .cse9)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse10 (= ~m_pc~0 1)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (<= 2 ~E_1~0)))) (and (let ((.cse1 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse1)) (not (<= .cse1 ~token~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (or (not (<= 2 ~m_st~0)) .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse8 (not (<= ~local~0 ~token~0)) .cse7) (or .cse9 .cse2 .cse3 .cse4 .cse10 .cse8 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7)))) [2020-08-22 19:53:08,952 INFO L264 CegarLoopResult]: At program point L183(line 183) the Hoare annotation is: (let ((.cse8 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse8)) (.cse1 (= ~E_M~0 1)) (.cse2 (= ~E_M~0 0)) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (= ~m_pc~0 1)) (.cse4 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~m_st~0 0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or (not (<= 2 ~m_st~0)) .cse0 .cse1 .cse2 (not (<= ~token~0 ~local~0)) .cse3 .cse4 (not (<= ~local~0 ~token~0)) .cse5) (let ((.cse6 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse6)) (not (<= .cse6 ~token~0)) .cse1 .cse2 .cse3 .cse4 .cse7 .cse5)) (or .cse8 .cse1 .cse2 .cse3 .cse9 (not (= ~t1_st~0 0)) .cse7 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse7 .cse5)))) [2020-08-22 19:53:08,953 INFO L264 CegarLoopResult]: At program point L182(lines 182 187) the Hoare annotation is: (let ((.cse8 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse8)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (= ~m_pc~0 1)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (<= 2 ~E_1~0)))) (and (let ((.cse1 (+ ~local~0 1))) (or .cse0 (not (<= ~token~0 .cse1)) (not (<= .cse1 ~token~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (or .cse8 .cse2 .cse3 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7)))) [2020-08-22 19:53:08,953 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-08-22 19:53:08,953 INFO L264 CegarLoopResult]: At program point L179(line 179) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= ~E_M~0 1)) (.cse2 (= ~E_M~0 0)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (<= ~local~0 ~token~0))) (.cse6 (not (<= 2 ~E_1~0)))) (and (or .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse2 .cse3 .cse4 (not (<= 2 ~t1_st~0)) .cse5 .cse6) (or .cse0 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) .cse5 .cse6))) [2020-08-22 19:53:08,953 INFO L271 CegarLoopResult]: At program point L178(lines 178 188) the Hoare annotation is: true [2020-08-22 19:53:08,953 INFO L264 CegarLoopResult]: At program point exists_runnable_threadFINAL(lines 174 193) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1))) (let ((.cse4 (not (= ~t1_st~0 0))) (.cse7 (= ~m_pc~0 1)) (.cse9 (not .cse6)) (.cse1 (= ~E_M~0 0)) (.cse0 (= ~E_M~0 1)) (.cse2 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse3 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse8 (not (= ~m_st~0 0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or (not (<= 2 ~m_st~0)) .cse0 .cse1 (not (<= ~token~0 ~local~0)) .cse2 .cse3 .cse4 (not (<= ~local~0 ~token~0)) .cse5) (or .cse6 .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse8 .cse5) (or .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse10 .cse8 .cse5) (let ((.cse11 (+ ~local~0 1))) (or .cse9 (not (<= ~token~0 .cse11)) (not (<= .cse11 ~token~0)) .cse1 .cse0 .cse2 .cse3 .cse10 .cse8 .cse5))))) [2020-08-22 19:53:08,954 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredFINAL(lines 129 147) the Hoare annotation is: true [2020-08-22 19:53:08,954 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-08-22 19:53:08,954 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredEXIT(lines 129 147) the Hoare annotation is: true [2020-08-22 19:53:08,954 INFO L271 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: true [2020-08-22 19:53:08,954 INFO L264 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: (let ((.cse9 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse10 (not (= ~m_st~0 0))) (.cse12 (= ~m_pc~0 1)) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not .cse11)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not .cse9)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7) (let ((.cse8 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse8)) (not (<= .cse8 ~token~0)) .cse9 (not .cse2) .cse5 .cse10 .cse7)) (or .cse11 .cse2 .cse3 .cse5 .cse12 .cse13 .cse10 .cse7) (or .cse11 .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7)))) [2020-08-22 19:53:08,954 INFO L264 CegarLoopResult]: At program point L134(lines 134 139) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_M~0 1)) (.cse2 (= ~E_M~0 0)) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (= ~m_pc~0 1)) (.cse5 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (<= ~local~0 ~token~0))))) [2020-08-22 19:53:08,954 INFO L271 CegarLoopResult]: At program point L133(lines 133 142) the Hoare annotation is: true [2020-08-22 19:53:08,955 INFO L271 CegarLoopResult]: At program point L133-2(lines 133 142) the Hoare annotation is: true [2020-08-22 19:53:08,955 INFO L264 CegarLoopResult]: At program point L287-1(lines 276 299) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse12)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (and .cse10 (= ~E_M~0 |old(~E_M~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse0 .cse10 .cse11) (or .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 .cse11 .cse9 (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,955 INFO L264 CegarLoopResult]: At program point L283(line 283) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse11)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.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)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse10 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse0 .cse3 .cse10) (or .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse10 .cse9 (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,955 INFO L264 CegarLoopResult]: At program point L277-1(lines 276 299) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse11)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.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)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse10 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse0 .cse3 .cse10) (or .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse10 .cse9 (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,956 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse3 (not .cse11)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse0 (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)|))) (.cse2 (= |old(~E_M~0)| 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse10 (= ~m_pc~0 1)) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse1 .cse10) (or .cse0 .cse2 .cse11 .cse4 .cse6 .cse7 .cse10 .cse8 (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,956 INFO L264 CegarLoopResult]: At program point L292-1(lines 273 300) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not .cse10)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse4 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse9) (or .cse2 .cse10 .cse4 .cse3 .cse6 .cse7 (= ~m_pc~0 1) .cse8 (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,956 INFO L264 CegarLoopResult]: At program point L288(line 288) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse9 (= ~m_pc~0 1)) (.cse7 (not (= ~t1_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse10)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse9) (or .cse1 .cse10 .cse3 .cse5 .cse6 .cse9 .cse7 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse8)))) [2020-08-22 19:53:08,956 INFO L264 CegarLoopResult]: At program point L282-1(lines 276 299) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse11)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.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)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse10 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse0 .cse3 .cse10) (or .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse10 .cse9 (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,957 INFO L264 CegarLoopResult]: At program point L278(line 278) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse3 (not .cse11)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse0 (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)|))) (.cse2 (= |old(~E_M~0)| 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse10 (= ~m_pc~0 1)) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse1 .cse10) (or .cse0 .cse2 .cse11 .cse4 .cse6 .cse7 .cse10 .cse8 (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,957 INFO L264 CegarLoopResult]: At program point reset_delta_eventsEXIT(lines 273 300) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not .cse10)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse4 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse9) (or .cse2 .cse10 .cse4 .cse3 .cse6 .cse7 (= ~m_pc~0 1) .cse8 (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,957 INFO L264 CegarLoopResult]: At program point L293(line 293) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse9 (= ~m_pc~0 1)) (.cse7 (not (= ~t1_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse10)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse9) (or .cse1 .cse10 .cse3 .cse5 .cse6 .cse9 .cse7 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse8)))) [2020-08-22 19:53:08,957 INFO L264 CegarLoopResult]: At program point L161(line 161) the Hoare annotation is: (or (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-08-22 19:53:08,957 INFO L264 CegarLoopResult]: At program point L160-1(lines 159 172) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (<= 2 ~m_st~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-08-22 19:53:08,958 INFO L264 CegarLoopResult]: At program point init_threadsEXIT(lines 156 173) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (<= 2 ~m_st~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-08-22 19:53:08,958 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (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-08-22 19:53:08,958 INFO L264 CegarLoopResult]: At program point L168(line 168) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (<= 2 ~m_st~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-08-22 19:53:08,958 INFO L264 CegarLoopResult]: At program point L166(line 166) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (<= 2 ~m_st~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-08-22 19:53:08,958 INFO L264 CegarLoopResult]: At program point L165-1(lines 156 173) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (<= 2 ~m_st~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-08-22 19:53:08,958 INFO L264 CegarLoopResult]: At program point L163(line 163) the Hoare annotation is: (or (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)) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 19:53:08,959 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(~t1_i~0)| 1)) [2020-08-22 19:53:08,959 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 462 473) the Hoare annotation is: true [2020-08-22 19:53:08,959 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 462 473) the Hoare annotation is: true [2020-08-22 19:53:08,959 INFO L271 CegarLoopResult]: At program point L471(line 471) the Hoare annotation is: true [2020-08-22 19:53:08,959 INFO L271 CegarLoopResult]: At program point L468(line 468) the Hoare annotation is: true [2020-08-22 19:53:08,959 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(~t1_i~0)| 1)) [2020-08-22 19:53:08,959 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)) (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_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) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (= |old(~t1_i~0)| 1)) [2020-08-22 19:53:08,960 INFO L271 CegarLoopResult]: At program point errorEXIT(lines 6 13) the Hoare annotation is: true [2020-08-22 19:53:08,960 INFO L271 CegarLoopResult]: At program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: true [2020-08-22 19:53:08,960 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-08-22 19:53:08,960 INFO L271 CegarLoopResult]: At program point errorFINAL(lines 6 13) the Hoare annotation is: true [2020-08-22 19:53:08,960 INFO L264 CegarLoopResult]: At program point masterEXIT(lines 30 73) the Hoare annotation is: (let ((.cse3 (= ~E_M~0 1))) (let ((.cse11 (<= 2 ~m_st~0)) (.cse4 (= ~E_M~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse17 (not .cse3)) (.cse13 (<= ~token~0 ~local~0)) (.cse16 (= ~t1_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse10)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (and .cse11 .cse10 (not .cse4) .cse12 .cse17 .cse13 .cse16 .cse14 .cse15)) (.cse8 (and (<= 2 ~t1_st~0) .cse11 .cse10 .cse17 .cse13 .cse14 .cse15)) (.cse9 (= |old(~m_pc~0)| 1)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not .cse16))) (and (let ((.cse1 (+ |old(~local~0)| 1))) (or .cse0 (not (<= |old(~token~0)| .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse1 |old(~token~0)|)))) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (= |old(~t1_st~0)| 0)) .cse10 .cse9 .cse3 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse4 .cse5 .cse6))))) [2020-08-22 19:53:08,961 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= ~E_M~0 0)) (.cse4 (= ~E_M~0 1)) (.cse16 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse10)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse10 (= ~t1_st~0 0) .cse12 .cse13 .cse14)) (.cse7 (and (<= 2 ~t1_st~0) .cse11 .cse10 (not .cse5) (not .cse4) .cse12 .cse16 .cse13 .cse14 .cse15)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 (not (<= |old(~token~0)| .cse9)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse9 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse10 .cse1 .cse4 .cse5 .cse6 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse8)))) [2020-08-22 19:53:08,961 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse13)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse2 (not (<= 2 |old(~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))) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= |old(~t1_st~0)| ~t1_st~0))) (and (let ((.cse1 (+ |old(~local~0)| 1))) (or .cse0 (not (<= |old(~token~0)| .cse1)) .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 (not (<= .cse1 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) (and .cse3 .cse4 (= ~t1_st~0 0) .cse5 .cse12 .cse6) .cse13 .cse14 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse14 .cse2 .cse8 .cse9 .cse10 .cse11 (and .cse3 .cse4 .cse5 .cse12 .cse6 .cse7))))) [2020-08-22 19:53:08,961 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse0)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-08-22 19:53:08,961 INFO L264 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse12)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (not (= ~m_pc~0 1))) (.cse1 (= |old(~m_pc~0)| 1)) (.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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 (not (<= |old(~token~0)| .cse11)) .cse2 .cse3 .cse4 (and .cse7 .cse8 .cse10) .cse5 .cse6 (not (<= .cse11 |old(~token~0)|)))) (or (and .cse7 .cse8 (= ~t1_st~0 0) .cse9) (not (= |old(~t1_st~0)| 0)) .cse12 .cse1 .cse3 .cse4 .cse5 .cse6)))) [2020-08-22 19:53:08,962 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse0)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-08-22 19:53:08,962 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse6 (not .cse0)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse6 (not (<= |old(~token~0)| .cse7)) .cse8 .cse2 .cse3 .cse4 .cse5 (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 (<= .cse7 |old(~token~0)|)))) (or .cse6 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5)))) [2020-08-22 19:53:08,962 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse3 (= ~E_M~0 1))) (let ((.cse11 (<= 2 ~m_st~0)) (.cse4 (= ~E_M~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse17 (not .cse3)) (.cse13 (<= ~token~0 ~local~0)) (.cse16 (= ~t1_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse10)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (and .cse11 .cse10 (not .cse4) .cse12 .cse17 .cse13 .cse16 .cse14 .cse15)) (.cse8 (and (<= 2 ~t1_st~0) .cse11 .cse10 .cse17 .cse13 .cse14 .cse15)) (.cse9 (= |old(~m_pc~0)| 1)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not .cse16))) (and (let ((.cse1 (+ |old(~local~0)| 1))) (or .cse0 (not (<= |old(~token~0)| .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse1 |old(~token~0)|)))) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (= |old(~t1_st~0)| 0)) .cse10 .cse9 .cse3 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse4 .cse5 .cse6))))) [2020-08-22 19:53:08,963 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse6 (not .cse0)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse6 (not (<= |old(~token~0)| .cse7)) .cse8 .cse2 .cse3 .cse4 .cse5 (not (<= .cse7 |old(~token~0)|)))) (or .cse6 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5)))) [2020-08-22 19:53:08,963 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse0)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-08-22 19:53:08,963 INFO L264 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= ~E_M~0 0)) (.cse4 (= ~E_M~0 1)) (.cse16 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse10)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse10 (= ~t1_st~0 0) .cse12 .cse13 .cse14)) (.cse7 (and (<= 2 ~t1_st~0) .cse11 .cse10 (not .cse5) (not .cse4) .cse12 .cse16 .cse13 .cse14 .cse15)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 (not (<= |old(~token~0)| .cse9)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse9 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse10 .cse1 .cse4 .cse5 .cse6 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse8)))) [2020-08-22 19:53:08,963 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse6 (= |old(~m_pc~0)| 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse5 (not .cse12)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (= ~E_M~0 1)) (.cse9 (= ~E_M~0 0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= |old(~t1_st~0)| 0)) .cse12 .cse6 (and .cse0 (= ~t1_st~0 0) .cse1 .cse2 .cse3) .cse8 .cse9 .cse10 .cse11) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse5 (not (<= |old(~token~0)| .cse13)) .cse7 .cse8 .cse9 (and .cse0 .cse1 .cse3 .cse4) .cse10 .cse11 (not (<= .cse13 |old(~token~0)|))))))) [2020-08-22 19:53:08,964 INFO L264 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse3 (= ~E_M~0 1))) (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_M~0 0)) (.cse16 (not .cse3)) (.cse12 (<= ~token~0 ~local~0)) (.cse15 (= ~t1_i~0 1)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse9)) (.cse10 (= |old(~m_pc~0)| 1)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (and (<= 2 ~t1_st~0) .cse11 .cse9 (not .cse4) .cse16 .cse12 .cse15 .cse13 .cse14)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (and .cse9 (= ~t1_st~0 0) .cse16 .cse12 .cse13)) (.cse8 (not .cse15))) (and (let ((.cse1 (+ |old(~local~0)| 1))) (or .cse0 (not (<= |old(~token~0)| .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse1 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse9 .cse10 .cse3 .cse4 (and .cse11 .cse12 .cse13 .cse14) .cse6 .cse8) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2020-08-22 19:53:08,964 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse12)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (not (= ~m_pc~0 1))) (.cse1 (= |old(~m_pc~0)| 1)) (.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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 (not (<= |old(~token~0)| .cse11)) .cse2 .cse3 .cse4 (and .cse7 .cse8 .cse10) .cse5 .cse6 (not (<= .cse11 |old(~token~0)|)))) (or (and .cse7 .cse8 (= ~t1_st~0 0) .cse9) (not (= |old(~t1_st~0)| 0)) .cse12 .cse1 .cse3 .cse4 .cse5 .cse6)))) [2020-08-22 19:53:08,964 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse0)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-08-22 19:53:08,965 INFO L264 CegarLoopResult]: At program point L37(lines 37 41) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse0)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-08-22 19:53:08,965 INFO L271 CegarLoopResult]: At program point fire_time_eventsEXIT(lines 337 345) the Hoare annotation is: true [2020-08-22 19:53:08,965 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (= ~M_E~0 |old(~M_E~0)|)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 (= ~m_pc~0 1) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2020-08-22 19:53:08,965 INFO L271 CegarLoopResult]: At program point fire_time_eventsFINAL(lines 337 345) the Hoare annotation is: true [2020-08-22 19:53:08,965 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (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-08-22 19:53:08,965 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (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-08-22 19:53:08,965 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (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-08-22 19:53:08,966 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (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-08-22 19:53:08,966 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (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-08-22 19:53:08,966 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (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-08-22 19:53:08,966 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (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 (= ~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-08-22 19:53:08,966 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (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-08-22 19:53:08,966 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-08-22 19:53:08,967 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-08-22 19:53:08,967 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-08-22 19:53:08,967 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-08-22 19:53:08,967 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-08-22 19:53:08,967 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (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-08-22 19:53:08,968 INFO L264 CegarLoopResult]: At program point L225(line 225) the Hoare annotation is: (let ((.cse12 (= |old(~t1_pc~0)| 1)) (.cse15 (<= 2 ~m_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= 2 ~E_1~0)) (.cse13 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse9 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse16 (not (= ~E_M~0 1)) .cse17 .cse18 .cse13 .cse19)) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse0 (= |old(~E_M~0)| 1)) (.cse1 (not .cse12)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse15 (not (= ~m_pc~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse7 .cse8) (let ((.cse14 (= ~E_M~0 |old(~E_M~0)|))) (or .cse10 .cse11 .cse0 .cse9 .cse2 (not (= |old(~m_st~0)| 0)) .cse5 .cse12 .cse6 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse13 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse14 (= |old(~token~0)| ~token~0)) .cse7 (and .cse15 .cse16 .cse17 .cse18 .cse13 .cse19 .cse14))) (or .cse10 .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,968 INFO L264 CegarLoopResult]: At program point L213(lines 213 220) the Hoare annotation is: (let ((.cse20 (= |old(~t1_pc~0)| 1)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse21 (= ~t1_i~0 1)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= eval_~tmp~0 0)))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse9 (let ((.cse22 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse13 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse21 (<= 2 ~E_1~0) .cse15 .cse16))) (.cse10 (= |old(~m_pc~0)| 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse20)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse21)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse10 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse11 (let ((.cse14 (not (= ~m_pc~0 1)))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse12 .cse13 (<= .cse18 ~token~0) (<= ~token~0 .cse18) .cse14 .cse15 .cse16)))) .cse19) .cse6 .cse20 .cse7 (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse16 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 .cse17) .cse9)) (or .cse10 .cse8) (or .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,968 INFO L264 CegarLoopResult]: At program point L205(lines 205 209) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse18 (not (= ~m_pc~0 1))) (.cse23 (= |old(~t1_pc~0)| 1)) (.cse16 (<= 2 ~t1_st~0)) (.cse33 (= ~t1_i~0 1)) (.cse6 (<= 2 ~m_st~0)) (.cse17 (= ~t1_pc~0 1)) (.cse31 (not (= ~E_M~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse32 (not (= ~E_M~0 1))) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse2 (= |old(~m_pc~0)| 1)) (.cse15 (= ~E_1~0 |old(~E_1~0)|)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (= |old(~token~0)| ~token~0)) (.cse0 (and .cse6 .cse17 .cse31 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11)) (.cse1 (and .cse16 .cse6 .cse17 .cse31 .cse32 .cse8 .cse33 .cse9 .cse11)) (.cse27 (not .cse23)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not .cse33)) (.cse5 (and .cse6 .cse18)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse14 (= |old(~E_M~0)| 1)) (.cse28 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse29 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse22 (not (<= 2 |old(~E_1~0)|))) (.cse26 (not (<= 2 |old(~m_st~0)|))) (.cse25 (let ((.cse30 (+ ~local~0 1))) (and .cse16 (<= ~token~0 .cse30) (<= .cse30 ~token~0) .cse17 .cse31 .cse32 .cse33 .cse9 .cse19 .cse10)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 (and .cse15 (or (and .cse16 .cse17 .cse18 .cse19 .cse10 .cse20) (let ((.cse21 (+ |old(~token~0)| 1))) (and .cse16 .cse17 (<= .cse21 ~token~0) (<= ~token~0 .cse21) .cse18 .cse19 .cse10))) .cse12) .cse22 .cse23 (and (= ~local~0 |old(~local~0)|) .cse15 (= ~m_pc~0 |old(~m_pc~0)|) .cse19 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) .cse24 .cse12 .cse20) .cse25) (or .cse2 .cse5 .cse26) (or .cse14 .cse27 (and (= ~m_st~0 |old(~m_st~0)|) .cse17 .cse15 .cse8 .cse11 .cse24 .cse12 .cse20) .cse3 .cse28 (not (<= 2 |old(~t1_st~0)|)) .cse29 .cse22 .cse4 .cse5 .cse26) (or .cse0 .cse1 .cse27 .cse3 .cse4 .cse5 .cse13 .cse14 .cse28 .cse29 .cse22 .cse26 .cse25)))) [2020-08-22 19:53:08,969 INFO L264 CegarLoopResult]: At program point L205-1(lines 200 238) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 0)) (.cse17 (<= 2 ~t1_st~0)) (.cse19 (not (= ~m_pc~0 1))) (.cse33 (= ~t1_i~0 1)) (.cse24 (= |old(~t1_pc~0)| 1)) (.cse7 (<= 2 ~m_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse31 (not (= ~E_M~0 0))) (.cse8 (= ~t1_st~0 0)) (.cse32 (not (= ~E_M~0 1))) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= 2 ~E_1~0)) (.cse11 (not (= eval_~tmp~0 0))) (.cse12 (<= ~local~0 ~token~0))) (let ((.cse0 (= |old(~m_pc~0)| 1)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0)) (.cse3 (and .cse7 .cse18 .cse31 .cse8 .cse32 .cse9 .cse10 .cse11 .cse12)) (.cse27 (not .cse24)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not .cse33)) (.cse1 (and .cse7 .cse19)) (.cse6 (and .cse17 .cse7 .cse18 .cse31 .cse32 .cse9 .cse10 .cse11 .cse12)) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse15 (= |old(~E_M~0)| 1)) (.cse28 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse29 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse26 (let ((.cse30 (+ ~local~0 1))) (and .cse17 (<= ~token~0 .cse30) (<= .cse30 ~token~0) .cse18 .cse31 .cse32 .cse33 .cse10 .cse20 .cse11)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse4 (not (= |old(~m_st~0)| 0)) .cse5 .cse1 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 (and .cse16 (or (and .cse17 .cse18 .cse19 .cse20 .cse11 .cse21) (let ((.cse22 (+ |old(~token~0)| 1))) (and .cse17 .cse18 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse19 .cse20 .cse11))) .cse13) .cse23 .cse24 (and (= ~local~0 |old(~local~0)|) .cse16 (= ~m_pc~0 |old(~m_pc~0)|) .cse20 .cse11 (= |old(~t1_pc~0)| ~t1_pc~0) .cse25 .cse13 .cse21) .cse26) (or .cse15 .cse27 (and (= ~m_st~0 |old(~m_st~0)|) .cse18 .cse16 .cse9 .cse11 .cse12 .cse25 .cse13 .cse21) .cse4 .cse28 (not (<= 2 |old(~t1_st~0)|)) .cse29 .cse23 .cse5 .cse1 .cse2) (or .cse3 .cse27 .cse4 .cse5 .cse1 .cse6 .cse14 .cse15 .cse28 .cse29 .cse23 .cse2 .cse26)))) [2020-08-22 19:53:08,969 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse21 (<= 2 ~t1_st~0)) (.cse23 (not (= ~m_pc~0 1))) (.cse34 (= ~t1_i~0 1)) (.cse20 (= |old(~t1_pc~0)| 1)) (.cse11 (<= 2 ~m_st~0)) (.cse22 (= ~t1_pc~0 1)) (.cse32 (not (= ~E_M~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse33 (not (= ~E_M~0 1))) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (not (= eval_~tmp~0 0))) (.cse16 (<= ~local~0 ~token~0))) (let ((.cse6 (= |old(~m_pc~0)| 1)) (.cse0 (and .cse11 .cse22 .cse32 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16)) (.cse27 (not .cse20)) (.cse7 (= |old(~E_M~0)| 0)) (.cse8 (not .cse34)) (.cse9 (and .cse11 .cse23)) (.cse10 (and .cse21 .cse11 .cse22 .cse32 .cse33 .cse13 .cse14 .cse15 .cse16)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse18 (= |old(~E_M~0)| 1)) (.cse28 (and (= ~m_st~0 |old(~m_st~0)|) .cse22 .cse1 .cse13 .cse16 .cse3 .cse4 .cse5)) (.cse29 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse30 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse19 (not (<= 2 |old(~E_1~0)|))) (.cse26 (not (<= 2 |old(~m_st~0)|))) (.cse25 (let ((.cse31 (+ ~local~0 1))) (and .cse21 (<= ~token~0 .cse31) (<= .cse31 ~token~0) .cse22 .cse32 .cse33 .cse34 .cse14 .cse2 .cse15)))) (and (or .cse0 (and (= ~local~0 |old(~local~0)|) .cse1 (= ~m_pc~0 |old(~m_pc~0)|) .cse2 (= |old(~t1_pc~0)| ~t1_pc~0) .cse3 .cse4 .cse5) .cse6 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse4) .cse17 .cse18 .cse19 .cse20 (and .cse1 (or (and .cse21 .cse22 .cse23 .cse2 .cse15 .cse5) (let ((.cse24 (+ |old(~token~0)| 1))) (and .cse21 .cse22 (<= .cse24 ~token~0) (<= ~token~0 .cse24) .cse23 .cse2 .cse15))) .cse4) .cse25) (or .cse6 .cse9 .cse26) (or .cse18 .cse27 .cse28 .cse7 .cse29 (not (<= 2 |old(~t1_st~0)|)) .cse30 .cse19 .cse8 .cse9 .cse26) (or .cse0 .cse27 .cse7 .cse8 .cse9 .cse10 .cse17 .cse18 .cse28 .cse29 .cse30 .cse19 .cse26 .cse25)))) [2020-08-22 19:53:08,970 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse12 (not (= ~m_pc~0 1))) (.cse17 (<= 2 ~m_st~0)) (.cse11 (= ~t1_pc~0 1)) (.cse18 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse13 (not (= ~t1_st~0 0))) (.cse19 (<= 2 ~E_1~0)) (.cse14 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0)) (.cse21 (= |old(~t1_pc~0)| 1))) (let ((.cse1 (not .cse21)) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse10 (and .cse17 .cse11 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse18 .cse22 .cse13 .cse19 .cse14 .cse20)) (.cse0 (= |old(~E_M~0)| 1)) (.cse2 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not .cse22)) (.cse16 (= |old(~m_pc~0)| 1)) (.cse7 (and .cse17 .cse12)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse15 (= ~E_M~0 |old(~E_M~0)|))) (or .cse9 .cse10 .cse0 (and (not .cse11) (= ~E_1~0 |old(~E_1~0)|) .cse12 .cse13 (= ~m_st~0 0) .cse14 .cse15 (= |old(~token~0)| ~token~0)) .cse16 .cse2 (not (= |old(~m_st~0)| 0)) (and .cse17 .cse18 .cse13 .cse19 .cse14 .cse20 .cse15) .cse5 .cse21 .cse6 .cse7)) (or .cse16 .cse7 .cse8)))) [2020-08-22 19:53:08,970 INFO L264 CegarLoopResult]: At program point L226(line 226) the Hoare annotation is: (let ((.cse12 (= |old(~t1_pc~0)| 1)) (.cse15 (<= 2 ~m_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= 2 ~E_1~0)) (.cse13 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse9 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse16 (not (= ~E_M~0 1)) .cse17 .cse18 .cse13 .cse19)) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse0 (= |old(~E_M~0)| 1)) (.cse1 (not .cse12)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse15 (not (= ~m_pc~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse7 .cse8) (let ((.cse14 (= ~E_M~0 |old(~E_M~0)|))) (or .cse10 .cse11 .cse0 .cse9 .cse2 (not (= |old(~m_st~0)| 0)) .cse5 .cse12 .cse6 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse13 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse14 (= |old(~token~0)| ~token~0)) .cse7 (and .cse15 .cse16 .cse17 .cse18 .cse13 .cse19 .cse14))) (or .cse10 .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,970 INFO L264 CegarLoopResult]: At program point L226-1(line 226) the Hoare annotation is: (let ((.cse12 (= |old(~t1_pc~0)| 1)) (.cse15 (<= 2 ~m_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= 2 ~E_1~0)) (.cse13 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse9 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse16 (not (= ~E_M~0 1)) .cse17 .cse18 .cse13 .cse19)) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse0 (= |old(~E_M~0)| 1)) (.cse1 (not .cse12)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse15 (not (= ~m_pc~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse7 .cse8) (let ((.cse14 (= ~E_M~0 |old(~E_M~0)|))) (or .cse10 .cse11 .cse0 .cse9 .cse2 (not (= |old(~m_st~0)| 0)) .cse5 .cse12 .cse6 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse13 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse14 (= |old(~token~0)| ~token~0)) .cse7 (and .cse15 .cse16 .cse17 .cse18 .cse13 .cse19 .cse14))) (or .cse10 .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,970 INFO L264 CegarLoopResult]: At program point L226-2(line 226) the Hoare annotation is: (let ((.cse12 (= |old(~t1_pc~0)| 1)) (.cse15 (<= 2 ~m_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= 2 ~E_1~0)) (.cse13 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse9 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse16 (not (= ~E_M~0 1)) .cse17 .cse18 .cse13 .cse19)) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse0 (= |old(~E_M~0)| 1)) (.cse1 (not .cse12)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse15 (not (= ~m_pc~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse7 .cse8) (let ((.cse14 (= ~E_M~0 |old(~E_M~0)|))) (or .cse10 .cse11 .cse0 .cse9 .cse2 (not (= |old(~m_st~0)| 0)) .cse5 .cse12 .cse6 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse13 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse14 (= |old(~token~0)| ~token~0)) .cse7 (and .cse15 .cse16 .cse17 .cse18 .cse13 .cse19 .cse14))) (or .cse10 .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,971 INFO L264 CegarLoopResult]: At program point evalEXIT(lines 194 244) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse16 (<= 2 ~m_st~0)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse15)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (and .cse16 (not (= ~m_pc~0 1)))) (.cse10 (and (<= 2 ~t1_st~0) .cse16 .cse12 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse13 (<= 2 ~E_1~0) .cse14))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse8 .cse9) (or .cse1 .cse2 (and (= ~m_st~0 |old(~m_st~0)|) .cse12 (= ~E_1~0 |old(~E_1~0)|) .cse13 .cse14 (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse11 .cse3 (not (= |old(~m_st~0)| 0)) .cse6 .cse15 .cse7 .cse8 .cse10)))) [2020-08-22 19:53:08,971 INFO L264 CegarLoopResult]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 0)) (.cse17 (<= 2 ~t1_st~0)) (.cse19 (not (= ~m_pc~0 1))) (.cse33 (= ~t1_i~0 1)) (.cse24 (= |old(~t1_pc~0)| 1)) (.cse7 (<= 2 ~m_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse31 (not (= ~E_M~0 0))) (.cse8 (= ~t1_st~0 0)) (.cse32 (not (= ~E_M~0 1))) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= 2 ~E_1~0)) (.cse11 (not (= eval_~tmp~0 0))) (.cse12 (<= ~local~0 ~token~0))) (let ((.cse0 (= |old(~m_pc~0)| 1)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0)) (.cse3 (and .cse7 .cse18 .cse31 .cse8 .cse32 .cse9 .cse10 .cse11 .cse12)) (.cse27 (not .cse24)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not .cse33)) (.cse1 (and .cse7 .cse19)) (.cse6 (and .cse17 .cse7 .cse18 .cse31 .cse32 .cse9 .cse10 .cse11 .cse12)) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse15 (= |old(~E_M~0)| 1)) (.cse28 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse29 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse26 (let ((.cse30 (+ ~local~0 1))) (and .cse17 (<= ~token~0 .cse30) (<= .cse30 ~token~0) .cse18 .cse31 .cse32 .cse33 .cse10 .cse20 .cse11)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse4 (not (= |old(~m_st~0)| 0)) .cse5 .cse1 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 (and .cse16 (or (and .cse17 .cse18 .cse19 .cse20 .cse11 .cse21) (let ((.cse22 (+ |old(~token~0)| 1))) (and .cse17 .cse18 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse19 .cse20 .cse11))) .cse13) .cse23 .cse24 (and (= ~local~0 |old(~local~0)|) .cse16 (= ~m_pc~0 |old(~m_pc~0)|) .cse20 .cse11 (= |old(~t1_pc~0)| ~t1_pc~0) .cse25 .cse13 .cse21) .cse26) (or .cse15 .cse27 (and (= ~m_st~0 |old(~m_st~0)|) .cse18 .cse16 .cse9 .cse11 .cse12 .cse25 .cse13 .cse21) .cse4 .cse28 (not (<= 2 |old(~t1_st~0)|)) .cse29 .cse23 .cse5 .cse1 .cse2) (or .cse3 .cse27 .cse4 .cse5 .cse1 .cse6 .cse14 .cse15 .cse28 .cse29 .cse23 .cse2 .cse26)))) [2020-08-22 19:53:08,971 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse16 (<= 2 ~m_st~0)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse15)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (and .cse16 (not (= ~m_pc~0 1)))) (.cse10 (and (<= 2 ~t1_st~0) .cse16 .cse12 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse13 (<= 2 ~E_1~0) .cse14))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse8 .cse9) (or .cse1 .cse2 (and (= ~m_st~0 |old(~m_st~0)|) .cse12 (= ~E_1~0 |old(~E_1~0)|) .cse13 .cse14 (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse11 .cse3 (not (= |old(~m_st~0)| 0)) .cse6 .cse15 .cse7 .cse8 .cse10)))) [2020-08-22 19:53:08,972 INFO L264 CegarLoopResult]: At program point L227(lines 227 234) the Hoare annotation is: (let ((.cse12 (= |old(~t1_pc~0)| 1)) (.cse15 (<= 2 ~m_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= 2 ~E_1~0)) (.cse13 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse9 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse16 (not (= ~E_M~0 1)) .cse17 .cse18 .cse13 .cse19)) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse0 (= |old(~E_M~0)| 1)) (.cse1 (not .cse12)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse15 (not (= ~m_pc~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse7 .cse8) (let ((.cse14 (= ~E_M~0 |old(~E_M~0)|))) (or .cse10 .cse11 .cse0 .cse9 .cse2 (not (= |old(~m_st~0)| 0)) .cse5 .cse12 .cse6 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse13 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse14 (= |old(~token~0)| ~token~0)) .cse7 (and .cse15 .cse16 .cse17 .cse18 .cse13 .cse19 .cse14))) (or .cse10 .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,972 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse22 (= |old(~t1_pc~0)| 1))) (let ((.cse17 (not (= |old(~t1_st~0)| 0))) (.cse0 (= |old(~E_M~0)| 1)) (.cse1 (not .cse22)) (.cse2 (= |old(~E_M~0)| 0)) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse8 (= ~t1_pc~0 1)) (.cse19 (= ~t1_st~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse18 (= ~local~0 |old(~local~0)|)) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse20 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~m_pc~0)| 1)) (.cse16 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16) (or .cse17 (and .cse18 .cse9 .cse19 .cse10 (= ~m_st~0 0) .cse20 .cse14 .cse15) .cse0 .cse21 .cse2 (not (= |old(~m_st~0)| 0)) .cse5 .cse22 .cse6) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse14 .cse15) .cse5 .cse6 .cse16) (or (and .cse18 .cse7 .cse9 .cse10 .cse20 .cse13 .cse14 .cse15) .cse21 .cse16)))) [2020-08-22 19:53:08,972 INFO L264 CegarLoopResult]: At program point L215(line 215) the Hoare annotation is: (let ((.cse21 (= |old(~t1_pc~0)| 1)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (= ~m_st~0 0)) (.cse19 (not (= eval_~tmp~0 0)))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse10 (= |old(~m_pc~0)| 1)) (.cse9 (let ((.cse23 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse23) (<= .cse23 ~token~0) .cse13 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse22 .cse16 .cse17 .cse19))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse21)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse22)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse8) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse20 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 .cse1 (and .cse11 (let ((.cse15 (not (= ~m_pc~0 1)))) (or (let ((.cse14 (+ |old(~token~0)| 1))) (and .cse12 .cse13 (<= .cse14 ~token~0) (<= ~token~0 .cse14) .cse15 .cse16 .cse17)) (and .cse12 .cse13 .cse15 .cse16 .cse17 .cse18))) .cse19 .cse20) .cse10 .cse3 (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse17 .cse19 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18 .cse20) .cse6 .cse21 .cse7 .cse9)) (or .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,973 INFO L264 CegarLoopResult]: At program point L211(line 211) the Hoare annotation is: (let ((.cse20 (= |old(~t1_pc~0)| 1)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse21 (= ~t1_i~0 1)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= eval_~tmp~0 0)))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse9 (let ((.cse22 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse13 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse21 (<= 2 ~E_1~0) .cse15 .cse16))) (.cse10 (= |old(~m_pc~0)| 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse20)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse21)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse10 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse11 (let ((.cse14 (not (= ~m_pc~0 1)))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse12 .cse13 (<= .cse18 ~token~0) (<= ~token~0 .cse18) .cse14 .cse15 .cse16)))) .cse19) .cse6 .cse20 .cse7 (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse16 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 .cse17) .cse9)) (or .cse10 .cse8) (or .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,973 INFO L264 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse13 (not (= ~m_pc~0 1))) (.cse19 (= |old(~t1_pc~0)| 1)) (.cse23 (= ~t1_st~0 0)) (.cse32 (= ~t1_i~0 1)) (.cse1 (= ~m_st~0 0)) (.cse2 (not (= |eval_#t~ret1| 0))) (.cse11 (<= 2 ~t1_st~0)) (.cse22 (<= 2 ~m_st~0)) (.cse12 (= ~t1_pc~0 1)) (.cse33 (not (= ~E_M~0 0))) (.cse34 (not (= ~E_M~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= 2 ~E_1~0)) (.cse14 (not (= eval_~tmp~0 0))) (.cse26 (<= ~local~0 ~token~0))) (let ((.cse6 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse11 .cse22 .cse12 .cse33 .cse34 .cse24 .cse25 .cse14 .cse26)) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse20 (let ((.cse35 (+ ~local~0 1))) (and .cse11 (<= ~token~0 .cse35) (<= .cse35 ~token~0) .cse12 .cse33 .cse34 .cse32 .cse25 .cse1 .cse14 .cse2))) (.cse21 (and .cse22 .cse12 .cse33 .cse23 .cse34 .cse24 .cse32 .cse25 .cse14 .cse26 .cse2)) (.cse17 (= |old(~E_M~0)| 1)) (.cse28 (not .cse19)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse7 (= |old(~E_M~0)| 0)) (.cse29 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse31 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse18 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse32)) (.cse9 (and .cse22 .cse13)) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (or (and (= ~local~0 |old(~local~0)|) .cse0 (= ~m_pc~0 |old(~m_pc~0)|) .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse9 .cse10 (and .cse0 (or (and .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse5) (let ((.cse15 (+ |old(~token~0)| 1))) (and .cse11 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse13 .cse1 .cse14 .cse2))) .cse4) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse24 .cse25 .cse14 .cse26 .cse2 .cse4)) (or .cse6 .cse9 .cse27) (or .cse28 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse29 (and .cse30 .cse12 .cse0 .cse24 .cse26 .cse2 .cse3 .cse4 .cse5) .cse31 .cse18 .cse20 .cse21 .cse27) (or .cse17 .cse28 (and .cse30 .cse12 .cse0 .cse24 .cse26 .cse3 .cse4 .cse5) .cse7 .cse29 (not (<= 2 |old(~t1_st~0)|)) .cse31 .cse18 .cse8 .cse9 .cse27)))) [2020-08-22 19:53:08,974 INFO L264 CegarLoopResult]: At program point L203-1(line 203) the Hoare annotation is: (let ((.cse13 (not (= ~m_pc~0 1))) (.cse19 (= |old(~t1_pc~0)| 1)) (.cse23 (= ~t1_st~0 0)) (.cse32 (= ~t1_i~0 1)) (.cse1 (= ~m_st~0 0)) (.cse2 (not (= |eval_#t~ret1| 0))) (.cse11 (<= 2 ~t1_st~0)) (.cse22 (<= 2 ~m_st~0)) (.cse12 (= ~t1_pc~0 1)) (.cse33 (not (= ~E_M~0 0))) (.cse34 (not (= ~E_M~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= 2 ~E_1~0)) (.cse14 (not (= eval_~tmp~0 0))) (.cse26 (<= ~local~0 ~token~0))) (let ((.cse6 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse11 .cse22 .cse12 .cse33 .cse34 .cse24 .cse25 .cse14 .cse26)) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse20 (let ((.cse35 (+ ~local~0 1))) (and .cse11 (<= ~token~0 .cse35) (<= .cse35 ~token~0) .cse12 .cse33 .cse34 .cse32 .cse25 .cse1 .cse14 .cse2))) (.cse21 (and .cse22 .cse12 .cse33 .cse23 .cse34 .cse24 .cse32 .cse25 .cse14 .cse26 .cse2)) (.cse17 (= |old(~E_M~0)| 1)) (.cse28 (not .cse19)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse7 (= |old(~E_M~0)| 0)) (.cse29 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse31 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse18 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse32)) (.cse9 (and .cse22 .cse13)) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (or (and (= ~local~0 |old(~local~0)|) .cse0 (= ~m_pc~0 |old(~m_pc~0)|) .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse9 .cse10 (and .cse0 (or (and .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse5) (let ((.cse15 (+ |old(~token~0)| 1))) (and .cse11 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse13 .cse1 .cse14 .cse2))) .cse4) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse24 .cse25 .cse14 .cse26 .cse2 .cse4)) (or .cse6 .cse9 .cse27) (or .cse28 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse29 (and .cse30 .cse12 .cse0 .cse24 .cse26 .cse2 .cse3 .cse4 .cse5) .cse31 .cse18 .cse20 .cse21 .cse27) (or .cse17 .cse28 (and .cse30 .cse12 .cse0 .cse24 .cse26 .cse3 .cse4 .cse5) .cse7 .cse29 (not (<= 2 |old(~t1_st~0)|)) .cse31 .cse18 .cse8 .cse9 .cse27)))) [2020-08-22 19:53:08,974 INFO L264 CegarLoopResult]: At program point L203-2(line 203) the Hoare annotation is: (let ((.cse14 (not (= ~m_pc~0 1))) (.cse20 (= |old(~t1_pc~0)| 1)) (.cse23 (= ~t1_st~0 0)) (.cse5 (= ~m_st~0 0)) (.cse6 (not (= eval_~tmp~0 0))) (.cse7 (not (= |eval_#t~ret1| 0))) (.cse12 (<= 2 ~t1_st~0)) (.cse22 (<= 2 ~m_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse32 (not (= ~E_M~0 0))) (.cse33 (not (= ~E_M~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse31 (= ~t1_i~0 1)) (.cse25 (<= 2 ~E_1~0)) (.cse26 (<= ~local~0 ~token~0))) (let ((.cse0 (and .cse12 .cse22 .cse13 .cse32 .cse33 .cse24 .cse31 .cse25 .cse26)) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse18 (let ((.cse34 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse34) (<= .cse34 ~token~0) .cse13 .cse32 .cse33 .cse25 .cse5 .cse6 .cse7))) (.cse21 (and .cse22 .cse13 .cse32 .cse23 .cse33 .cse24 .cse31 .cse25 .cse6 .cse26 .cse7)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse17 (= |old(~E_M~0)| 1)) (.cse27 (not .cse20)) (.cse4 (= ~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)) (.cse2 (= |old(~E_M~0)| 0)) (.cse28 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse29 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse19 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse31)) (.cse11 (and .cse22 .cse14)) (.cse30 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 (and (= ~local~0 |old(~local~0)|) .cse4 (= ~m_pc~0 |old(~m_pc~0)|) .cse5 .cse6 (= |old(~t1_pc~0)| ~t1_pc~0) .cse7 .cse8 .cse9 .cse10) .cse11 (and .cse4 (or (and .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse10) (let ((.cse15 (+ |old(~token~0)| 1))) (and .cse12 .cse13 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse14 .cse5 .cse6 .cse7))) .cse9) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse24 .cse25 .cse6 .cse26 .cse7 .cse9)) (or .cse0 .cse27 .cse2 .cse3 .cse11 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse21 .cse30) (or .cse1 .cse11 .cse30) (or .cse17 .cse27 (and (= ~m_st~0 |old(~m_st~0)|) .cse13 .cse4 .cse24 .cse26 .cse8 .cse9 .cse10) .cse2 .cse28 (not (<= 2 |old(~t1_st~0)|)) .cse29 .cse19 .cse3 .cse11 .cse30)))) [2020-08-22 19:53:08,975 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse21 (<= 2 ~t1_st~0)) (.cse23 (not (= ~m_pc~0 1))) (.cse34 (= ~t1_i~0 1)) (.cse20 (= |old(~t1_pc~0)| 1)) (.cse11 (<= 2 ~m_st~0)) (.cse22 (= ~t1_pc~0 1)) (.cse32 (not (= ~E_M~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse33 (not (= ~E_M~0 1))) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (not (= eval_~tmp~0 0))) (.cse16 (<= ~local~0 ~token~0))) (let ((.cse6 (= |old(~m_pc~0)| 1)) (.cse0 (and .cse11 .cse22 .cse32 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16)) (.cse27 (not .cse20)) (.cse7 (= |old(~E_M~0)| 0)) (.cse8 (not .cse34)) (.cse9 (and .cse11 .cse23)) (.cse10 (and .cse21 .cse11 .cse22 .cse32 .cse33 .cse13 .cse14 .cse15 .cse16)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse18 (= |old(~E_M~0)| 1)) (.cse28 (and (= ~m_st~0 |old(~m_st~0)|) .cse22 .cse1 .cse13 .cse16 .cse3 .cse4 .cse5)) (.cse29 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse30 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse19 (not (<= 2 |old(~E_1~0)|))) (.cse26 (not (<= 2 |old(~m_st~0)|))) (.cse25 (let ((.cse31 (+ ~local~0 1))) (and .cse21 (<= ~token~0 .cse31) (<= .cse31 ~token~0) .cse22 .cse32 .cse33 .cse34 .cse14 .cse2 .cse15)))) (and (or .cse0 (and (= ~local~0 |old(~local~0)|) .cse1 (= ~m_pc~0 |old(~m_pc~0)|) .cse2 (= |old(~t1_pc~0)| ~t1_pc~0) .cse3 .cse4 .cse5) .cse6 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse4) .cse17 .cse18 .cse19 .cse20 (and .cse1 (or (and .cse21 .cse22 .cse23 .cse2 .cse15 .cse5) (let ((.cse24 (+ |old(~token~0)| 1))) (and .cse21 .cse22 (<= .cse24 ~token~0) (<= ~token~0 .cse24) .cse23 .cse2 .cse15))) .cse4) .cse25) (or .cse6 .cse9 .cse26) (or .cse18 .cse27 .cse28 .cse7 .cse29 (not (<= 2 |old(~t1_st~0)|)) .cse30 .cse19 .cse8 .cse9 .cse26) (or .cse0 .cse27 .cse7 .cse8 .cse9 .cse10 .cse17 .cse18 .cse28 .cse29 .cse30 .cse19 .cse26 .cse25)))) [2020-08-22 19:53:08,975 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse18 (<= 2 ~t1_st~0)) (.cse12 (= ~t1_pc~0 1)) (.cse15 (not (= eval_~tmp~0 0))) (.cse21 (= ~t1_i~0 1)) (.cse11 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse11)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse10 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse21)) (.cse8 (let ((.cse20 (+ ~local~0 1))) (and .cse18 (<= ~token~0 .cse20) (<= .cse20 ~token~0) .cse12 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse21 (<= 2 ~E_1~0) .cse15)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse9) (or .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse9) (let ((.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse17 (= |old(~token~0)| ~token~0)) (.cse14 (not (= ~m_pc~0 1))) (.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 .cse1 .cse10 .cse3 (not (= |old(~m_st~0)| 0)) .cse6 .cse11 .cse7 .cse8 (and (not .cse12) .cse13 (= ~t1_st~0 0) .cse14 .cse15 .cse16 .cse17) (and .cse13 .cse15 (or (and .cse18 .cse12 .cse14 .cse17) (let ((.cse19 (+ |old(~token~0)| 1))) (and .cse18 .cse12 (<= .cse19 ~token~0) (<= ~token~0 .cse19) .cse14))) .cse16)))))) [2020-08-22 19:53:08,975 INFO L264 CegarLoopResult]: At program point L212(line 212) the Hoare annotation is: (let ((.cse20 (= |old(~t1_pc~0)| 1)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse21 (= ~t1_i~0 1)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= eval_~tmp~0 0)))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse9 (let ((.cse22 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse13 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse21 (<= 2 ~E_1~0) .cse15 .cse16))) (.cse10 (= |old(~m_pc~0)| 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse20)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse21)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse10 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse11 (let ((.cse14 (not (= ~m_pc~0 1)))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse12 .cse13 (<= .cse18 ~token~0) (<= ~token~0 .cse18) .cse14 .cse15 .cse16)))) .cse19) .cse6 .cse20 .cse7 (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse16 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 .cse17) .cse9)) (or .cse10 .cse8) (or .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,976 INFO L264 CegarLoopResult]: At program point L212-1(line 212) the Hoare annotation is: (let ((.cse20 (= |old(~t1_pc~0)| 1)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse21 (= ~t1_i~0 1)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= eval_~tmp~0 0)))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse9 (let ((.cse22 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse13 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse21 (<= 2 ~E_1~0) .cse15 .cse16))) (.cse10 (= |old(~m_pc~0)| 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse20)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse21)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse10 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse11 (let ((.cse14 (not (= ~m_pc~0 1)))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse12 .cse13 (<= .cse18 ~token~0) (<= ~token~0 .cse18) .cse14 .cse15 .cse16)))) .cse19) .cse6 .cse20 .cse7 (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse16 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 .cse17) .cse9)) (or .cse10 .cse8) (or .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,976 INFO L264 CegarLoopResult]: At program point L212-2(line 212) the Hoare annotation is: (let ((.cse20 (= |old(~t1_pc~0)| 1)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse21 (= ~t1_i~0 1)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= eval_~tmp~0 0)))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse9 (let ((.cse22 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse13 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse21 (<= 2 ~E_1~0) .cse15 .cse16))) (.cse10 (= |old(~m_pc~0)| 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse20)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse21)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse10 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse11 (let ((.cse14 (not (= ~m_pc~0 1)))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse12 .cse13 (<= .cse18 ~token~0) (<= ~token~0 .cse18) .cse14 .cse15 .cse16)))) .cse19) .cse6 .cse20 .cse7 (and (= ~local~0 |old(~local~0)|) .cse11 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse16 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 .cse17) .cse9)) (or .cse10 .cse8) (or .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8)))) [2020-08-22 19:53:08,976 INFO L264 CegarLoopResult]: At program point L229(line 229) the Hoare annotation is: (let ((.cse15 (<= 2 ~m_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse20 (= ~t1_i~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse13 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0)) (.cse12 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse12)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse6 (and .cse15 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse16 (not (= ~E_M~0 1)) .cse17 .cse20 .cse18 .cse13 .cse19)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse20)) (.cse9 (and .cse15 (not (= ~m_pc~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse9 .cse10) (let ((.cse14 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 .cse1 .cse11 .cse3 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse12 .cse8 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse13 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse14 (= |old(~token~0)| ~token~0)) .cse9 (and .cse15 .cse16 .cse17 .cse18 .cse13 .cse19 .cse14)))))) [2020-08-22 19:53:08,976 INFO L271 CegarLoopResult]: At program point stop_simulationFINAL(lines 384 402) the Hoare annotation is: true [2020-08-22 19:53:08,977 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-08-22 19:53:08,977 INFO L271 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: true [2020-08-22 19:53:08,977 INFO L271 CegarLoopResult]: At program point L393(line 393) the Hoare annotation is: true [2020-08-22 19:53:08,977 INFO L271 CegarLoopResult]: At program point L392(lines 392 397) the Hoare annotation is: true [2020-08-22 19:53:08,977 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-08-22 19:53:08,977 INFO L271 CegarLoopResult]: At program point stop_simulationEXIT(lines 384 402) the Hoare annotation is: true [2020-08-22 19:53:08,977 INFO L271 CegarLoopResult]: At program point L390-1(line 390) the Hoare annotation is: true [2020-08-22 19:53:08,978 INFO L271 CegarLoopResult]: At program point L390-2(line 390) the Hoare annotation is: true [2020-08-22 19:53:08,978 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-08-22 19:53:08,978 INFO L271 CegarLoopResult]: At program point L390-3(line 390) the Hoare annotation is: true [2020-08-22 19:53:08,978 INFO L271 CegarLoopResult]: At program point L386(line 386) the Hoare annotation is: true [2020-08-22 19:53:08,978 INFO L271 CegarLoopResult]: At program point update_channelsEXIT(lines 148 155) the Hoare annotation is: true [2020-08-22 19:53:08,978 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-08-22 19:53:08,978 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (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)|))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 19:53:08,979 INFO L264 CegarLoopResult]: At program point L254-1(lines 248 271) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (= ~t1_pc~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))) (.cse7 (= ~m_pc~0 1))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse3 .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 19:53:08,979 INFO L264 CegarLoopResult]: At program point L250(line 250) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (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)|))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 19:53:08,979 INFO L264 CegarLoopResult]: At program point L265(line 265) the Hoare annotation is: (let ((.cse1 (= ~m_pc~0 1)) (.cse0 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (or .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse1 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse2 (not .cse3) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-08-22 19:53:08,979 INFO L264 CegarLoopResult]: At program point L259-1(lines 248 271) the Hoare annotation is: (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (and .cse7 (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (= ~m_pc~0 1))) (and (or .cse0 (not .cse1) .cse2 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse7 .cse8) (or .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)))))) [2020-08-22 19:53:08,979 INFO L264 CegarLoopResult]: At program point L255(line 255) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (= ~t1_pc~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))) (.cse7 (= ~m_pc~0 1))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse3 .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 19:53:08,980 INFO L264 CegarLoopResult]: At program point L249-1(lines 248 271) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (= ~t1_pc~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))) (.cse7 (= ~m_pc~0 1))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse3 .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 19:53:08,980 INFO L264 CegarLoopResult]: At program point fire_delta_eventsEXIT(lines 245 272) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse0 (= |old(~E_M~0)| 1)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or (not (<= 2 ~m_st~0)) (not .cse1) .cse0 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-08-22 19:53:08,980 INFO L264 CegarLoopResult]: At program point L264-1(lines 245 272) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse0 (= |old(~E_M~0)| 1)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or (not (<= 2 ~m_st~0)) (not .cse1) .cse0 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-08-22 19:53:08,980 INFO L264 CegarLoopResult]: At program point L260(line 260) the Hoare annotation is: (let ((.cse1 (= ~m_pc~0 1)) (.cse0 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (or .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse1 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse2 (not .cse3) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-08-22 19:53:08,980 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,981 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,981 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,981 INFO L264 CegarLoopResult]: At program point L411(line 411) 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) (= ~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-08-22 19:53:08,981 INFO L271 CegarLoopResult]: At program point start_simulationEXIT(lines 403 461) the Hoare annotation is: true [2020-08-22 19:53:08,981 INFO L264 CegarLoopResult]: At program point L411-1(line 411) 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) (= ~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-08-22 19:53:08,982 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,982 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,982 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,982 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) 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) (= ~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-08-22 19:53:08,982 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= ~E_M~0 |old(~E_M~0)|))) (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 (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and (not (= ~t1_pc~0 1)) .cse0 (= ~t1_st~0 0) .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 (= |old(~token~0)| ~token~0)))) [2020-08-22 19:53:08,983 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,983 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,983 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,983 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,983 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 1)))) (or (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (and (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) .cse0 (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= |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 (<= 2 ~m_st~0) .cse0))) [2020-08-22 19:53:08,984 INFO L264 CegarLoopResult]: At program point L405(line 405) 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) (= ~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-08-22 19:53:08,984 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (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) (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-08-22 19:53:08,984 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (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) (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-08-22 19:53:08,984 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (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) (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-08-22 19:53:08,984 INFO L264 CegarLoopResult]: At program point L426-1(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (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) (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-08-22 19:53:08,985 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) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= |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 .cse8) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-08-22 19:53:08,985 INFO L264 CegarLoopResult]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (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) (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-08-22 19:53:08,985 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) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= |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 .cse8) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-08-22 19:53:08,985 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 1)))) (or (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (and (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) .cse0 (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= |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 (<= 2 ~m_st~0) .cse0))) [2020-08-22 19:53:08,985 INFO L264 CegarLoopResult]: At program point L410(line 410) 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) (= ~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-08-22 19:53:08,986 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,986 INFO L264 CegarLoopResult]: At program point L406(line 406) 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) (= ~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-08-22 19:53:08,986 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,986 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,986 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,987 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 (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 19:53:08,987 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-08-22 19:53:08,987 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) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= |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 .cse8) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-08-22 19:53:08,987 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse11 (= ~t1_st~0 0)) (.cse15 (<= 0 is_master_triggered_~__retres1~0)) (.cse14 (= ~m_pc~0 1)) (.cse16 (<= is_master_triggered_~__retres1~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (<= 2 ~E_1~0))) (.cse1 (not .cse13)) (.cse0 (not (<= 2 ~m_st~0))) (.cse12 (and .cse15 (not .cse14) .cse16)) (.cse2 (and .cse15 .cse16)) (.cse4 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not .cse11)) (.cse8 (not (<= ~local~0 ~token~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)) (<= 1 is_master_triggered_~__retres1~0) (not (<= .cse10 ~token~0)) .cse11 (not .cse4) .cse6 .cse9 .cse12)) (or .cse2 .cse13 .cse4 .cse3 .cse6 .cse14 .cse7 (not (= ~m_st~0 0)) .cse9) (or .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse14 .cse12) (or .cse2 .cse13 .cse4 .cse3 .cse5 .cse6 .cse14 .cse7 .cse8)))) [2020-08-22 19:53:08,987 INFO L264 CegarLoopResult]: At program point is_master_triggeredFINAL(lines 110 128) the Hoare annotation is: (let ((.cse3 (= ~t1_st~0 0)) (.cse15 (<= 0 |is_master_triggered_#res|)) (.cse16 (<= |is_master_triggered_#res| 0)) (.cse17 (<= 0 is_master_triggered_~__retres1~0)) (.cse14 (= ~m_pc~0 1)) (.cse18 (<= is_master_triggered_~__retres1~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse13)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (and .cse15 .cse16 .cse17 (not .cse14) .cse18)) (.cse8 (and .cse15 .cse16 .cse17 .cse18)) (.cse5 (= ~E_M~0 1)) (.cse9 (= ~E_M~0 0)) (.cse6 (not (= ~t1_i~0 1))) (.cse12 (not .cse3)) (.cse7 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) (not (<= .cse2 ~token~0)) .cse3 .cse4 (not .cse5) .cse6 (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0)) .cse7)) (or .cse1 .cse8 .cse5 .cse9 .cse10 .cse6 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse1 .cse8 .cse9 .cse5 .cse10 .cse6 .cse12 .cse11 .cse7) (or .cse13 .cse8 .cse5 .cse9 .cse10 .cse6 .cse14 .cse12 .cse11) (or .cse0 .cse4 .cse14) (or .cse13 .cse8 .cse5 .cse9 .cse6 .cse14 .cse12 (not (= ~m_st~0 0)) .cse7)))) [2020-08-22 19:53:08,988 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse1 (= ~m_pc~0 1)) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_st~0 0))) (.cse7 (not (<= 2 ~E_1~0))) (.cse10 (not .cse2)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (= ~m_st~0 0)) .cse7) (or .cse2 .cse3 .cse4 .cse8 .cse5 .cse1 .cse6 .cse9) (or .cse0 .cse10 .cse3 .cse4 .cse8 .cse5 .cse6 .cse9 .cse7) (or .cse10 .cse3 .cse4 .cse8 .cse5 (not (<= 2 ~t1_st~0)) .cse9)))) [2020-08-22 19:53:08,988 INFO L264 CegarLoopResult]: At program point L115(lines 115 120) the Hoare annotation is: (let ((.cse5 (not (= ~t1_st~0 0))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse0 (= ~m_pc~0 1)) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or (not (<= 2 ~m_st~0)) .cse0) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0))) (or .cse1 .cse2 .cse3 .cse6 .cse4 .cse0 .cse5 .cse7) (or (not .cse1) .cse2 .cse3 .cse6 .cse4 .cse0 (not (<= 2 ~t1_st~0)) .cse7))) [2020-08-22 19:53:08,988 INFO L271 CegarLoopResult]: At program point L114(lines 114 123) the Hoare annotation is: true [2020-08-22 19:53:08,988 INFO L264 CegarLoopResult]: At program point L114-2(lines 114 123) the Hoare annotation is: (let ((.cse0 (+ ~local~0 1))) (or (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-08-22 19:53:08,988 INFO L264 CegarLoopResult]: At program point is_master_triggeredEXIT(lines 110 128) the Hoare annotation is: (let ((.cse3 (= ~t1_st~0 0)) (.cse15 (<= 0 |is_master_triggered_#res|)) (.cse16 (<= |is_master_triggered_#res| 0)) (.cse17 (<= 0 is_master_triggered_~__retres1~0)) (.cse14 (= ~m_pc~0 1)) (.cse18 (<= is_master_triggered_~__retres1~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse13)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (and .cse15 .cse16 .cse17 (not .cse14) .cse18)) (.cse8 (and .cse15 .cse16 .cse17 .cse18)) (.cse5 (= ~E_M~0 1)) (.cse9 (= ~E_M~0 0)) (.cse6 (not (= ~t1_i~0 1))) (.cse12 (not .cse3)) (.cse7 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) (not (<= .cse2 ~token~0)) .cse3 .cse4 (not .cse5) .cse6 (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0)) .cse7)) (or .cse1 .cse8 .cse5 .cse9 .cse10 .cse6 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse1 .cse8 .cse9 .cse5 .cse10 .cse6 .cse12 .cse11 .cse7) (or .cse13 .cse8 .cse5 .cse9 .cse10 .cse6 .cse14 .cse12 .cse11) (or .cse0 .cse4 .cse14) (or .cse13 .cse8 .cse5 .cse9 .cse6 .cse14 .cse12 (not (= ~m_st~0 0)) .cse7)))) [2020-08-22 19:53:08,989 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-08-22 19:53:08,989 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 19:53:08,989 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (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-08-22 19:53:08,989 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 19:53:08,989 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 19:53:08,989 INFO L264 CegarLoopResult]: At program point L351(line 351) the Hoare annotation is: (let ((.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))) (.cse0 (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)|))) (.cse1 (not (<= 2 ~m_st~0)))) (and (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) (or .cse0 .cse1 (= ~m_pc~0 1)))) [2020-08-22 19:53:08,989 INFO L264 CegarLoopResult]: At program point reset_time_eventsEXIT(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_M~0)| 1)) (.cse4 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (= |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 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8))) [2020-08-22 19:53:08,990 INFO L264 CegarLoopResult]: At program point L366(line 366) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7) (or .cse0 (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7))) [2020-08-22 19:53:08,990 INFO L264 CegarLoopResult]: At program point L360-1(lines 349 372) the Hoare annotation is: (let ((.cse9 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_M~0)| 1)) (.cse4 (and .cse9 (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (= |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))) (.cse0 (not (<= 2 ~m_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse9 (= ~m_pc~0 1))))) [2020-08-22 19:53:08,990 INFO L264 CegarLoopResult]: At program point L356(line 356) the Hoare annotation is: (let ((.cse1 (= |old(~E_M~0)| 1)) (.cse2 (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))) (.cse0 (not (<= 2 ~m_st~0))) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse3 (= ~m_pc~0 1)))) [2020-08-22 19:53:08,990 INFO L264 CegarLoopResult]: At program point L350-1(lines 349 372) the Hoare annotation is: (let ((.cse1 (= |old(~E_M~0)| 1)) (.cse2 (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))) (.cse0 (not (<= 2 ~m_st~0))) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse3 (= ~m_pc~0 1)))) [2020-08-22 19:53:08,990 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.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))) (.cse0 (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)|))) (.cse1 (not (<= 2 ~m_st~0)))) (and (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) (or .cse0 .cse1 (= ~m_pc~0 1)))) [2020-08-22 19:53:08,990 INFO L264 CegarLoopResult]: At program point L365-1(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_M~0)| 1)) (.cse4 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (= |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 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8))) [2020-08-22 19:53:08,991 INFO L264 CegarLoopResult]: At program point L361(line 361) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7) (or .cse0 (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 (not (<= 2 ~t1_st~0)) .cse7))) [2020-08-22 19:53:08,991 INFO L264 CegarLoopResult]: At program point L355-1(lines 349 372) the Hoare annotation is: (let ((.cse1 (= |old(~E_M~0)| 1)) (.cse2 (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))) (.cse0 (not (<= 2 ~m_st~0))) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse3 (= ~m_pc~0 1)))) [2020-08-22 19:53:08,991 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) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-08-22 19:53:08,991 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) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-08-22 19:53:08,991 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) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-08-22 19:53:08,991 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) (= ~m_pc~0 1) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-08-22 19:53:09,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 07:53:09 BoogieIcfgContainer [2020-08-22 19:53:09,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 19:53:09,055 INFO L168 Benchmark]: Toolchain (without parser) took 134289.80 ms. Allocated memory was 137.9 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 102.3 MB in the beginning and 831.1 MB in the end (delta: -728.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2020-08-22 19:53:09,055 INFO L168 Benchmark]: CDTParser took 0.90 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 19:53:09,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.29 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 88.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-08-22 19:53:09,056 INFO L168 Benchmark]: Boogie Preprocessor took 152.32 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 88.4 MB in the beginning and 178.5 MB in the end (delta: -90.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2020-08-22 19:53:09,057 INFO L168 Benchmark]: RCFGBuilder took 645.90 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 141.7 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-08-22 19:53:09,057 INFO L168 Benchmark]: TraceAbstraction took 133102.74 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 141.0 MB in the beginning and 831.1 MB in the end (delta: -690.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2020-08-22 19:53:09,059 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 137.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 383.29 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 88.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.32 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 88.4 MB in the beginning and 178.5 MB in the end (delta: -90.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 645.90 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 141.7 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 133102.74 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 141.0 MB in the beginning and 831.1 MB in the end (delta: -690.1 MB). Peak memory consumption was 1.7 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: ((((((((((!(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)) && (((((((((!(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))) && ((((((((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))) && ((((((((!(2 <= m_st) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(local <= token)) || !(2 <= E_1)) - InvariantResult [Line: 200]: 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) && !(tmp == 0)) && local <= token) || (((((((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)) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || ((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 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))) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || !(2 <= \old(E_1))) || \old(t1_pc) == 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 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && t1_i == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) && ((\old(m_pc) == 1 || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st)))) && ((((((((((\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 <= \old(E_1))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st)))) && (((((((((((((((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || ((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\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 <= \old(E_1))) || !(2 <= \old(m_st))) || (((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && t1_i == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((!(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)) && (((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || 1 <= __retres1) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(2 <= E_1)) || ((0 <= __retres1 && !(m_pc == 1)) && __retres1 <= 0))) && (((((((((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))) && (((((((!(t1_pc == 1) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token))) && ((!(2 <= m_st) || m_pc == 1) || ((0 <= __retres1 && !(m_pc == 1)) && __retres1 <= 0))) && (((((((((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: ((((((((((!(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)) || ((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token)) || !(\old(local) + 1 <= \old(token))) && ((((((((!(t1_pc == 1) || \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) && local <= token)) || ((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((((((!(\old(t1_st) == 0) || t1_pc == 1) || \old(m_pc) == 1) || E_M == 1) || ((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token)) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((!(\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)) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st))) || (((((t1_pc == 1 && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= E_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))) && ((m_pc == 1 || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st))) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((((!(\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 <= \old(E_1))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 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)) && ((\old(m_pc) == 1 || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st)))) && ((((((((((\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 <= \old(E_1))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st)))) && (((((((((!(\old(t1_st) == 0) || \old(E_M) == 1) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(t1_i == 1)) || (2 <= m_st && !(m_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: 74]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || ((((((2 <= t1_st && t1_pc == 1) && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || \old(E_M) == 1) || \old(E_M) == 0) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M)) && \old(token) == token)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((m_pc == 1 || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st)))) && ((((((((\old(E_M) == 1 || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \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: 77]: Loop Invariant Derived loop invariant: ((((((((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))) && (((((((\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))) && (((((((((((((m_st == \old(m_st) && t1_pc == 1) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) || !(\old(token) <= local)) || \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))) && ((((((((!(\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)) - 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(t1_st) == 0)) || \old(E_M) == 1) || ((((((!(t1_pc == 1) && t1_st == 0) && !(m_pc == 1)) && 2 <= E_1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(t1_i == 1)) || (2 <= m_st && !(m_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) || t1_pc == 1) || \old(m_pc) == 1) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_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)))) && ((((((!(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) || 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)) && ((((((((!(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)))) && (((((((!(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: ((((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || ((((((2 <= t1_st && t1_pc == 1) && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || \old(E_M) == 1) || \old(E_M) == 0) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M)) && \old(token) == token)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((m_pc == 1 || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st)))) && ((((((((\old(E_M) == 1 || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \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)) - ProcedureContractResult [Line: 301]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: ((((((((((((((!(\old(t1_st) == 0) || t1_pc == 1) || !(\old(m_st) == 0)) || E_M == 1) || E_M == 0) || (((tmp <= 0 && m_st == 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) && ((((((((!(t1_pc == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || (tmp <= 0 && 0 < tmp + 1)) || !(local <= token))) && ((((((((!(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))) && (((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && 0 < tmp + 1) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((2 <= m_st || !(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))) && ((((((((!(\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))) && ((((((((((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && 0 < tmp + 1) || !(t1_pc == 1)) || !(token <= local + 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))) && (((((((((((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && 0 < tmp + 1) || !(\old(t1_st) == 0)) || !(t1_pc == 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)) - ProcedureContractResult [Line: 326]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: ((((((((((!(t1_pc == 1) || !(2 <= \old(t1_st))) || t1_st == 0) || E_M == 1) || E_M == 0) || !(token <= local)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || !(local <= token)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || m_st == 0) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((!(\old(t1_st) == 0) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || m_pc == 1) || !(local <= token))) && ((m_pc == 1 || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st))) - ProcedureContractResult [Line: 174]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: ((((((((((!(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)) && ((((((((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))) && ((((((((!(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))) && (((((((((!(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)) - 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: ((((((((((!(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)) && (((((((((!(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))) && ((((((((\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)) - ProcedureContractResult [Line: 156]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(\old(t1_st) == 0) || 2 <= m_st) || 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: ((((((((((!(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)) || ((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token)) || !(\old(local) + 1 <= \old(token))) && ((((((((!(t1_pc == 1) || \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) && local <= token)) || ((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((((((!(\old(t1_st) == 0) || t1_pc == 1) || \old(m_pc) == 1) || E_M == 1) || ((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token)) || 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: ((((((((((((!(\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 <= \old(E_1))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 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)) && ((\old(m_pc) == 1 || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st)))) && ((((((((((\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 <= \old(E_1))) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(2 <= \old(m_st)))) && (((((((((!(\old(t1_st) == 0) || \old(E_M) == 1) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token)) - 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: ((((((((\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)) && (((((((((!(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: (((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || t1_st == 0) || ((((0 <= \result && \result <= 0) && 0 <= __retres1) && !(m_pc == 1)) && __retres1 <= 0)) || !(E_M == 1)) || !(t1_i == 1)) || (1 <= \result && 1 <= __retres1)) || !(2 <= E_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))) && (((((((((!(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))) && ((((((((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))) && ((!(2 <= m_st) || ((((0 <= \result && \result <= 0) && 0 <= __retres1) && !(m_pc == 1)) && __retres1 <= 0)) || m_pc == 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)) - ProcedureContractResult [Line: 346]: Procedure Contract for reset_time_events Derived contract for procedure reset_time_events: (((((((((!(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)) && (((((((((!(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_i == 1) || !(t1_st == 0)) || !(m_st == 0)) || !(2 <= E_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: 52.3s, OverallIterations: 14, TraceHistogramMax: 7, AutomataDifference: 41.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 80.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3764 SDtfs, 15976 SDslu, 1645 SDs, 0 SdLazy, 22667 SolverSat, 5627 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1194 GetRequests, 798 SyntacticMatches, 1 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4339occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 7054 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 218 LocationsWithAnnotation, 30720 PreInvPairs, 36921 NumberOfFragments, 26602 HoareAnnotationTreeSize, 30720 FomulaSimplifications, 5828188702 FormulaSimplificationTreeSizeReduction, 20.4s HoareSimplificationTime, 218 FomulaSimplificationsInter, 229620 FormulaSimplificationTreeSizeReductionInter, 59.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...