/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-22 02:25:09,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-22 02:25:09,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-22 02:25:09,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-22 02:25:09,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-22 02:25:09,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-22 02:25:09,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-22 02:25:09,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-22 02:25:09,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-22 02:25:09,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-22 02:25:09,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-22 02:25:09,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-22 02:25:09,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-22 02:25:09,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-22 02:25:09,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-22 02:25:09,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-22 02:25:09,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-22 02:25:09,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-22 02:25:09,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-22 02:25:09,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-22 02:25:09,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-22 02:25:09,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-22 02:25:09,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-22 02:25:09,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-22 02:25:09,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-22 02:25:09,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-22 02:25:09,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-22 02:25:09,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-22 02:25:09,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-22 02:25:09,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-22 02:25:09,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-22 02:25:09,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-22 02:25:09,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-22 02:25:09,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-22 02:25:09,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-22 02:25:09,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-22 02:25:09,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-22 02:25:09,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-22 02:25:09,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-22 02:25:09,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-22 02:25:09,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-22 02:25:09,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf [2021-02-22 02:25:09,788 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-22 02:25:09,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-22 02:25:09,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-22 02:25:09,794 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-22 02:25:09,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-22 02:25:09,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-22 02:25:09,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-22 02:25:09,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-22 02:25:09,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-22 02:25:09,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-22 02:25:09,796 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-22 02:25:09,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-22 02:25:09,797 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-22 02:25:09,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-22 02:25:09,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-22 02:25:09,797 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-22 02:25:09,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-22 02:25:09,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-22 02:25:09,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-22 02:25:09,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-22 02:25:09,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-22 02:25:09,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-22 02:25:09,799 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=WERNER_OVERAPPROX [2021-02-22 02:25:09,799 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-02-22 02:25:10,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-22 02:25:10,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-22 02:25:10,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-22 02:25:10,271 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-22 02:25:10,272 INFO L275 PluginConnector]: CDTParser initialized [2021-02-22 02:25:10,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2021-02-22 02:25:10,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c54ec7a/9534bf7199b8402fa5a067f875d61cef/FLAGa2a486d59 [2021-02-22 02:25:11,132 INFO L306 CDTParser]: Found 1 translation units. [2021-02-22 02:25:11,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2021-02-22 02:25:11,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c54ec7a/9534bf7199b8402fa5a067f875d61cef/FLAGa2a486d59 [2021-02-22 02:25:11,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c54ec7a/9534bf7199b8402fa5a067f875d61cef [2021-02-22 02:25:11,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-22 02:25:11,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-22 02:25:11,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-22 02:25:11,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-22 02:25:11,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-22 02:25:11,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce26d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11, skipping insertion in model container [2021-02-22 02:25:11,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-22 02:25:11,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-22 02:25:11,699 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c[366,379] [2021-02-22 02:25:11,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 02:25:11,775 INFO L203 MainTranslator]: Completed pre-run [2021-02-22 02:25:11,794 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c[366,379] [2021-02-22 02:25:11,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 02:25:11,891 INFO L208 MainTranslator]: Completed translation [2021-02-22 02:25:11,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11 WrapperNode [2021-02-22 02:25:11,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-22 02:25:11,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-22 02:25:11,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-22 02:25:11,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-22 02:25:11,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (1/1) ... [2021-02-22 02:25:11,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-22 02:25:11,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-22 02:25:11,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-22 02:25:11,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-22 02:25:11,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (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 [2021-02-22 02:25:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-22 02:25:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-22 02:25:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-22 02:25:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-22 02:25:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2021-02-22 02:25:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2021-02-22 02:25:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2021-02-22 02:25:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2021-02-22 02:25:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-22 02:25:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-22 02:25:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-22 02:25:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-22 02:25:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-22 02:25:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-22 02:25:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-22 02:25:12,086 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-02-22 02:25:12,086 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2021-02-22 02:25:12,087 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2021-02-22 02:25:12,087 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-22 02:25:12,090 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-22 02:25:12,090 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-22 02:25:12,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-22 02:25:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-22 02:25:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-22 02:25:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-22 02:25:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-22 02:25:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-22 02:25:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2021-02-22 02:25:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2021-02-22 02:25:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-02-22 02:25:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-22 02:25:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure master [2021-02-22 02:25:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2021-02-22 02:25:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-22 02:25:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-22 02:25:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-22 02:25:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-22 02:25:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-22 02:25:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-22 02:25:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-22 02:25:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2021-02-22 02:25:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2021-02-22 02:25:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-22 02:25:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-22 02:25:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-22 02:25:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-22 02:25:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-22 02:25:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-22 02:25:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-22 02:25:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-22 02:25:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-22 02:25:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-22 02:25:12,731 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-22 02:25:12,732 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-02-22 02:25:12,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 02:25:12 BoogieIcfgContainer [2021-02-22 02:25:12,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-22 02:25:12,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-22 02:25:12,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-22 02:25:12,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-22 02:25:12,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.02 02:25:11" (1/3) ... [2021-02-22 02:25:12,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69afefaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 02:25:12, skipping insertion in model container [2021-02-22 02:25:12,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 02:25:11" (2/3) ... [2021-02-22 02:25:12,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69afefaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 02:25:12, skipping insertion in model container [2021-02-22 02:25:12,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 02:25:12" (3/3) ... [2021-02-22 02:25:12,746 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-02-22 02:25:12,754 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-22 02:25:12,760 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-22 02:25:12,807 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-22 02:25:12,857 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-22 02:25:12,857 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-22 02:25:12,858 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-22 02:25:12,858 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-22 02:25:12,858 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-22 02:25:12,858 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-22 02:25:12,858 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-22 02:25:12,858 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-22 02:25:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2021-02-22 02:25:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-02-22 02:25:12,928 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:25:12,929 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:25:12,930 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:25:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:25:12,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1623549773, now seen corresponding path program 1 times [2021-02-22 02:25:12,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:25:12,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1518804723] [2021-02-22 02:25:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:25:13,031 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:25:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,435 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,437 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:13,451 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,452 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:13,453 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,454 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:13,455 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,455 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:13,456 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,457 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:13,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,459 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,590 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,592 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,593 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:13,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:25:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,633 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,635 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:25:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:25:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,688 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,693 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:25:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,732 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,733 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:25:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,747 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,748 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,753 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,754 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,759 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:25:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:25:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:13,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:13,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 02:25:13,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1518804723] [2021-02-22 02:25:13,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:25:13,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-22 02:25:13,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721617202] [2021-02-22 02:25:13,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-22 02:25:13,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:25:13,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-22 02:25:13,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-02-22 02:25:13,843 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 7 states. [2021-02-22 02:25:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:25:16,653 INFO L93 Difference]: Finished difference Result 782 states and 1043 transitions. [2021-02-22 02:25:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-22 02:25:16,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2021-02-22 02:25:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:25:16,677 INFO L225 Difference]: With dead ends: 782 [2021-02-22 02:25:16,677 INFO L226 Difference]: Without dead ends: 580 [2021-02-22 02:25:16,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-02-22 02:25:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-02-22 02:25:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 399. [2021-02-22 02:25:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2021-02-22 02:25:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 483 transitions. [2021-02-22 02:25:16,902 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 483 transitions. Word has length 115 [2021-02-22 02:25:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:25:16,903 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 483 transitions. [2021-02-22 02:25:16,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-22 02:25:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 483 transitions. [2021-02-22 02:25:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-02-22 02:25:16,910 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:25:16,911 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:25:16,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-22 02:25:16,912 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:25:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:25:16,913 INFO L82 PathProgramCache]: Analyzing trace with hash 686750457, now seen corresponding path program 1 times [2021-02-22 02:25:16,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:25:16,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272435656] [2021-02-22 02:25:16,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:25:16,918 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:25:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,077 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,079 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,080 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:17,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:17,085 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,086 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:17,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,087 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:17,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,161 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:25:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,176 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:25:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,179 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:25:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,196 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:17,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:25:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,218 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,219 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:25:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,231 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,232 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:17,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,247 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,248 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,253 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,254 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:25:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,262 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:25:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-22 02:25:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,321 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:17,333 WARN L141 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-02-22 02:25:17,334 WARN L147 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size 14 [2021-02-22 02:25:17,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:25:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,371 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,372 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:25:17,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,391 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,392 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:17,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,397 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,398 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,402 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,403 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-02-22 02:25:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:17,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:17,414 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-02-22 02:25:17,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272435656] [2021-02-22 02:25:17,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:25:17,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-22 02:25:17,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549376910] [2021-02-22 02:25:17,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-22 02:25:17,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:25:17,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-22 02:25:17,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-02-22 02:25:17,509 INFO L87 Difference]: Start difference. First operand 399 states and 483 transitions. Second operand 10 states. [2021-02-22 02:25:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:25:20,595 INFO L93 Difference]: Finished difference Result 1534 states and 2102 transitions. [2021-02-22 02:25:20,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-22 02:25:20,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2021-02-22 02:25:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:25:20,612 INFO L225 Difference]: With dead ends: 1534 [2021-02-22 02:25:20,612 INFO L226 Difference]: Without dead ends: 1183 [2021-02-22 02:25:20,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2021-02-22 02:25:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-02-22 02:25:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 762. [2021-02-22 02:25:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2021-02-22 02:25:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 960 transitions. [2021-02-22 02:25:20,826 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 960 transitions. Word has length 178 [2021-02-22 02:25:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:25:20,827 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 960 transitions. [2021-02-22 02:25:20,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-22 02:25:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 960 transitions. [2021-02-22 02:25:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-02-22 02:25:20,833 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:25:20,834 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:25:20,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-22 02:25:20,834 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:25:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:25:20,835 INFO L82 PathProgramCache]: Analyzing trace with hash -729428327, now seen corresponding path program 1 times [2021-02-22 02:25:20,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:25:20,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [439405556] [2021-02-22 02:25:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:25:20,839 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:25:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:20,872 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,873 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:20,874 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:20,878 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:20,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:20,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:20,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:25:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:20,958 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,958 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:20,959 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,960 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:25:20,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:25:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:20,964 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,965 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:20,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:25:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:20,980 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,981 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:20,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:20,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 02:25:21,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:25:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,009 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:25:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,016 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,018 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,025 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,027 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:25:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,032 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,032 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:25:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,036 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,036 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-22 02:25:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,064 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,065 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:25:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,082 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,085 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,086 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-02-22 02:25:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:21,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:21,096 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-02-22 02:25:21,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [439405556] [2021-02-22 02:25:21,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:25:21,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-22 02:25:21,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994500266] [2021-02-22 02:25:21,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-22 02:25:21,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:25:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-22 02:25:21,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-02-22 02:25:21,149 INFO L87 Difference]: Start difference. First operand 762 states and 960 transitions. Second operand 9 states. [2021-02-22 02:25:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:25:23,298 INFO L93 Difference]: Finished difference Result 1786 states and 2317 transitions. [2021-02-22 02:25:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-22 02:25:23,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2021-02-22 02:25:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:25:23,315 INFO L225 Difference]: With dead ends: 1786 [2021-02-22 02:25:23,315 INFO L226 Difference]: Without dead ends: 1070 [2021-02-22 02:25:23,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-02-22 02:25:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2021-02-22 02:25:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 756. [2021-02-22 02:25:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2021-02-22 02:25:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 949 transitions. [2021-02-22 02:25:23,526 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 949 transitions. Word has length 178 [2021-02-22 02:25:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:25:23,527 INFO L480 AbstractCegarLoop]: Abstraction has 756 states and 949 transitions. [2021-02-22 02:25:23,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-22 02:25:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 949 transitions. [2021-02-22 02:25:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-02-22 02:25:23,535 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:25:23,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:25:23,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-22 02:25:23,540 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:25:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:25:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1363211102, now seen corresponding path program 1 times [2021-02-22 02:25:23,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:25:23,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1583650545] [2021-02-22 02:25:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:25:23,545 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:25:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,632 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:23,636 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,640 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:23,641 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,642 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:23,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,644 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,645 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:25:23,649 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,717 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,718 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,719 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,720 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:25:23,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:25:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,732 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,733 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:25:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,736 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,736 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:25:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,755 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:25:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,773 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:25:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,782 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,786 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,787 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:25:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:25:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,796 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,797 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-22 02:25:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,827 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,828 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,829 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,829 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:23,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:25:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,843 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,845 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,854 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-22 02:25:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:23,866 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:23,867 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:23,868 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-02-22 02:25:23,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1583650545] [2021-02-22 02:25:23,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:25:23,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-22 02:25:23,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884460497] [2021-02-22 02:25:23,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-22 02:25:23,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:25:23,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-22 02:25:23,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-22 02:25:23,948 INFO L87 Difference]: Start difference. First operand 756 states and 949 transitions. Second operand 11 states. [2021-02-22 02:25:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:25:31,106 INFO L93 Difference]: Finished difference Result 4457 states and 6049 transitions. [2021-02-22 02:25:31,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-02-22 02:25:31,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2021-02-22 02:25:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:25:31,137 INFO L225 Difference]: With dead ends: 4457 [2021-02-22 02:25:31,137 INFO L226 Difference]: Without dead ends: 3746 [2021-02-22 02:25:31,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2021-02-22 02:25:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2021-02-22 02:25:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 2959. [2021-02-22 02:25:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2021-02-22 02:25:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 3738 transitions. [2021-02-22 02:25:31,799 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 3738 transitions. Word has length 183 [2021-02-22 02:25:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:25:31,800 INFO L480 AbstractCegarLoop]: Abstraction has 2959 states and 3738 transitions. [2021-02-22 02:25:31,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-22 02:25:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3738 transitions. [2021-02-22 02:25:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-02-22 02:25:31,809 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:25:31,810 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, 2, 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] [2021-02-22 02:25:31,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-22 02:25:31,810 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:25:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:25:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash 289955978, now seen corresponding path program 1 times [2021-02-22 02:25:31,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:25:31,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [73293816] [2021-02-22 02:25:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:25:31,814 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:25:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,857 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,858 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:25:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:25:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,929 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,929 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:25:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,940 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,941 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:25:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,960 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,963 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:25:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,968 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,969 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,972 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,972 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,975 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,975 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:25:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,979 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,980 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:31,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:25:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:31,983 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:31,983 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-22 02:25:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,012 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,012 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,013 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:25:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,033 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,034 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,035 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,036 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:25:32,046 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-22 02:25:32,048 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-22 02:25:32,064 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,065 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,072 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,073 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,074 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:25:32,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:25:32,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:25:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,106 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,107 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-02-22 02:25:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,151 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,151 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:25:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,156 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,157 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,163 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,164 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,167 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,168 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:25:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,172 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,172 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-02-22 02:25:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:32,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:32,183 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-02-22 02:25:32,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [73293816] [2021-02-22 02:25:32,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:25:32,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-22 02:25:32,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176350405] [2021-02-22 02:25:32,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-22 02:25:32,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:25:32,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-22 02:25:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-02-22 02:25:32,291 INFO L87 Difference]: Start difference. First operand 2959 states and 3738 transitions. Second operand 12 states. [2021-02-22 02:25:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:25:35,789 INFO L93 Difference]: Finished difference Result 6447 states and 8413 transitions. [2021-02-22 02:25:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-02-22 02:25:35,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 227 [2021-02-22 02:25:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:25:35,816 INFO L225 Difference]: With dead ends: 6447 [2021-02-22 02:25:35,816 INFO L226 Difference]: Without dead ends: 3223 [2021-02-22 02:25:35,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2021-02-22 02:25:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2021-02-22 02:25:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2413. [2021-02-22 02:25:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2021-02-22 02:25:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 2983 transitions. [2021-02-22 02:25:36,328 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 2983 transitions. Word has length 227 [2021-02-22 02:25:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:25:36,330 INFO L480 AbstractCegarLoop]: Abstraction has 2413 states and 2983 transitions. [2021-02-22 02:25:36,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-22 02:25:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 2983 transitions. [2021-02-22 02:25:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-02-22 02:25:36,340 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:25:36,340 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:25:36,340 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-22 02:25:36,341 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:25:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:25:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1002674610, now seen corresponding path program 1 times [2021-02-22 02:25:36,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:25:36,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584757196] [2021-02-22 02:25:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:25:36,345 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:25:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,473 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,474 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:36,477 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,478 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:36,478 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,479 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:36,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,480 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:36,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,481 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,558 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,559 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,560 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,560 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:36,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:25:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,575 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,576 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:25:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,580 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,584 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:25:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,599 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,600 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:25:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,623 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,623 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:25:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,630 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,641 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,648 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,655 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,656 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:25:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,661 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,662 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:25:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,668 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-22 02:25:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,703 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,704 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:25:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,709 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,710 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,718 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,719 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,722 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,723 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,726 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,727 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-22 02:25:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,761 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,763 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,763 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:36,772 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,773 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:25:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,782 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 02:25:36,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,802 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,803 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,806 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 02:25:36,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,810 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,811 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:25:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,821 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,826 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 02:25:36,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-02-22 02:25:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:36,840 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:36,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 02:25:36,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584757196] [2021-02-22 02:25:36,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:25:36,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-22 02:25:36,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126886642] [2021-02-22 02:25:36,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-22 02:25:36,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:25:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-22 02:25:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-02-22 02:25:36,946 INFO L87 Difference]: Start difference. First operand 2413 states and 2983 transitions. Second operand 11 states. [2021-02-22 02:25:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:25:40,690 INFO L93 Difference]: Finished difference Result 6904 states and 8959 transitions. [2021-02-22 02:25:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-02-22 02:25:40,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 227 [2021-02-22 02:25:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:25:40,722 INFO L225 Difference]: With dead ends: 6904 [2021-02-22 02:25:40,723 INFO L226 Difference]: Without dead ends: 4536 [2021-02-22 02:25:40,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2021-02-22 02:25:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2021-02-22 02:25:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3623. [2021-02-22 02:25:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2021-02-22 02:25:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4393 transitions. [2021-02-22 02:25:41,580 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4393 transitions. Word has length 227 [2021-02-22 02:25:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:25:41,580 INFO L480 AbstractCegarLoop]: Abstraction has 3623 states and 4393 transitions. [2021-02-22 02:25:41,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-22 02:25:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4393 transitions. [2021-02-22 02:25:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-02-22 02:25:41,590 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:25:41,591 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:25:41,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-22 02:25:41,591 INFO L428 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:25:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:25:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash -886783072, now seen corresponding path program 1 times [2021-02-22 02:25:41,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:25:41,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882384076] [2021-02-22 02:25:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:25:41,595 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:25:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,640 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,640 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:41,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,644 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:41,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,645 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:41,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,646 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,646 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:25:41,651 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,718 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,719 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,720 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,720 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:25:41,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:25:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,734 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,734 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:25:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,737 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,737 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:25:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,752 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:25:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,771 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,772 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:25:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,777 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,777 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,783 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,784 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:25:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,788 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,788 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:25:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,792 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-22 02:25:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:25:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,824 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,824 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,829 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,829 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,832 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,836 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,836 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-02-22 02:25:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,864 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,865 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:41,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-02-22 02:25:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,878 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,879 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:41,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-02-22 02:25:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,894 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,894 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:25:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,899 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,904 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,904 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,907 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:25:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,910 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2021-02-22 02:25:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:41,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:41,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 02:25:41,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882384076] [2021-02-22 02:25:41,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:25:41,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-22 02:25:41,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936997240] [2021-02-22 02:25:41,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-22 02:25:41,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:25:41,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-22 02:25:41,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-02-22 02:25:41,974 INFO L87 Difference]: Start difference. First operand 3623 states and 4393 transitions. Second operand 12 states. [2021-02-22 02:25:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:25:49,701 INFO L93 Difference]: Finished difference Result 7008 states and 8626 transitions. [2021-02-22 02:25:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-02-22 02:25:49,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 256 [2021-02-22 02:25:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:25:49,734 INFO L225 Difference]: With dead ends: 7008 [2021-02-22 02:25:49,734 INFO L226 Difference]: Without dead ends: 4569 [2021-02-22 02:25:49,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2021-02-22 02:25:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2021-02-22 02:25:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 3665. [2021-02-22 02:25:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3665 states. [2021-02-22 02:25:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 4341 transitions. [2021-02-22 02:25:50,580 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 4341 transitions. Word has length 256 [2021-02-22 02:25:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:25:50,581 INFO L480 AbstractCegarLoop]: Abstraction has 3665 states and 4341 transitions. [2021-02-22 02:25:50,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-22 02:25:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 4341 transitions. [2021-02-22 02:25:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-02-22 02:25:50,591 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:25:50,591 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:25:50,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-22 02:25:50,592 INFO L428 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:25:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:25:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash -429549839, now seen corresponding path program 1 times [2021-02-22 02:25:50,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:25:50,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355839130] [2021-02-22 02:25:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:25:50,596 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:25:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,646 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,648 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,649 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,650 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,650 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:25:50,654 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,655 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,722 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,723 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,723 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:25:50,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:25:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,737 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,738 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:25:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,740 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,740 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:25:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,754 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:25:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,773 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:25:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,789 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,790 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,795 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,796 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:25:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,800 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,800 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:25:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,803 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-22 02:25:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,824 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,825 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-22 02:25:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,827 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,828 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-22 02:25:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,859 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,860 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:25:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,873 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,878 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,879 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,881 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,882 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:25:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,885 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-22 02:25:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,896 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:25:50,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,909 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,909 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,910 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:25:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,917 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:25:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,925 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,926 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,926 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,938 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,949 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,949 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:25:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,952 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,952 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:25:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,956 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:50,957 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,957 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,970 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,970 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:25:50,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-02-22 02:25:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:25:50,992 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:25:50,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:25:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 02:25:51,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355839130] [2021-02-22 02:25:51,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:25:51,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-22 02:25:51,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233114103] [2021-02-22 02:25:51,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-22 02:25:51,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:25:51,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-22 02:25:51,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-02-22 02:25:51,080 INFO L87 Difference]: Start difference. First operand 3665 states and 4341 transitions. Second operand 17 states. [2021-02-22 02:26:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:01,861 INFO L93 Difference]: Finished difference Result 8410 states and 10544 transitions. [2021-02-22 02:26:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-02-22 02:26:01,862 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 262 [2021-02-22 02:26:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:01,904 INFO L225 Difference]: With dead ends: 8410 [2021-02-22 02:26:01,905 INFO L226 Difference]: Without dead ends: 4789 [2021-02-22 02:26:01,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3887 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2021-02-22 02:26:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2021-02-22 02:26:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 3673. [2021-02-22 02:26:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2021-02-22 02:26:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4248 transitions. [2021-02-22 02:26:02,929 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4248 transitions. Word has length 262 [2021-02-22 02:26:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:02,929 INFO L480 AbstractCegarLoop]: Abstraction has 3673 states and 4248 transitions. [2021-02-22 02:26:02,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-22 02:26:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4248 transitions. [2021-02-22 02:26:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-02-22 02:26:02,938 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:26:02,939 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:26:02,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-22 02:26:02,939 INFO L428 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:26:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:26:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1900844140, now seen corresponding path program 1 times [2021-02-22 02:26:02,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:26:02,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294633385] [2021-02-22 02:26:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:26:02,943 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:26:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,008 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,009 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,010 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,011 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:26:03,017 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,018 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 02:26:03,027 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,028 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:26:03,033 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,033 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,097 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,097 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:26:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,110 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,111 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:26:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,113 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,113 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:26:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,126 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:26:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,144 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,150 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,152 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,152 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,155 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:26:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,158 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,159 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-22 02:26:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,161 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,162 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-22 02:26:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,184 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,185 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-22 02:26:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,187 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,187 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-22 02:26:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,220 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,222 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,222 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:26:03,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:26:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,228 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,229 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,233 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,233 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,235 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,236 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,238 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,239 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-22 02:26:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,256 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,257 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:03,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-22 02:26:03,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:26:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,293 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,293 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,295 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,296 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:26:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,302 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,303 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-02-22 02:26:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:03,314 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:03,314 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 02:26:03,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294633385] [2021-02-22 02:26:03,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:26:03,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-22 02:26:03,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464142389] [2021-02-22 02:26:03,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-22 02:26:03,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:26:03,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-22 02:26:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-02-22 02:26:03,394 INFO L87 Difference]: Start difference. First operand 3673 states and 4248 transitions. Second operand 12 states. [2021-02-22 02:26:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:10,783 INFO L93 Difference]: Finished difference Result 10320 states and 12285 transitions. [2021-02-22 02:26:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-02-22 02:26:10,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2021-02-22 02:26:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:10,832 INFO L225 Difference]: With dead ends: 10320 [2021-02-22 02:26:10,832 INFO L226 Difference]: Without dead ends: 7589 [2021-02-22 02:26:10,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2021-02-22 02:26:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7589 states. [2021-02-22 02:26:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7589 to 6220. [2021-02-22 02:26:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2021-02-22 02:26:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 7325 transitions. [2021-02-22 02:26:12,449 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 7325 transitions. Word has length 262 [2021-02-22 02:26:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:12,452 INFO L480 AbstractCegarLoop]: Abstraction has 6220 states and 7325 transitions. [2021-02-22 02:26:12,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-22 02:26:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 7325 transitions. [2021-02-22 02:26:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-02-22 02:26:12,464 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:26:12,464 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:26:12,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-22 02:26:12,464 INFO L428 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:26:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:26:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash -758707222, now seen corresponding path program 1 times [2021-02-22 02:26:12,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:26:12,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966090214] [2021-02-22 02:26:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:26:12,469 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:26:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,524 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,525 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:12,528 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,528 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:12,529 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,529 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:12,530 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,530 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,531 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,531 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,597 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,598 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,598 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,599 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:12,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:26:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,612 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,613 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:26:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,615 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,616 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:26:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,627 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,627 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:26:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,649 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,652 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,652 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:26:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,655 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,655 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-22 02:26:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,696 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,697 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,697 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,698 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,698 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:12,706 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:12,714 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,714 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,717 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,717 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-22 02:26:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,743 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,743 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:26:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,752 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,757 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,757 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,759 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,763 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-22 02:26:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,770 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,771 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:12,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:12,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-02-22 02:26:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,797 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,799 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-02-22 02:26:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,801 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,802 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-02-22 02:26:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,806 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,806 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,808 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,809 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:26:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,811 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,811 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-02-22 02:26:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,814 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,815 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-02-22 02:26:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,817 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,817 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2021-02-22 02:26:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,822 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,823 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-02-22 02:26:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:12,825 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:12,825 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-02-22 02:26:12,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966090214] [2021-02-22 02:26:12,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:26:12,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-22 02:26:12,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000696328] [2021-02-22 02:26:12,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-22 02:26:12,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:26:12,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-22 02:26:12,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-02-22 02:26:12,894 INFO L87 Difference]: Start difference. First operand 6220 states and 7325 transitions. Second operand 13 states. [2021-02-22 02:26:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:17,180 INFO L93 Difference]: Finished difference Result 10838 states and 12762 transitions. [2021-02-22 02:26:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-22 02:26:17,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 283 [2021-02-22 02:26:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:17,223 INFO L225 Difference]: With dead ends: 10838 [2021-02-22 02:26:17,224 INFO L226 Difference]: Without dead ends: 4664 [2021-02-22 02:26:17,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2021-02-22 02:26:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2021-02-22 02:26:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 3928. [2021-02-22 02:26:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2021-02-22 02:26:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 4551 transitions. [2021-02-22 02:26:18,060 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 4551 transitions. Word has length 283 [2021-02-22 02:26:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:18,060 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 4551 transitions. [2021-02-22 02:26:18,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-22 02:26:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 4551 transitions. [2021-02-22 02:26:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2021-02-22 02:26:18,065 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:26:18,065 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:26:18,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-22 02:26:18,066 INFO L428 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:26:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:26:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1388894635, now seen corresponding path program 1 times [2021-02-22 02:26:18,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:26:18,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1430617285] [2021-02-22 02:26:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:26:18,070 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:26:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,112 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,113 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,117 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,117 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,118 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,118 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,119 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,119 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,120 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:18,123 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,125 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:18,125 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,126 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:18,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,126 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,189 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,189 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,190 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,190 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:26:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,211 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:26:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,214 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:26:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,227 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,227 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:26:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,248 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,249 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:26:18,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,274 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,274 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:26:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,279 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,280 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:18,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-22 02:26:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,329 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,330 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,343 WARN L141 QuantifierPusher]: treesize reduction 6, result has 53.8 percent of original size [2021-02-22 02:26:18,343 WARN L147 QuantifierPusher]: treesize reduction 6, result has 53.8 percent of original size 7 [2021-02-22 02:26:18,358 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,358 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,360 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-22 02:26:18,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,383 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,383 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-22 02:26:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,421 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,421 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:26:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,426 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,426 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,430 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,433 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,436 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,436 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-22 02:26:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,468 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,469 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-22 02:26:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,472 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-22 02:26:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,485 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,486 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-22 02:26:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,490 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,490 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:18,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-22 02:26:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,496 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,497 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,497 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,497 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:26:18,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,511 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,512 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,512 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,513 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:26:18,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:26:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,515 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,516 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-02-22 02:26:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,523 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,524 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-02-22 02:26:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-02-22 02:26:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,531 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,531 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,533 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,533 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-02-22 02:26:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:18,536 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:18,536 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-02-22 02:26:18,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1430617285] [2021-02-22 02:26:18,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:26:18,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-22 02:26:18,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118767926] [2021-02-22 02:26:18,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-22 02:26:18,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:26:18,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-22 02:26:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-02-22 02:26:18,602 INFO L87 Difference]: Start difference. First operand 3928 states and 4551 transitions. Second operand 17 states. [2021-02-22 02:26:18,982 WARN L202 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2021-02-22 02:26:19,956 WARN L202 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2021-02-22 02:26:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:27,636 INFO L93 Difference]: Finished difference Result 10083 states and 12373 transitions. [2021-02-22 02:26:27,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-02-22 02:26:27,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 292 [2021-02-22 02:26:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:27,671 INFO L225 Difference]: With dead ends: 10083 [2021-02-22 02:26:27,671 INFO L226 Difference]: Without dead ends: 6205 [2021-02-22 02:26:27,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1306, Invalid=5336, Unknown=0, NotChecked=0, Total=6642 [2021-02-22 02:26:27,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6205 states. [2021-02-22 02:26:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6205 to 4919. [2021-02-22 02:26:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4919 states. [2021-02-22 02:26:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 5548 transitions. [2021-02-22 02:26:28,789 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 5548 transitions. Word has length 292 [2021-02-22 02:26:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:28,790 INFO L480 AbstractCegarLoop]: Abstraction has 4919 states and 5548 transitions. [2021-02-22 02:26:28,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-22 02:26:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 5548 transitions. [2021-02-22 02:26:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2021-02-22 02:26:28,799 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:26:28,799 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:26:28,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-22 02:26:28,800 INFO L428 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:26:28,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:26:28,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2026275409, now seen corresponding path program 1 times [2021-02-22 02:26:28,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:26:28,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1295767999] [2021-02-22 02:26:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:26:28,804 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:26:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,853 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,854 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,911 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:26:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,920 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,920 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:26:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,922 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,922 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:26:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,932 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,933 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:26:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,947 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,948 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,951 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,952 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,954 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,954 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,957 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,957 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:26:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:28,960 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:28,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:28,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-22 02:26:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,002 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:29,008 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,009 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,011 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-22 02:26:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,031 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,031 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-22 02:26:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,034 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,034 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,063 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,063 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:26:29,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:26:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,067 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,068 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,071 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,074 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-02-22 02:26:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,086 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,087 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:29,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:26:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,101 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 02:26:29,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,106 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,107 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 02:26:29,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,112 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,112 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,113 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,113 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 02:26:29,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,116 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-02-22 02:26:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,122 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,123 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-02-22 02:26:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,146 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-02-22 02:26:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,150 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-02-22 02:26:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,158 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,158 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-02-22 02:26:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,164 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,164 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-02-22 02:26:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,166 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,167 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-02-22 02:26:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,170 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,170 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,172 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,172 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-22 02:26:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,175 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-02-22 02:26:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,181 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:26:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,185 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,186 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,191 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,192 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:26:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,196 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,196 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-02-22 02:26:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:29,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:29,201 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-02-22 02:26:29,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1295767999] [2021-02-22 02:26:29,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:26:29,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-22 02:26:29,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13464591] [2021-02-22 02:26:29,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-22 02:26:29,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:26:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-22 02:26:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-02-22 02:26:29,480 INFO L87 Difference]: Start difference. First operand 4919 states and 5548 transitions. Second operand 11 states. [2021-02-22 02:26:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:32,399 INFO L93 Difference]: Finished difference Result 9577 states and 11061 transitions. [2021-02-22 02:26:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-02-22 02:26:32,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 427 [2021-02-22 02:26:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:32,419 INFO L225 Difference]: With dead ends: 9577 [2021-02-22 02:26:32,420 INFO L226 Difference]: Without dead ends: 4878 [2021-02-22 02:26:32,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2021-02-22 02:26:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-02-22 02:26:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4497. [2021-02-22 02:26:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4497 states. [2021-02-22 02:26:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 5019 transitions. [2021-02-22 02:26:33,463 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 5019 transitions. Word has length 427 [2021-02-22 02:26:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:33,464 INFO L480 AbstractCegarLoop]: Abstraction has 4497 states and 5019 transitions. [2021-02-22 02:26:33,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-22 02:26:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 5019 transitions. [2021-02-22 02:26:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2021-02-22 02:26:33,472 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:26:33,473 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 02:26:33,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-22 02:26:33,473 INFO L428 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:26:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:26:33,474 INFO L82 PathProgramCache]: Analyzing trace with hash 579786324, now seen corresponding path program 1 times [2021-02-22 02:26:33,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:26:33,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2037953854] [2021-02-22 02:26:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:26:33,477 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:26:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,534 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,534 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:33,537 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,537 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:33,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,538 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:33,544 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,545 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,545 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,546 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,606 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,606 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,607 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,607 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:33,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:26:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,619 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,619 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:26:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,622 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,622 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:26:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,634 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,635 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:26:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,650 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,655 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,655 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,658 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,659 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:26:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,667 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,667 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-22 02:26:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,708 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,709 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,710 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,711 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,713 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,714 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-22 02:26:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,734 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,734 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-22 02:26:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,737 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,737 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:26:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,769 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,770 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,774 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,776 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,777 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-02-22 02:26:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:33,800 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,801 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,802 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,803 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:26:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,810 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,810 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,816 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,817 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,817 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:33,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:33,836 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,837 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,842 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,842 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,843 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:33,853 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,854 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:33,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:26:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,869 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,870 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-02-22 02:26:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,875 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,876 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-02-22 02:26:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,898 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,898 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-02-22 02:26:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,901 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,901 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-02-22 02:26:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,906 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,909 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:26:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,911 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,911 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-02-22 02:26:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,915 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2021-02-22 02:26:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,918 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-02-22 02:26:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,922 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,923 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,925 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,925 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-02-22 02:26:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,928 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,928 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-02-22 02:26:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-22 02:26:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,942 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,943 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,947 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,947 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,950 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:26:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,952 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,952 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:33,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2021-02-22 02:26:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:33,957 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:33,958 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-02-22 02:26:34,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2037953854] [2021-02-22 02:26:34,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:26:34,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-22 02:26:34,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922755130] [2021-02-22 02:26:34,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-22 02:26:34,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:26:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-22 02:26:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-02-22 02:26:34,122 INFO L87 Difference]: Start difference. First operand 4497 states and 5019 transitions. Second operand 15 states. [2021-02-22 02:26:37,014 WARN L202 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-02-22 02:26:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:38,510 INFO L93 Difference]: Finished difference Result 6016 states and 6733 transitions. [2021-02-22 02:26:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-02-22 02:26:38,510 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 429 [2021-02-22 02:26:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:38,521 INFO L225 Difference]: With dead ends: 6016 [2021-02-22 02:26:38,521 INFO L226 Difference]: Without dead ends: 1789 [2021-02-22 02:26:38,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=1621, Unknown=0, NotChecked=0, Total=2070 [2021-02-22 02:26:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2021-02-22 02:26:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1587. [2021-02-22 02:26:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2021-02-22 02:26:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1722 transitions. [2021-02-22 02:26:39,034 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1722 transitions. Word has length 429 [2021-02-22 02:26:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:39,036 INFO L480 AbstractCegarLoop]: Abstraction has 1587 states and 1722 transitions. [2021-02-22 02:26:39,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-22 02:26:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1722 transitions. [2021-02-22 02:26:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-02-22 02:26:39,043 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:26:39,043 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-02-22 02:26:39,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-22 02:26:39,044 INFO L428 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:26:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:26:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1823099586, now seen corresponding path program 1 times [2021-02-22 02:26:39,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:26:39,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1564783095] [2021-02-22 02:26:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:26:39,049 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:26:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,103 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,104 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,104 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:39,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,170 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,171 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:26:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,181 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:26:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,183 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,183 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:26:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,196 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:26:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,212 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,212 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,216 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,216 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,218 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,219 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,221 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:26:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,224 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,225 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-22 02:26:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,257 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,257 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,260 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,260 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-22 02:26:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,285 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:26:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,289 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,293 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,293 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,296 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,296 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,299 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-22 02:26:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,323 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,324 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-22 02:26:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,326 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,326 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-22 02:26:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,335 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,335 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-22 02:26:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,338 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,339 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-22 02:26:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,342 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,343 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,345 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,345 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:26:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,347 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,347 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-22 02:26:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,350 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-22 02:26:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,353 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,353 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-22 02:26:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,366 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,366 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-22 02:26:39,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-22 02:26:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,372 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,373 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,375 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,376 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:26:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,378 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,378 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-22 02:26:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,389 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,390 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:39,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-02-22 02:26:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,402 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,404 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,404 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-02-22 02:26:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,408 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,408 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,411 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,411 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2021-02-22 02:26:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,414 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-02-22 02:26:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,416 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,417 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-02-22 02:26:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,421 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,422 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,424 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,424 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:26:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,427 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,427 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2021-02-22 02:26:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,430 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,431 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2021-02-22 02:26:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,433 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2021-02-22 02:26:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,437 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,437 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,439 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,440 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2021-02-22 02:26:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:39,442 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:39,443 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-02-22 02:26:39,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1564783095] [2021-02-22 02:26:39,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:26:39,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-22 02:26:39,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579514257] [2021-02-22 02:26:39,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-22 02:26:39,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:26:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-22 02:26:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-02-22 02:26:39,603 INFO L87 Difference]: Start difference. First operand 1587 states and 1722 transitions. Second operand 12 states. [2021-02-22 02:26:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:42,620 INFO L93 Difference]: Finished difference Result 2871 states and 3123 transitions. [2021-02-22 02:26:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-02-22 02:26:42,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 437 [2021-02-22 02:26:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:42,629 INFO L225 Difference]: With dead ends: 2871 [2021-02-22 02:26:42,629 INFO L226 Difference]: Without dead ends: 1554 [2021-02-22 02:26:42,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2021-02-22 02:26:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2021-02-22 02:26:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1451. [2021-02-22 02:26:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2021-02-22 02:26:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1558 transitions. [2021-02-22 02:26:43,111 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1558 transitions. Word has length 437 [2021-02-22 02:26:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:43,111 INFO L480 AbstractCegarLoop]: Abstraction has 1451 states and 1558 transitions. [2021-02-22 02:26:43,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-22 02:26:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1558 transitions. [2021-02-22 02:26:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2021-02-22 02:26:43,116 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:26:43,117 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-02-22 02:26:43,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-22 02:26:43,117 INFO L428 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:26:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:26:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1496415247, now seen corresponding path program 1 times [2021-02-22 02:26:43,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:26:43,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [577202768] [2021-02-22 02:26:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:26:43,123 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:26:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,253 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,254 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:26:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,264 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:26:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,266 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,267 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:26:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,277 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,277 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:26:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,292 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,292 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,296 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,296 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,299 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,299 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,301 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:26:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,305 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,305 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-22 02:26:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,334 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,334 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,336 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,337 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-22 02:26:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,362 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,363 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:26:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,367 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,367 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,371 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,371 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,373 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,374 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,376 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,376 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-22 02:26:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,397 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,399 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-22 02:26:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,402 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-22 02:26:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,410 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,410 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-22 02:26:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,413 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-22 02:26:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,420 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,421 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,423 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,424 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:26:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,426 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,426 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-22 02:26:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-22 02:26:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,432 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,432 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-22 02:26:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,441 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,442 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-22 02:26:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,445 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,446 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,448 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,449 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:26:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,451 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,453 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-22 02:26:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,458 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-02-22 02:26:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,466 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,466 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,467 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,468 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:26:43,478 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-22 02:26:43,479 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-22 02:26:43,491 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,492 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,497 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,498 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,499 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,499 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:26:43,512 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,513 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 02:26:43,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-02-22 02:26:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,543 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,544 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,553 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,554 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-02-22 02:26:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,556 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,557 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-02-22 02:26:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,560 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,560 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-22 02:26:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,566 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,567 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,569 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:26:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,572 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,573 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-02-22 02:26:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-02-22 02:26:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,580 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,580 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-02-22 02:26:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,584 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,584 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,587 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,587 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-02-22 02:26:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:43,590 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:43,590 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-02-22 02:26:43,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [577202768] [2021-02-22 02:26:43,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:26:43,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-02-22 02:26:43,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619003282] [2021-02-22 02:26:43,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-02-22 02:26:43,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:26:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-02-22 02:26:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-02-22 02:26:43,692 INFO L87 Difference]: Start difference. First operand 1451 states and 1558 transitions. Second operand 14 states. [2021-02-22 02:26:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:46,524 INFO L93 Difference]: Finished difference Result 2745 states and 2966 transitions. [2021-02-22 02:26:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-02-22 02:26:46,524 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 438 [2021-02-22 02:26:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:46,530 INFO L225 Difference]: With dead ends: 2745 [2021-02-22 02:26:46,530 INFO L226 Difference]: Without dead ends: 1564 [2021-02-22 02:26:46,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2021-02-22 02:26:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2021-02-22 02:26:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1448. [2021-02-22 02:26:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2021-02-22 02:26:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1552 transitions. [2021-02-22 02:26:47,096 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1552 transitions. Word has length 438 [2021-02-22 02:26:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:47,097 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 1552 transitions. [2021-02-22 02:26:47,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-02-22 02:26:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1552 transitions. [2021-02-22 02:26:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2021-02-22 02:26:47,103 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 02:26:47,104 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-02-22 02:26:47,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-02-22 02:26:47,104 INFO L428 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 02:26:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 02:26:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1033013137, now seen corresponding path program 1 times [2021-02-22 02:26:47,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 02:26:47,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1682903294] [2021-02-22 02:26:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 02:26:47,110 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 02:26:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,178 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:47,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:47,182 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,183 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:47,183 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,184 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,184 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,185 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:47,189 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,190 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 02:26:47,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,267 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,268 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,268 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:47,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-22 02:26:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,282 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,282 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-22 02:26:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,285 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-22 02:26:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,300 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,300 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-22 02:26:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,319 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-22 02:26:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,323 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,324 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,332 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,333 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,335 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,335 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-22 02:26:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,342 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,343 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-02-22 02:26:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,384 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,385 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,387 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,388 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-02-22 02:26:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,415 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,416 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-02-22 02:26:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,420 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,420 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 02:26:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,424 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,425 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,427 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,427 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-22 02:26:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-22 02:26:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,455 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,455 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-22 02:26:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,458 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-02-22 02:26:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,466 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,466 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-02-22 02:26:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,469 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,470 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-02-22 02:26:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,474 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,476 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,477 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:26:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,480 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-02-22 02:26:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,483 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,484 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-02-22 02:26:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,486 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,486 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-02-22 02:26:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,499 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,500 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-02-22 02:26:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,505 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,505 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,508 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-22 02:26:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,510 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,511 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-02-22 02:26:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,514 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,515 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-02-22 02:26:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,520 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,521 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,521 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,521 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:47,532 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,532 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 02:26:47,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,545 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,546 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-02-22 02:26:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,550 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,550 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,553 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-02-22 02:26:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,555 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,556 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-02-22 02:26:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,559 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,560 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-02-22 02:26:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,565 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,565 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,568 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,568 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 02:26:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,570 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,571 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-02-22 02:26:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,574 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,575 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-02-22 02:26:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,578 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-02-22 02:26:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,582 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-22 02:26:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,584 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,585 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-02-22 02:26:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 02:26:47,588 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 02:26:47,588 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 02:26:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-02-22 02:26:47,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1682903294] [2021-02-22 02:26:47,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 02:26:47,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-22 02:26:47,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057875831] [2021-02-22 02:26:47,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-22 02:26:47,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 02:26:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-22 02:26:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-02-22 02:26:47,764 INFO L87 Difference]: Start difference. First operand 1448 states and 1552 transitions. Second operand 15 states. [2021-02-22 02:26:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 02:26:50,901 INFO L93 Difference]: Finished difference Result 2281 states and 2451 transitions. [2021-02-22 02:26:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-02-22 02:26:50,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 438 [2021-02-22 02:26:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 02:26:50,910 INFO L225 Difference]: With dead ends: 2281 [2021-02-22 02:26:50,910 INFO L226 Difference]: Without dead ends: 0 [2021-02-22 02:26:50,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2021-02-22 02:26:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-22 02:26:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-22 02:26:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-22 02:26:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-22 02:26:50,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 438 [2021-02-22 02:26:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 02:26:50,916 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-22 02:26:50,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-22 02:26:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-22 02:26:50,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-22 02:26:50,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-02-22 02:26:50,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-22 02:26:52,120 WARN L202 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2021-02-22 02:26:52,255 WARN L202 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2021-02-22 02:26:52,588 WARN L202 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2021-02-22 02:26:53,710 WARN L202 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2021-02-22 02:26:54,040 WARN L202 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2021-02-22 02:26:54,329 WARN L202 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 116 [2021-02-22 02:26:55,031 WARN L202 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 127 [2021-02-22 02:26:55,144 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 127 [2021-02-22 02:26:55,719 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2021-02-22 02:26:56,060 WARN L202 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2021-02-22 02:26:56,195 WARN L202 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2021-02-22 02:27:01,107 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 105 [2021-02-22 02:27:01,246 WARN L202 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2021-02-22 02:27:01,406 WARN L202 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 105 [2021-02-22 02:27:02,919 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 119 [2021-02-22 02:27:05,815 WARN L202 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2021-02-22 02:27:06,009 WARN L202 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2021-02-22 02:27:06,263 WARN L202 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2021-02-22 02:27:08,017 WARN L202 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2021-02-22 02:27:08,226 WARN L202 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2021-02-22 02:27:08,546 WARN L202 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2021-02-22 02:27:08,919 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 117 [2021-02-22 02:27:09,367 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2021-02-22 02:27:09,488 WARN L202 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2021-02-22 02:27:13,337 WARN L202 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2021-02-22 02:27:13,764 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2021-02-22 02:27:16,301 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2021-02-22 02:27:16,656 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 63 [2021-02-22 02:27:19,718 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2021-02-22 02:27:19,820 WARN L202 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2021-02-22 02:27:20,069 WARN L202 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2021-02-22 02:27:20,177 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2021-02-22 02:27:20,305 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2021-02-22 02:27:20,411 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2021-02-22 02:27:20,935 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-22 02:27:21,061 WARN L202 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-22 02:27:21,329 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-22 02:27:21,467 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-22 02:27:21,689 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-22 02:27:21,812 WARN L202 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-22 02:27:23,758 WARN L202 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-22 02:27:23,882 WARN L202 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-22 02:27:24,152 WARN L202 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-22 02:27:24,286 WARN L202 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2021-02-22 02:27:24,469 WARN L202 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2021-02-22 02:27:24,592 WARN L202 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2021-02-22 02:27:29,758 WARN L202 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2021-02-22 02:27:30,013 WARN L202 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 38 [2021-02-22 02:27:31,280 WARN L202 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-22 02:27:32,717 WARN L202 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 166 DAG size of output: 80 [2021-02-22 02:27:33,733 WARN L202 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2021-02-22 02:27:34,524 WARN L202 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 55 [2021-02-22 02:27:35,634 WARN L202 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 162 DAG size of output: 89 [2021-02-22 02:27:35,864 WARN L202 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 38 [2021-02-22 02:27:37,845 WARN L202 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2021-02-22 02:27:39,815 WARN L202 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2021-02-22 02:27:40,022 WARN L202 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-22 02:27:40,987 WARN L202 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-22 02:27:41,592 WARN L202 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2021-02-22 02:27:41,878 WARN L202 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2021-02-22 02:27:42,051 WARN L202 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 1 [2021-02-22 02:27:43,813 WARN L202 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 133 DAG size of output: 70 [2021-02-22 02:27:45,673 WARN L202 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2021-02-22 02:27:46,095 WARN L202 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2021-02-22 02:27:46,331 WARN L202 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2021-02-22 02:27:46,882 WARN L202 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2021-02-22 02:27:47,166 WARN L202 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 38 [2021-02-22 02:27:47,609 WARN L202 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2021-02-22 02:27:47,795 WARN L202 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2021-02-22 02:27:48,010 WARN L202 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-22 02:27:48,142 WARN L202 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-22 02:27:48,243 WARN L202 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2021-02-22 02:27:48,468 WARN L202 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-22 02:27:48,598 WARN L202 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-22 02:27:48,827 WARN L202 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2021-02-22 02:27:49,045 WARN L202 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-22 02:27:49,273 WARN L202 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2021-02-22 02:27:50,436 WARN L202 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2021-02-22 02:27:50,836 WARN L202 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2021-02-22 02:27:51,588 WARN L202 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2021-02-22 02:27:52,315 WARN L202 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2021-02-22 02:27:52,779 WARN L202 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2021-02-22 02:27:53,000 WARN L202 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2021-02-22 02:27:53,380 WARN L202 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-02-22 02:27:54,410 WARN L202 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2021-02-22 02:27:55,628 WARN L202 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 127 DAG size of output: 69 [2021-02-22 02:27:56,135 WARN L202 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 [2021-02-22 02:27:56,921 WARN L202 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-22 02:27:58,877 WARN L202 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2021-02-22 02:27:59,729 WARN L202 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2021-02-22 02:28:00,352 WARN L202 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-22 02:28:00,890 WARN L202 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-22 02:28:01,093 WARN L202 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2021-02-22 02:28:01,713 WARN L202 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 45 [2021-02-22 02:28:02,088 WARN L202 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2021-02-22 02:28:02,297 WARN L202 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-22 02:28:02,508 WARN L202 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-22 02:28:02,890 WARN L202 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-02-22 02:28:03,100 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-22 02:28:03,721 WARN L202 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 45 [2021-02-22 02:28:05,738 WARN L202 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 188 DAG size of output: 91 [2021-02-22 02:28:07,039 WARN L202 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-22 02:28:07,387 WARN L202 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2021-02-22 02:28:08,471 WARN L202 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 120 DAG size of output: 59 [2021-02-22 02:28:09,577 WARN L202 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2021-02-22 02:28:09,803 WARN L202 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2021-02-22 02:28:11,371 WARN L202 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 149 DAG size of output: 87 [2021-02-22 02:28:12,851 WARN L202 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 144 DAG size of output: 82 [2021-02-22 02:28:13,270 WARN L202 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2021-02-22 02:28:14,755 WARN L202 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 144 DAG size of output: 82 [2021-02-22 02:28:15,064 WARN L202 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 40 [2021-02-22 02:28:15,193 WARN L202 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2021-02-22 02:28:15,932 WARN L202 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2021-02-22 02:28:16,058 WARN L202 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-02-22 02:28:16,455 WARN L202 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 47 [2021-02-22 02:28:17,157 WARN L202 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2021-02-22 02:28:17,356 WARN L202 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2021-02-22 02:28:17,564 WARN L202 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-02-22 02:28:17,701 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-22 02:28:17,838 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-22 02:28:18,208 WARN L202 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-22 02:28:18,578 WARN L202 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2021-02-22 02:28:19,686 WARN L202 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2021-02-22 02:28:20,113 WARN L202 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2021-02-22 02:28:20,465 WARN L202 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2021-02-22 02:28:21,762 WARN L202 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 165 DAG size of output: 82 [2021-02-22 02:28:22,525 WARN L202 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2021-02-22 02:28:22,823 WARN L202 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2021-02-22 02:28:24,735 WARN L202 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2021-02-22 02:28:24,891 WARN L202 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 32 [2021-02-22 02:28:25,672 WARN L202 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-22 02:28:26,478 WARN L202 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 69 [2021-02-22 02:28:26,651 WARN L202 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 1 [2021-02-22 02:28:27,170 WARN L202 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 51 [2021-02-22 02:28:27,273 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2021-02-22 02:28:27,444 WARN L202 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2021-02-22 02:28:28,032 WARN L202 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2021-02-22 02:28:28,223 WARN L202 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2021-02-22 02:28:28,981 WARN L202 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-22 02:28:29,764 WARN L202 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-22 02:28:30,079 WARN L202 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2021-02-22 02:28:32,317 WARN L202 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 174 DAG size of output: 89 [2021-02-22 02:28:33,062 WARN L202 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2021-02-22 02:28:35,818 WARN L202 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 206 DAG size of output: 102 [2021-02-22 02:28:36,066 WARN L202 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-02-22 02:28:36,248 WARN L202 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-22 02:28:36,665 WARN L202 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2021-02-22 02:28:38,077 WARN L202 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 166 DAG size of output: 80 [2021-02-22 02:28:38,667 WARN L202 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 55 [2021-02-22 02:28:39,097 WARN L202 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2021-02-22 02:28:39,968 WARN L202 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2021-02-22 02:28:40,899 WARN L202 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2021-02-22 02:28:41,638 WARN L202 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2021-02-22 02:28:42,193 WARN L202 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2021-02-22 02:28:43,636 WARN L202 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2021-02-22 02:28:43,776 WARN L202 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2021-02-22 02:28:44,376 WARN L202 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2021-02-22 02:28:44,842 WARN L202 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2021-02-22 02:28:45,195 WARN L202 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2021-02-22 02:28:45,382 WARN L202 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-02-22 02:28:45,488 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2021-02-22 02:28:48,197 WARN L202 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 206 DAG size of output: 102 [2021-02-22 02:28:48,377 WARN L202 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-22 02:28:49,234 WARN L202 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2021-02-22 02:28:49,908 WARN L202 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2021-02-22 02:28:51,112 WARN L202 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2021-02-22 02:28:51,656 WARN L202 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-02-22 02:28:52,441 WARN L202 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-02-22 02:28:52,784 WARN L202 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2021-02-22 02:28:53,256 WARN L202 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2021-02-22 02:28:54,789 WARN L202 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-22 02:28:55,206 WARN L202 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2021-02-22 02:28:56,700 WARN L202 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-22 02:28:57,065 WARN L202 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-22 02:28:58,083 WARN L202 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-22 02:28:58,257 WARN L202 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2021-02-22 02:28:58,463 WARN L202 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2021-02-22 02:28:59,378 WARN L202 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2021-02-22 02:28:59,560 WARN L202 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-22 02:28:59,869 WARN L202 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-02-22 02:29:00,308 WARN L202 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2021-02-22 02:29:01,312 WARN L202 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 61 [2021-02-22 02:29:01,879 WARN L202 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2021-02-22 02:29:02,400 WARN L202 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2021-02-22 02:29:03,122 WARN L202 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2021-02-22 02:29:03,592 WARN L202 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-02-22 02:29:04,482 WARN L202 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2021-02-22 02:29:05,319 WARN L202 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2021-02-22 02:29:05,504 WARN L202 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-22 02:29:05,668 WARN L202 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2021-02-22 02:29:06,198 WARN L202 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2021-02-22 02:29:08,413 WARN L202 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 174 DAG size of output: 90 [2021-02-22 02:29:10,706 WARN L202 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 176 DAG size of output: 91 [2021-02-22 02:29:11,220 WARN L202 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2021-02-22 02:29:12,824 WARN L202 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2021-02-22 02:29:12,988 WARN L202 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2021-02-22 02:29:13,881 WARN L202 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2021-02-22 02:29:14,936 WARN L202 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-22 02:29:15,976 WARN L202 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-22 02:29:18,251 WARN L202 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 174 DAG size of output: 90 [2021-02-22 02:29:19,085 WARN L202 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2021-02-22 02:29:20,122 WARN L202 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2021-02-22 02:29:20,312 WARN L202 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2021-02-22 02:29:20,764 WARN L202 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2021-02-22 02:29:20,968 WARN L202 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2021-02-22 02:29:21,454 WARN L202 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-02-22 02:29:21,770 WARN L202 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 44 [2021-02-22 02:29:21,908 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-02-22 02:29:22,096 WARN L202 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2021-02-22 02:29:23,905 WARN L202 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 158 DAG size of output: 80 [2021-02-22 02:29:24,091 WARN L202 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-22 02:29:24,276 WARN L202 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2021-02-22 02:29:24,943 WARN L202 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2021-02-22 02:29:25,791 WARN L202 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 67 [2021-02-22 02:29:26,091 WARN L202 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2021-02-22 02:29:26,254 WARN L202 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2021-02-22 02:29:28,072 WARN L202 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2021-02-22 02:29:28,329 WARN L202 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2021-02-22 02:29:29,400 WARN L202 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2021-02-22 02:29:29,848 WARN L202 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 40 [2021-02-22 02:29:30,105 WARN L202 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2021-02-22 02:29:31,982 WARN L202 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 145 DAG size of output: 83 [2021-02-22 02:29:32,334 WARN L202 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2021-02-22 02:29:32,968 WARN L202 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 42 [2021-02-22 02:29:33,104 WARN L202 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2021-02-22 02:29:33,387 WARN L202 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2021-02-22 02:29:33,859 WARN L202 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2021-02-22 02:29:33,868 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-22 02:29:33,869 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-22 02:29:33,869 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-22 02:29:33,869 INFO L185 CegarLoopUtils]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= ~t1_pc~0 0)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse17 (or (= ~t1_st~0 0) .cse4)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse2 (= ~m_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse15 (and (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse3 .cse4 .cse5) .cse16 .cse12) (or .cse0 .cse11 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse6 .cse19 .cse7 .cse9 .cse14 .cse11 .cse15 .cse12) (or .cse13 .cse18 .cse6 .cse19 .cse9 .cse14 .cse11 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse1 .cse2)))))) [2021-02-22 02:29:33,870 INFO L185 CegarLoopUtils]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (= ~M_E~0 2))) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= |old(~token~0)| ~token~0))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse0 .cse8 .cse15 .cse9 .cse10 .cse11 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse7 .cse16 .cse8 .cse17 .cse15 .cse10 .cse12 .cse5 .cse13 .cse14) (or .cse7 .cse16 .cse8 .cse17 .cse10 .cse12 .cse5 .cse13 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)))) [2021-02-22 02:29:33,870 INFO L185 CegarLoopUtils]: At program point transmit1ENTRY(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= |old(~m_st~0)| 0))) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (= ~M_E~0 2))) (.cse11 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse12 (= |old(~t1_st~0)| 0)) (.cse13 (not (= |old(~t1_pc~0)| 0))) (.cse18 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse19 (not (= ~m_pc~0 1))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~t1_pc~0 0)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= |old(~token~0)| ~token~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse0 (and .cse7 (= ~m_st~0 0) .cse8 .cse2 .cse4) .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse16 .cse9 .cse17 .cse10 .cse12 .cse18 .cse5 .cse19 .cse14) (or .cse15 .cse16 .cse9 .cse17 .cse12 .cse18 .cse5 .cse19 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)) (or .cse15 .cse9 .cse11 .cse12 .cse13 .cse18 .cse5 .cse19 (and .cse1 .cse7 .cse8 .cse2 .cse4) .cse6 .cse14))) [2021-02-22 02:29:33,870 INFO L185 CegarLoopUtils]: At program point L100(line 100) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse17 (not (= |old(~m_st~0)| 0))) (.cse2 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (= |old(~t1_pc~0)| 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 (and .cse11 .cse12 .cse13) .cse6 .cse8) (or (let ((.cse14 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) .cse11 (<= .cse14 ~token~0) (<= ~token~0 .cse14) .cse12 .cse13)) (let ((.cse15 (= |old(~E_M~0)| 1)) (.cse16 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse0 .cse15 .cse1 .cse16 .cse17 .cse3 .cse5 .cse6 .cse7 .cse9) (or .cse0 .cse15 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)))) (or .cse10 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse9))) [2021-02-22 02:29:33,871 INFO L185 CegarLoopUtils]: At program point L94(line 94) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse11 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse1 (not (= ~M_E~0 2))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse7 (= ~t1_pc~0 1)) (.cse17 (or (= ~t1_st~0 0) .cse10)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse13 .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 (and .cse7 (= ~m_st~0 |old(~m_st~0)|) .cse8 .cse10 .cse11) .cse16 .cse12) (or .cse0 .cse6 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse1 .cse19 .cse2 .cse4 .cse14 .cse6 .cse15 .cse12) (or .cse13 .cse18 .cse1 .cse19 .cse4 .cse14 .cse6 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse7 (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse8 .cse9)))))) [2021-02-22 02:29:33,871 INFO L185 CegarLoopUtils]: At program point L92(line 92) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= ~t1_pc~0 0)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse17 (or (= ~t1_st~0 0) .cse4)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse2 (= ~m_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse15 (and (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse3 .cse4 .cse5) .cse16 .cse12) (or .cse0 .cse11 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse6 .cse19 .cse7 .cse9 .cse14 .cse11 .cse15 .cse12) (or .cse13 .cse18 .cse6 .cse19 .cse9 .cse14 .cse11 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse1 .cse2)))))) [2021-02-22 02:29:33,871 INFO L185 CegarLoopUtils]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (= ~M_E~0 2))) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= |old(~token~0)| ~token~0))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse0 .cse8 .cse15 .cse9 .cse10 .cse11 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse7 .cse16 .cse8 .cse17 .cse15 .cse10 .cse12 .cse5 .cse13 .cse14) (or .cse7 .cse16 .cse8 .cse17 .cse10 .cse12 .cse5 .cse13 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)))) [2021-02-22 02:29:33,872 INFO L185 CegarLoopUtils]: At program point transmit1EXIT(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse8 (not (= |old(~t1_pc~0)| 0))) (.cse1 (<= 2 ~m_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (= ~M_E~0 2))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse16 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse2 .cse17 (and .cse9 .cse1 .cse10 .cse11 .cse13) .cse3 .cse14) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse18 .cse4 .cse19 .cse5 .cse7 .cse16 .cse2 .cse17 .cse14) (or .cse15 .cse18 .cse4 .cse19 .cse7 .cse16 .cse2 .cse17 .cse3 .cse14))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse9 .cse10 (<= .cse20 ~token~0) .cse11 (<= ~token~0 .cse20) .cse12))))) [2021-02-22 02:29:33,872 INFO L185 CegarLoopUtils]: At program point L105(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse8 (not (= |old(~t1_pc~0)| 0))) (.cse1 (<= 2 ~m_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (= ~M_E~0 2))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse16 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse2 .cse17 (and .cse9 .cse1 .cse10 .cse11 .cse13) .cse3 .cse14) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse18 .cse4 .cse19 .cse5 .cse7 .cse16 .cse2 .cse17 .cse14) (or .cse15 .cse18 .cse4 .cse19 .cse7 .cse16 .cse2 .cse17 .cse3 .cse14))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse9 .cse10 (<= .cse20 ~token~0) .cse11 (<= ~token~0 .cse20) .cse12))))) [2021-02-22 02:29:33,872 INFO L185 CegarLoopUtils]: At program point L101(line 101) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse9 (not (= |old(~t1_pc~0)| 0))) (.cse13 (not (= |old(~m_st~0)| 0))) (.cse5 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11 .cse4 .cse12) (or .cse0 .cse6 .cse13 .cse7 .cse8 .cse9 .cse3 .cse12) (or (let ((.cse14 (= |old(~E_M~0)| 1)) (.cse15 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse5 .cse14 .cse6 .cse15 .cse13 .cse8 .cse10 .cse3 .cse11 .cse12) (or .cse5 .cse14 .cse6 .cse15 .cse8 .cse10 .cse3 .cse11 .cse4 .cse12))) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse1 (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse16 ~token~0) (<= ~token~0 .cse16) .cse2))))) [2021-02-22 02:29:33,873 INFO L185 CegarLoopUtils]: At program point L101-1(line 101) the Hoare annotation is: (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse2 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (= |old(~t1_pc~0)| 0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse14 (or (= ~t1_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (let ((.cse10 (= |old(~E_M~0)| 1)) (.cse11 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse3 .cse5 .cse6 .cse7 .cse9) (or .cse0 .cse10 .cse1 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse13 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse13 ~token~0) .cse14 (<= ~token~0 .cse13) (= ~m_st~0 0)))) (or .cse15 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse15 .cse6 .cse8 (and (<= 2 ~m_st~0) .cse14)))) [2021-02-22 02:29:33,874 INFO L185 CegarLoopUtils]: At program point immediate_notifyEXIT(lines 328 338) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (= ~m_st~0 0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (and .cse21 (not (= ~E_1~0 1)) .cse2)) (.cse13 (= |old(~m_st~0)| 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse5 (not (= ~M_E~0 2))) (.cse18 (not (<= ~token~0 ~local~0))) (.cse19 (not (= ~E_M~0 ~M_E~0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse0 (= ~t1_st~0 0)) (.cse9 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or (and .cse0 .cse1) (and .cse1 .cse2) (let ((.cse14 (+ ~local~0 1))) (let ((.cse4 (not (<= ~token~0 .cse14))) (.cse6 (not (<= .cse14 ~token~0))) (.cse8 (not (= ~E_M~0 1))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse4 .cse5 (not .cse13) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12))))) (or .cse15 .cse3 .cse5 .cse16 .cse17 .cse18 .cse13 (and .cse0 (not .cse1)) .cse9 .cse19 .cse20) (or .cse3 .cse5 .cse16 .cse18 .cse0 .cse17 .cse13 .cse9 .cse10 .cse19 .cse20) (or .cse15 (not .cse7) .cse5 (not (= ~t1_pc~0 0)) (not (= |old(~m_st~0)| 1)) .cse18 .cse9 (and (= ~m_st~0 1) .cse2) .cse19 .cse20) (or .cse15 (and (<= 2 ~m_st~0) .cse0) .cse9 (and .cse21 .cse2) .cse11)))) [2021-02-22 02:29:33,874 INFO L185 CegarLoopUtils]: At program point immediate_notifyENTRY(lines 328 338) the Hoare annotation is: (let ((.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (= ~m_pc~0 0))) (.cse5 (= |old(~t1_st~0)| 0)) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse11 (= |old(~m_st~0)| 0)) (.cse7 (not (= ~t1_i~0 1))) (.cse0 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (= ~m_pc~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse17 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (not (<= ~token~0 .cse12))) (.cse4 (not (<= .cse12 ~token~0))) (.cse6 (not (= ~E_M~0 1))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 (not .cse11) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10))))) (or .cse13 .cse7 .cse0 .cse9) (or .cse13 .cse1 .cse3 .cse14 .cse15 .cse11 .cse0 .cse7 .cse16 .cse17) (or .cse13 (not .cse5) .cse3 (not (= ~t1_pc~0 0)) (not (= |old(~m_st~0)| 1)) .cse15 .cse7 .cse0 .cse16 .cse17) (or .cse1 .cse3 .cse14 .cse15 .cse11 .cse7 .cse0 .cse8 .cse16 .cse17))) [2021-02-22 02:29:33,875 INFO L185 CegarLoopUtils]: At program point immediate_notifyFINAL(lines 328 338) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (= ~m_st~0 0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (and .cse21 (not (= ~E_1~0 1)) .cse2)) (.cse13 (= |old(~m_st~0)| 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse5 (not (= ~M_E~0 2))) (.cse18 (not (<= ~token~0 ~local~0))) (.cse19 (not (= ~E_M~0 ~M_E~0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse0 (= ~t1_st~0 0)) (.cse9 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or (and .cse0 .cse1) (and .cse1 .cse2) (let ((.cse14 (+ ~local~0 1))) (let ((.cse4 (not (<= ~token~0 .cse14))) (.cse6 (not (<= .cse14 ~token~0))) (.cse8 (not (= ~E_M~0 1))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse4 .cse5 (not .cse13) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12))))) (or .cse15 .cse3 .cse5 .cse16 .cse17 .cse18 .cse13 (and .cse0 (not .cse1)) .cse9 .cse19 .cse20) (or .cse3 .cse5 .cse16 .cse18 .cse0 .cse17 .cse13 .cse9 .cse10 .cse19 .cse20) (or .cse15 (not .cse7) .cse5 (not (= ~t1_pc~0 0)) (not (= |old(~m_st~0)| 1)) .cse18 .cse9 (and (= ~m_st~0 1) .cse2) .cse19 .cse20) (or .cse15 (and (<= 2 ~m_st~0) .cse0) .cse9 (and .cse21 .cse2) .cse11)))) [2021-02-22 02:29:33,875 INFO L185 CegarLoopUtils]: At program point L320(line 320) the Hoare annotation is: (let ((.cse25 (= |old(~m_st~0)| 0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (<= activate_threads_~tmp~1 0)) (.cse27 (< 0 (+ activate_threads_~tmp~1 1))) (.cse17 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse6 (not (= ~M_E~0 1))) (.cse2 (= ~E_M~0 1)) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse24 (and .cse28 (or (and .cse26 (<= 1 activate_threads_~tmp___0~0) .cse27) (and (not (= ~E_1~0 1)) .cse26 .cse27)) .cse17)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse11 (not .cse20)) (.cse13 (not (= ~M_E~0 2))) (.cse22 (not .cse25)) (.cse14 (not (= ~t1_pc~0 0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse16 (= ~m_st~0 0)) (.cse12 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse28 .cse26 .cse27 .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse12 .cse11 .cse13 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse15 .cse7 .cse9) (or (and .cse16 .cse17 (<= 1 activate_threads_~tmp~1)) (let ((.cse23 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse23))) (.cse19 (not (<= .cse23 ~token~0))) (.cse21 (not .cse2))) (and (or .cse0 .cse18 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse8 .cse10) (or .cse0 .cse18 .cse13 .cse22 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse12 .cse0 .cse13 .cse1 .cse3 .cse24 .cse25 .cse4 .cse15 .cse7) (or .cse0 .cse13 .cse1 .cse3 .cse24 .cse25 .cse4 .cse5 .cse15 .cse7) (or .cse12 .cse11 .cse13 .cse22 .cse14 .cse4 .cse15 .cse10 (and .cse26 .cse27 .cse16 .cse17)) (or .cse12 .cse4 .cse8 .cse9)))) [2021-02-22 02:29:33,876 INFO L185 CegarLoopUtils]: At program point L319(lines 319 323) the Hoare annotation is: (let ((.cse15 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse6 (not (= ~M_E~0 1))) (.cse14 (and .cse29 .cse27 (<= 1 activate_threads_~tmp___0~0) .cse28 .cse20)) (.cse13 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse11 (not .cse23)) (.cse12 (not (= ~M_E~0 2))) (.cse25 (not .cse15)) (.cse18 (not (= ~t1_pc~0 0))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse17 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse12 .cse13 .cse14 .cse1 .cse3 .cse15 .cse4 .cse5 .cse16 .cse7) (or .cse17 .cse11 .cse12 .cse18 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse16 .cse7 .cse9) (or .cse17 .cse14 .cse13 .cse0 .cse12 .cse1 .cse3 .cse15 .cse4 .cse16 .cse7) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse2))) (and (or .cse0 .cse21 .cse12 .cse22 .cse23 .cse24 .cse4 .cse5 .cse8 .cse10) (or .cse0 .cse21 .cse12 .cse25 .cse22 .cse23 .cse24 .cse4 .cse5 .cse10))))) (or .cse17 .cse11 .cse12 .cse25 .cse18 .cse4 .cse16 .cse10 (and .cse27 .cse28 .cse19 .cse20)) (or .cse17 .cse4 .cse8 .cse9)))) [2021-02-22 02:29:33,876 INFO L185 CegarLoopUtils]: At program point L317(line 317) the Hoare annotation is: (let ((.cse7 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse13 (not (= ~M_E~0 1))) (.cse11 (= ~E_M~0 1)) (.cse1 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) .cse28 .cse20)) (.cse3 (not (= ~t1_pc~0 1))) (.cse2 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse12 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse17 (not .cse23)) (.cse4 (not (= ~M_E~0 2))) (.cse25 (not .cse7)) (.cse18 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse5 .cse11 .cse6 .cse8 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (or .cse17 .cse3 .cse11 .cse6 .cse8 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse4 .cse18 (not (= |old(~m_st~0)| 1)) .cse6 .cse8 .cse9 .cse10 .cse15) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse11))) (and (or .cse3 .cse21 .cse4 .cse22 .cse23 .cse24 .cse8 .cse12 .cse14 .cse16) (or .cse3 .cse21 .cse4 .cse25 .cse22 .cse23 .cse24 .cse8 .cse12 .cse16))))) (or .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10) (or .cse0 .cse17 .cse4 .cse25 .cse18 .cse8 .cse9 .cse16 (and .cse27 .cse28 .cse19 .cse20)) (or .cse0 .cse8 .cse14 .cse15)))) [2021-02-22 02:29:33,876 INFO L185 CegarLoopUtils]: At program point L319-2(lines 303 327) the Hoare annotation is: (let ((.cse30 (not (= ~E_1~0 1))) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse29 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse33 (= |old(~m_st~0)| 0))) (let ((.cse14 (not .cse33)) (.cse24 (and .cse29 .cse0 .cse21 .cse22)) (.cse15 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0))) (.cse17 (not (= ~m_pc~0 0))) (.cse18 (not .cse8)) (.cse19 (not (= ~t1_pc~0 0))) (.cse28 (and .cse35 .cse21 .cse22 .cse3)) (.cse6 (not (= ~M_E~0 2))) (.cse32 (and .cse35 .cse30 .cse21 .cse22 .cse3)) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= ~token~0 ~local~0))) (.cse1 (= ~m_st~0 0)) (.cse34 (<= 1 activate_threads_~tmp___0~0)) (.cse20 (not (= ~E_M~0 ~M_E~0)))) (and (let ((.cse2 (<= 1 activate_threads_~tmp~1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (let ((.cse16 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 .cse16))) (.cse7 (not (<= .cse16 ~token~0))) (.cse9 (not .cse15))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))))) (or .cse17 .cse18 .cse6 .cse14 .cse19 .cse10 .cse20 (and .cse21 .cse22 .cse1 .cse3) .cse13) (or .cse4 .cse23 .cse15 .cse24 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse17 .cse24 .cse10 .cse12 .cse28) (or .cse29 .cse4 .cse6 .cse23 .cse25 .cse10 .cse11 .cse20 .cse27 .cse12 .cse13) (or .cse18 .cse4 .cse15 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (let ((.cse31 (not .cse1))) (or .cse17 (and .cse30 .cse0 .cse21 .cse22 .cse31) .cse32 .cse4 .cse6 .cse23 .cse25 .cse33 .cse10 .cse20 .cse27 (and .cse0 .cse21 .cse34 .cse22 .cse31))) (or .cse17 .cse18 .cse6 .cse19 (not (= |old(~m_st~0)| 1)) .cse25 .cse10 .cse20 .cse27 .cse28) (or .cse6 .cse32 .cse10 .cse11 .cse27 (and .cse30 .cse0 .cse21 .cse22) .cse4 (and .cse30 .cse0 .cse1) .cse23 .cse25 .cse33 (and .cse0 .cse1 .cse34) (and .cse0 .cse21 .cse34 .cse22) .cse20)))) [2021-02-22 02:29:33,877 INFO L185 CegarLoopUtils]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse7 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse13 (not (= ~M_E~0 1))) (.cse11 (= ~E_M~0 1)) (.cse1 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) .cse28 .cse20)) (.cse3 (not (= ~t1_pc~0 1))) (.cse2 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse12 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse17 (not .cse23)) (.cse4 (not (= ~M_E~0 2))) (.cse25 (not .cse7)) (.cse18 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse5 .cse11 .cse6 .cse8 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (or .cse17 .cse3 .cse11 .cse6 .cse8 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse4 .cse18 (not (= |old(~m_st~0)| 1)) .cse6 .cse8 .cse9 .cse10 .cse15) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse11))) (and (or .cse3 .cse21 .cse4 .cse22 .cse23 .cse24 .cse8 .cse12 .cse14 .cse16) (or .cse3 .cse21 .cse4 .cse25 .cse22 .cse23 .cse24 .cse8 .cse12 .cse16))))) (or .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10) (or .cse0 .cse17 .cse4 .cse25 .cse18 .cse8 .cse9 .cse16 (and .cse27 .cse28 .cse19 .cse20)) (or .cse0 .cse8 .cse14 .cse15)))) [2021-02-22 02:29:33,877 INFO L185 CegarLoopUtils]: At program point L317-2(line 317) the Hoare annotation is: (let ((.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= |old(~m_st~0)| 0)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse6 (not (= ~M_E~0 1))) (.cse2 (= ~E_M~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse11 (not .cse20)) (.cse22 (not .cse26)) (.cse14 (not (= ~t1_pc~0 0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse16 (= ~m_st~0 0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse29 .cse27 .cse28 .cse17)) (.cse12 (not (= ~m_pc~0 0))) (.cse24 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse17)) (.cse0 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse25 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) (<= 1 activate_threads_~tmp___0~0) .cse28 .cse17)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse12 .cse11 .cse13 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse15 .cse7 .cse9) (or (and .cse16 .cse17 (<= 1 activate_threads_~tmp~1)) (let ((.cse23 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse23))) (.cse19 (not (<= .cse23 ~token~0))) (.cse21 (not .cse2))) (and (or .cse0 .cse18 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse8 .cse10) (or .cse0 .cse18 .cse13 .cse22 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse0 .cse13 .cse24 .cse25 .cse1 .cse3 .cse26 .cse4 .cse5 .cse15 .cse7) (or .cse12 .cse11 .cse13 .cse22 .cse14 .cse4 .cse15 .cse10 (and .cse27 .cse28 .cse16 .cse17)) (or .cse12 .cse4 .cse8 .cse9) (or .cse12 .cse24 .cse0 .cse13 .cse25 .cse1 .cse3 .cse26 .cse4 .cse15 .cse7)))) [2021-02-22 02:29:33,877 INFO L185 CegarLoopUtils]: At program point L312(line 312) the Hoare annotation is: (let ((.cse18 (= |old(~t1_st~0)| 0)) (.cse7 (= |old(~m_st~0)| 0))) (let ((.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse4 (not (= ~M_E~0 2))) (.cse20 (not .cse7)) (.cse12 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not .cse18)) (.cse3 (not (= ~t1_pc~0 1))) (.cse13 (= ~E_M~0 1)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse1 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse14 (not (= ~M_E~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse4 .cse12 (not (= |old(~m_st~0)| 1)) .cse6 .cse1 .cse9 .cse10) (or .cse3 .cse5 .cse13 .cse6 .cse1 .cse8 .cse14 .cse10 .cse2 .cse15) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 .cse9 .cse10) (or (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (<= 1 activate_threads_~tmp~1)) (let ((.cse21 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse21))) (.cse17 (not (<= .cse21 ~token~0))) (.cse19 (not .cse13))) (and (or .cse3 .cse16 .cse4 .cse17 .cse18 .cse19 .cse1 .cse8 .cse2 .cse15) (or .cse3 .cse16 .cse4 .cse20 .cse17 .cse18 .cse19 .cse1 .cse8 .cse15))))) (or .cse0 .cse11 .cse4 .cse20 .cse12 .cse1 .cse9 .cse15) (or .cse11 .cse3 .cse13 .cse6 .cse1 .cse8 .cse14 .cse10 .cse2 .cse15)))) [2021-02-22 02:29:33,878 INFO L185 CegarLoopUtils]: At program point L311(lines 311 315) the Hoare annotation is: (let ((.cse21 (= |old(~t1_st~0)| 0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (<= activate_threads_~tmp~1 0)) (.cse8 (< 0 (+ activate_threads_~tmp~1 1))) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= |old(~m_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse3 (not .cse16)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse15 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse18 .cse7 .cse8 .cse9)) (.cse1 (not .cse21)) (.cse14 (not (= ~t1_pc~0 1))) (.cse24 (= ~E_M~0 1)) (.cse11 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= ~local~0 ~token~0))) (.cse23 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 (= ~m_st~0 0) .cse9) .cse10) (or .cse0 .cse1 .cse2 .cse4 (not (= |old(~m_st~0)| 1)) .cse11 .cse5 .cse6 .cse12 .cse13) (or .cse14 .cse2 .cse15 .cse11 .cse16 .cse5 .cse17 .cse6 .cse12 .cse13) (or (and .cse18 .cse9 (<= 1 activate_threads_~tmp~1)) (let ((.cse25 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse25))) (.cse20 (not (<= .cse25 ~token~0))) (.cse22 (not .cse24))) (and (or .cse14 .cse19 .cse2 .cse20 .cse21 .cse22 .cse5 .cse17 .cse23 .cse10) (or .cse14 .cse19 .cse2 .cse3 .cse20 .cse21 .cse22 .cse5 .cse17 .cse10))))) (or .cse0 .cse5 .cse23 .cse13) (or .cse0 .cse14 .cse2 .cse15 .cse11 .cse16 .cse5 .cse6 .cse12 .cse13) (or .cse14 .cse15 .cse24 .cse11 .cse5 .cse17 .cse26 .cse12 .cse23 .cse10 .cse13) (or .cse1 .cse14 .cse24 .cse11 .cse5 .cse17 .cse26 .cse12 .cse23 .cse10 (and .cse18 (= ~t1_st~0 0) .cse7 .cse8))))) [2021-02-22 02:29:33,878 INFO L185 CegarLoopUtils]: At program point L309(line 309) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse24 (= |old(~m_st~0)| 0))) (let ((.cse13 (not .cse24)) (.cse2 (= ~E_M~0 1)) (.cse6 (not (= ~M_E~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse0 (not .cse20)) (.cse14 (not (= ~t1_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse12 (not (= ~M_E~0 2))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse17 (and .cse7 .cse15)) (.cse5 (not (= ~m_pc~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~t1_st~0 0)) .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse4 (and (= ~m_st~0 0) .cse15) .cse16 .cse10) (or .cse17 (let ((.cse22 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse22))) (.cse19 (not (<= .cse22 ~token~0))) (.cse21 (not .cse2))) (and (or .cse1 .cse18 .cse12 .cse19 .cse20 .cse21 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse11 .cse4 .cse17 .cse9) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse11 .cse1 .cse12 .cse23 .cse3 .cse24 .cse17 .cse4 .cse16 .cse8) (or .cse11 .cse0 .cse12 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse17 .cse16 .cse8) (or .cse1 .cse12 .cse23 .cse3 .cse24 .cse4 .cse17 .cse5 .cse16 .cse8)))) [2021-02-22 02:29:33,878 INFO L185 CegarLoopUtils]: At program point L311-2(lines 311 315) the Hoare annotation is: (let ((.cse25 (<= activate_threads_~tmp~1 0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (= |old(~m_st~0)| 0)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse6 (not (= ~M_E~0 1))) (.cse2 (= ~E_M~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse11 (not .cse20)) (.cse22 (not .cse24)) (.cse14 (not (= ~t1_pc~0 0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse16 (= ~m_st~0 0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (= ~m_pc~0 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse9 (and (= ~m_st~0 |old(~m_st~0)|) .cse25 .cse26 .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse12 .cse11 .cse13 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse15 .cse7 .cse9) (or (and .cse16 .cse17 (<= 1 activate_threads_~tmp~1)) (let ((.cse23 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse23))) (.cse19 (not (<= .cse23 ~token~0))) (.cse21 (not .cse2))) (and (or .cse0 .cse18 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse8 .cse10) (or .cse0 .cse18 .cse13 .cse22 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse0 .cse13 .cse1 .cse3 .cse24 .cse4 .cse5 .cse15 .cse7 .cse9) (or .cse12 .cse11 .cse13 .cse22 .cse14 .cse4 .cse15 .cse10 (and .cse25 .cse26 .cse16 .cse17)) (or .cse12 .cse4 .cse8 .cse9) (or .cse12 .cse0 .cse13 .cse1 .cse3 .cse24 .cse4 .cse15 .cse7 .cse9)))) [2021-02-22 02:29:33,879 INFO L185 CegarLoopUtils]: At program point L309-1(line 309) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret11| 0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (<= 0 |activate_threads_#t~ret11|)) (.cse16 (= |old(~m_st~0)| 0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse1 (not .cse24)) (.cse13 (not (= ~M_E~0 1))) (.cse17 (not .cse16)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (not (<= 2 ~E_1~0))) (.cse11 (= ~E_M~0 1)) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse3 (and .cse21 .cse18 .cse19 .cse20)) (.cse6 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 1)) .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse14 .cse15) (or .cse9 .cse2 .cse3 .cse10 .cse5 .cse16 .cse6 .cse12 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse15 (and (= ~m_st~0 0) .cse18 .cse19 .cse20)) (or .cse1 .cse9 (and .cse21 (= ~t1_st~0 0) .cse18 .cse20) .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse14 .cse15) (or (and .cse21 (<= 1 |activate_threads_#t~ret11|) .cse19) (let ((.cse26 (+ ~local~0 1))) (let ((.cse22 (not (<= ~token~0 .cse26))) (.cse23 (not (<= .cse26 ~token~0))) (.cse25 (not .cse11))) (and (or .cse9 .cse22 .cse2 .cse23 .cse24 .cse25 .cse6 .cse12 .cse14 .cse15) (or .cse9 .cse22 .cse2 .cse17 .cse23 .cse24 .cse25 .cse6 .cse12 .cse15))))) (or .cse0 .cse3 .cse9 .cse2 .cse10 .cse5 .cse16 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse6 .cse14)))) [2021-02-22 02:29:33,879 INFO L185 CegarLoopUtils]: At program point L309-2(line 309) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret11| 0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (<= 0 |activate_threads_#t~ret11|)) (.cse16 (= |old(~m_st~0)| 0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse1 (not .cse24)) (.cse13 (not (= ~M_E~0 1))) (.cse17 (not .cse16)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (not (<= 2 ~E_1~0))) (.cse11 (= ~E_M~0 1)) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse3 (and .cse21 .cse18 .cse19 .cse20)) (.cse6 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 1)) .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse14 .cse15) (or .cse9 .cse2 .cse3 .cse10 .cse5 .cse16 .cse6 .cse12 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse15 (and (= ~m_st~0 0) .cse18 .cse19 .cse20)) (or .cse1 .cse9 (and .cse21 (= ~t1_st~0 0) .cse18 .cse20) .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse14 .cse15) (or (and .cse21 (<= 1 |activate_threads_#t~ret11|) .cse19) (let ((.cse26 (+ ~local~0 1))) (let ((.cse22 (not (<= ~token~0 .cse26))) (.cse23 (not (<= .cse26 ~token~0))) (.cse25 (not .cse11))) (and (or .cse9 .cse22 .cse2 .cse23 .cse24 .cse25 .cse6 .cse12 .cse14 .cse15) (or .cse9 .cse22 .cse2 .cse17 .cse23 .cse24 .cse25 .cse6 .cse12 .cse15))))) (or .cse0 .cse3 .cse9 .cse2 .cse10 .cse5 .cse16 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse6 .cse14)))) [2021-02-22 02:29:33,880 INFO L185 CegarLoopUtils]: At program point L309-3(line 309) the Hoare annotation is: (let ((.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (<= activate_threads_~tmp~1 0)) (.cse23 (< 0 (+ activate_threads_~tmp~1 1))) (.cse24 (<= |activate_threads_#t~ret11| 0)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (<= 0 |activate_threads_#t~ret11|)) (.cse6 (= |old(~t1_st~0)| 0)) (.cse28 (= |old(~m_st~0)| 0))) (let ((.cse12 (not .cse28)) (.cse26 (not (= ~t1_pc~0 0))) (.cse21 (not .cse6)) (.cse13 (= ~E_M~0 1)) (.cse17 (not (= ~M_E~0 1))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= 2 ~E_1~0))) (.cse20 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse15 (not (<= 2 |old(~t1_st~0)|))) (.cse16 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse27 (not (= ~E_M~0 ~M_E~0))) (.cse18 (and .cse0 .cse22 .cse23 .cse24 .cse1 .cse25)) (.cse19 (not (<= ~local~0 ~token~0)))) (and (or (and .cse0 (<= 1 |activate_threads_#t~ret11|) .cse1 (<= 1 activate_threads_~tmp~1)) (let ((.cse14 (+ ~local~0 1))) (let ((.cse3 (not (<= ~token~0 .cse14))) (.cse5 (not (<= .cse14 ~token~0))) (.cse7 (not .cse13))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11))))) (or .cse2 .cse15 .cse13 .cse16 .cse8 .cse9 .cse17 .cse18 .cse19 .cse10 .cse11) (or .cse20 .cse21 .cse4 (and .cse22 .cse23 (= ~m_st~0 0) .cse24 .cse1 .cse25) .cse12 .cse26 .cse8 .cse27 .cse11) (or .cse20 .cse8 .cse18 .cse10) (or .cse20 .cse21 .cse4 .cse26 (not (= |old(~m_st~0)| 1)) .cse16 .cse8 .cse18 .cse27 .cse19) (or (and .cse0 (= ~t1_st~0 0) .cse22 .cse23 .cse24 .cse25) .cse21 .cse2 .cse13 .cse16 .cse8 .cse9 .cse17 .cse19 .cse10 .cse11) (or .cse20 .cse2 .cse4 .cse15 .cse16 .cse28 .cse8 .cse18 .cse27 .cse19) (or .cse2 .cse4 .cse15 .cse16 .cse28 .cse8 .cse9 .cse27 .cse18 .cse19)))) [2021-02-22 02:29:33,880 INFO L185 CegarLoopUtils]: At program point L305(line 305) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse24 (= |old(~m_st~0)| 0))) (let ((.cse13 (not .cse24)) (.cse2 (= ~E_M~0 1)) (.cse6 (not (= ~M_E~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse0 (not .cse20)) (.cse14 (not (= ~t1_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse12 (not (= ~M_E~0 2))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse17 (and .cse7 .cse15)) (.cse5 (not (= ~m_pc~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~t1_st~0 0)) .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse4 (and (= ~m_st~0 0) .cse15) .cse16 .cse10) (or .cse17 (let ((.cse22 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse22))) (.cse19 (not (<= .cse22 ~token~0))) (.cse21 (not .cse2))) (and (or .cse1 .cse18 .cse12 .cse19 .cse20 .cse21 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse11 .cse4 .cse17 .cse9) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse11 .cse1 .cse12 .cse23 .cse3 .cse24 .cse17 .cse4 .cse16 .cse8) (or .cse11 .cse0 .cse12 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse17 .cse16 .cse8) (or .cse1 .cse12 .cse23 .cse3 .cse24 .cse4 .cse17 .cse5 .cse16 .cse8)))) [2021-02-22 02:29:33,880 INFO L185 CegarLoopUtils]: At program point activate_threadsENTRY(lines 303 327) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse24 (= |old(~m_st~0)| 0))) (let ((.cse13 (not .cse24)) (.cse2 (= ~E_M~0 1)) (.cse6 (not (= ~M_E~0 1))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse0 (not .cse20)) (.cse14 (not (= ~t1_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse12 (not (= ~M_E~0 2))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse17 (and .cse7 .cse15)) (.cse5 (not (= ~m_pc~0 1))) (.cse16 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~t1_st~0 0)) .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse4 (and (= ~m_st~0 0) .cse15) .cse16 .cse10) (or .cse17 (let ((.cse22 (+ ~local~0 1))) (let ((.cse18 (not (<= ~token~0 .cse22))) (.cse19 (not (<= .cse22 ~token~0))) (.cse21 (not .cse2))) (and (or .cse1 .cse18 .cse12 .cse19 .cse20 .cse21 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse4 .cse5 .cse10))))) (or .cse11 .cse4 .cse17 .cse9) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse11 .cse1 .cse12 .cse23 .cse3 .cse24 .cse17 .cse4 .cse16 .cse8) (or .cse11 .cse0 .cse12 .cse14 (not (= |old(~m_st~0)| 1)) .cse3 .cse4 .cse17 .cse16 .cse8) (or .cse1 .cse12 .cse23 .cse3 .cse24 .cse4 .cse17 .cse5 .cse16 .cse8)))) [2021-02-22 02:29:33,881 INFO L185 CegarLoopUtils]: At program point activate_threadsEXIT(lines 303 327) the Hoare annotation is: (let ((.cse30 (not (= ~E_1~0 1))) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse29 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse33 (= |old(~m_st~0)| 0))) (let ((.cse14 (not .cse33)) (.cse24 (and .cse29 .cse0 .cse21 .cse22)) (.cse15 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0))) (.cse17 (not (= ~m_pc~0 0))) (.cse18 (not .cse8)) (.cse19 (not (= ~t1_pc~0 0))) (.cse28 (and .cse35 .cse21 .cse22 .cse3)) (.cse6 (not (= ~M_E~0 2))) (.cse32 (and .cse35 .cse30 .cse21 .cse22 .cse3)) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= ~token~0 ~local~0))) (.cse1 (= ~m_st~0 0)) (.cse34 (<= 1 activate_threads_~tmp___0~0)) (.cse20 (not (= ~E_M~0 ~M_E~0)))) (and (let ((.cse2 (<= 1 activate_threads_~tmp~1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (let ((.cse16 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 .cse16))) (.cse7 (not (<= .cse16 ~token~0))) (.cse9 (not .cse15))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))))) (or .cse17 .cse18 .cse6 .cse14 .cse19 .cse10 .cse20 (and .cse21 .cse22 .cse1 .cse3) .cse13) (or .cse4 .cse23 .cse15 .cse24 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse17 .cse24 .cse10 .cse12 .cse28) (or .cse29 .cse4 .cse6 .cse23 .cse25 .cse10 .cse11 .cse20 .cse27 .cse12 .cse13) (or .cse18 .cse4 .cse15 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (let ((.cse31 (not .cse1))) (or .cse17 (and .cse30 .cse0 .cse21 .cse22 .cse31) .cse32 .cse4 .cse6 .cse23 .cse25 .cse33 .cse10 .cse20 .cse27 (and .cse0 .cse21 .cse34 .cse22 .cse31))) (or .cse17 .cse18 .cse6 .cse19 (not (= |old(~m_st~0)| 1)) .cse25 .cse10 .cse20 .cse27 .cse28) (or .cse6 .cse32 .cse10 .cse11 .cse27 (and .cse30 .cse0 .cse21 .cse22) .cse4 (and .cse30 .cse0 .cse1) .cse23 .cse25 .cse33 (and .cse0 .cse1 .cse34) (and .cse0 .cse21 .cse34 .cse22) .cse20)))) [2021-02-22 02:29:33,881 INFO L185 CegarLoopUtils]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (= ~E_M~0 1)) (.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~M_E~0 2))) (.cse14 (not (= ~t1_pc~0 0))) (.cse11 (not (<= ~token~0 ~local~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (not (= ~t1_st~0 0))) (.cse5 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse9 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse4 .cse13 .cse8) (or .cse0 .cse2 .cse14 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse15 .cse5 .cse13 .cse8) (let ((.cse16 (+ ~local~0 1))) (or .cse1 .cse2 (not (<= ~token~0 .cse16)) (not (<= .cse16 ~token~0)) .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse9 .cse2 .cse14 .cse11 .cse3 .cse12 .cse15 .cse5 .cse6 .cse13 .cse8))) [2021-02-22 02:29:33,881 INFO L185 CegarLoopUtils]: At program point L191(line 191) the Hoare annotation is: (let ((.cse10 (not (= ~t1_pc~0 0))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_st~0 0))) (.cse5 (not (= ~m_pc~0 1))) (.cse9 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 ~t1_st~0))) (.cse11 (not (= ~E_M~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 (= ~E_M~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse8) (or .cse0 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8) (or .cse9 .cse0 .cse4 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse13)) .cse2 (not (<= .cse13 ~token~0)) .cse4 .cse5 .cse14 .cse11 .cse12 .cse8)) (or .cse9 .cse1 .cse2 .cse4 .cse14 .cse11 .cse12 .cse8))) [2021-02-22 02:29:33,882 INFO L185 CegarLoopUtils]: At program point exists_runnable_threadEXIT(lines 176 195) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) .cse1 (not (<= .cse12 ~token~0)) .cse4 .cse5 .cse6 .cse13 .cse8 .cse14 .cse10)) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse0 .cse11 .cse1 .cse15 .cse3 .cse5 .cse6 .cse13 .cse9 .cse10) (or .cse16 .cse11 .cse1 .cse4 .cse5 .cse13 .cse8 .cse14 .cse10) (or .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2021-02-22 02:29:33,882 INFO L185 CegarLoopUtils]: At program point L185(line 185) the Hoare annotation is: (let ((.cse2 (= ~t1_st~0 0)) (.cse1 (not (<= 2 ~m_st~0))) (.cse10 (not (= ~m_pc~0 1))) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse3 (not .cse2) .cse5 .cse6 .cse7) (let ((.cse9 (+ ~local~0 1))) (or .cse8 (not (<= ~token~0 .cse9)) .cse4 (not (<= .cse9 ~token~0)) .cse3 .cse10 .cse11 .cse5 .cse6 .cse7)) (or .cse1 .cse8 .cse4 (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) .cse3 .cse10 .cse11 (not (<= ~local~0 ~token~0)) .cse7) (or .cse0 .cse8 .cse4 .cse3 .cse11 .cse5 .cse6 .cse7))) [2021-02-22 02:29:33,882 INFO L185 CegarLoopUtils]: At program point L184(lines 184 189) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not (= ~t1_pc~0 0)) .cse2 (not (= ~t1_st~0 0)) .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (or .cse6 (not (<= ~token~0 .cse7)) .cse1 (not (<= .cse7 ~token~0)) .cse2 (not (= ~m_pc~0 1)) .cse8 .cse3 .cse4 .cse5)) (or .cse0 .cse6 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5))) [2021-02-22 02:29:33,882 INFO L192 CegarLoopUtils]: At program point exists_runnable_threadENTRY(lines 176 195) the Hoare annotation is: true [2021-02-22 02:29:33,882 INFO L185 CegarLoopUtils]: At program point L181(line 181) the Hoare annotation is: (let ((.cse7 (not (= ~t1_st~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse5 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 ~M_E~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or (not (= ~m_pc~0 0)) .cse0 .cse5))) [2021-02-22 02:29:33,882 INFO L192 CegarLoopUtils]: At program point L180(lines 180 190) the Hoare annotation is: true [2021-02-22 02:29:33,883 INFO L185 CegarLoopUtils]: At program point exists_runnable_threadFINAL(lines 176 195) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) .cse1 (not (<= .cse12 ~token~0)) .cse4 .cse5 .cse6 .cse13 .cse8 .cse14 .cse10)) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse0 .cse11 .cse1 .cse15 .cse3 .cse5 .cse6 .cse13 .cse9 .cse10) (or .cse16 .cse11 .cse1 .cse4 .cse5 .cse13 .cse8 .cse14 .cse10) (or .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2021-02-22 02:29:33,883 INFO L185 CegarLoopUtils]: At program point is_transmit1_triggeredFINAL(lines 131 149) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2021-02-22 02:29:33,883 INFO L192 CegarLoopUtils]: At program point is_transmit1_triggeredENTRY(lines 131 149) the Hoare annotation is: true [2021-02-22 02:29:33,883 INFO L185 CegarLoopUtils]: At program point is_transmit1_triggeredEXIT(lines 131 149) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2021-02-22 02:29:33,883 INFO L185 CegarLoopUtils]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (<= 1 is_transmit1_triggered_~__retres1~1)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2021-02-22 02:29:33,883 INFO L185 CegarLoopUtils]: At program point L137(line 137) the Hoare annotation is: (let ((.cse17 (= ~t1_st~0 0))) (let ((.cse6 (not (<= 2 ~t1_st~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse11 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse2 (not (= ~M_E~0 2))) (.cse13 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse14 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse12 (not .cse17)) (.cse15 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse2 .cse11 .cse4 .cse12 .cse7 .cse13 .cse9) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8 .cse9) (or .cse10 .cse2 .cse11 .cse3 (not (= ~m_st~0 1)) .cse4 .cse12 .cse7 .cse8) (let ((.cse16 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse16)) .cse2 (not (<= .cse16 ~token~0)) .cse17 (not .cse14) .cse4 .cse5 .cse13 .cse9)) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse12 .cse15 .cse8 .cse9)))) [2021-02-22 02:29:33,884 INFO L185 CegarLoopUtils]: At program point L136(lines 136 141) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_pc~0 0))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~t1_st~0 0))) (.cse5 (not (= ~E_M~0 ~M_E~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)) (not (= ~m_st~0 1)) .cse3 .cse4 .cse5 (not (<= ~local~0 ~token~0))))) [2021-02-22 02:29:33,884 INFO L192 CegarLoopUtils]: At program point L135(lines 135 144) the Hoare annotation is: true [2021-02-22 02:29:33,884 INFO L185 CegarLoopUtils]: At program point L135-2(lines 135 144) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse6 .cse7))) [2021-02-22 02:29:33,884 INFO L185 CegarLoopUtils]: At program point L289-1(lines 278 301) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 ~M_E~0)) (.cse10 (not (= ~t1_st~0 0))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse7 (not (= 2 |old(~M_E~0)|))) (.cse13 (= ~M_E~0 2))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse2 .cse12 .cse13)) (or .cse0 (and .cse2 .cse12 .cse14) (not (= ~t1_pc~0 0)) .cse6 .cse3 .cse7 .cse9 .cse10 (not (= ~m_st~0 0))) (or (and .cse2 .cse13 .cse14) .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse11) (or .cse0 .cse1 .cse3 .cse7 .cse13))) [2021-02-22 02:29:33,884 INFO L185 CegarLoopUtils]: At program point L285(line 285) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse11 (not (= ~t1_st~0 0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse7 (and .cse1 .cse3 (= ~E_M~0 ~M_E~0) .cse4)) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 |old(~M_E~0)|))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (let ((.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse1 (= ~M_E~0 2) .cse2) (and .cse1 .cse3 .cse4 .cse2) .cse5 .cse6)) (or .cse0 .cse7 (not (= ~t1_pc~0 0)) .cse8 .cse6 .cse9 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse5 .cse3 .cse6 .cse9) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 .cse10 .cse11 .cse15) (or .cse5 .cse7 .cse12 .cse13 .cse8 .cse6 .cse9 .cse14 (not (<= 2 ~t1_st~0)) .cse10 .cse15)))) [2021-02-22 02:29:33,885 INFO L185 CegarLoopUtils]: At program point L279-1(lines 278 301) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse7 (and .cse1 .cse3 (= ~E_M~0 ~M_E~0) .cse4)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 |old(~M_E~0)|))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse11 (not (= ~t1_st~0 0))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (let ((.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse1 (= ~M_E~0 2) .cse2) (and .cse1 .cse3 .cse4 .cse2) .cse5 .cse6)) (or .cse0 .cse7 (not (= ~t1_pc~0 0)) .cse8 .cse6 .cse9 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse5 .cse3 .cse6 .cse9) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 (not (<= 2 ~t1_st~0)) .cse10 .cse15) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 .cse10 .cse11 .cse15)))) [2021-02-22 02:29:33,885 INFO L185 CegarLoopUtils]: At program point reset_delta_eventsENTRY(lines 275 302) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_st~0 0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse6 (and .cse1 .cse2 (= ~E_M~0 ~M_E~0) .cse3)) (.cse12 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse13 (not (= ~m_pc~0 1))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse14 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5) (or .cse0 .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse5 .cse8 .cse9 .cse10 (not (= ~m_st~0 0))) (or .cse4 .cse11 .cse6 .cse12 .cse7 .cse5 .cse8 .cse13 .cse9 .cse10 .cse14) (or .cse4 .cse11 .cse6 .cse12 .cse7 .cse5 .cse8 .cse13 (not (<= 2 ~t1_st~0)) .cse9 .cse14)))) [2021-02-22 02:29:33,885 INFO L185 CegarLoopUtils]: At program point L294-1(lines 275 302) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (= ~M_E~0 2)) (.cse13 (not (= ~m_pc~0 0))) (.cse12 (and .cse10 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= ~E_M~0 ~M_E~0) .cse11)) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse13 .cse0 .cse4 .cse5 .cse11) (or .cse13 (not (= ~t1_pc~0 0)) .cse12 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0)))))) [2021-02-22 02:29:33,885 INFO L185 CegarLoopUtils]: At program point L290(line 290) the Hoare annotation is: (let ((.cse9 (not (= ~t1_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (= ~t1_pc~0 0)) .cse5 .cse2 .cse6 .cse8 .cse9 (not (= ~m_st~0 0))) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse10) (or .cse0 .cse1 .cse2 .cse6 (= ~M_E~0 2)))) [2021-02-22 02:29:33,886 INFO L185 CegarLoopUtils]: At program point L284-1(lines 278 301) the Hoare annotation is: (let ((.cse11 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_pc~0 0))) (.cse14 (= ~M_E~0 2)) (.cse1 (not (<= 2 ~m_st~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse12 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4) (or .cse1 .cse5 .cse6 .cse7 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse2 .cse13 .cse14)) (or .cse0 (not (= ~t1_pc~0 0)) (and .cse2 .cse13 (= ~M_E~0 |old(~M_E~0)|)) .cse7 .cse4 .cse8 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse4 .cse8 .cse14) (or .cse1 .cse5 (and .cse2 .cse13 .cse3) .cse6 .cse7 .cse4 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse12))) [2021-02-22 02:29:33,886 INFO L185 CegarLoopUtils]: At program point L280(line 280) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .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 .cse2) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse6) (or .cse0 (not (= ~t1_pc~0 0)) .cse5 .cse2 .cse6 .cse8 .cse9 (not (= ~m_st~0 0))) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse10))) [2021-02-22 02:29:33,886 INFO L185 CegarLoopUtils]: At program point reset_delta_eventsEXIT(lines 275 302) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (= ~M_E~0 2)) (.cse13 (not (= ~m_pc~0 0))) (.cse12 (and .cse10 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= ~E_M~0 ~M_E~0) .cse11)) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse13 .cse0 .cse4 .cse5 .cse11) (or .cse13 (not (= ~t1_pc~0 0)) .cse12 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0)))))) [2021-02-22 02:29:33,886 INFO L185 CegarLoopUtils]: At program point L295(line 295) the Hoare annotation is: (let ((.cse8 (not (= ~t1_st~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse4) (or .cse10 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse10 .cse0 .cse4 .cse5 (= ~M_E~0 2)))) [2021-02-22 02:29:33,886 INFO L185 CegarLoopUtils]: At program point L162-1(lines 161 174) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2021-02-22 02:29:33,886 INFO L185 CegarLoopUtils]: At program point init_threadsEXIT(lines 158 175) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2021-02-22 02:29:33,886 INFO L185 CegarLoopUtils]: At program point init_threadsENTRY(lines 158 175) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,887 INFO L185 CegarLoopUtils]: At program point L170(line 170) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,887 INFO L185 CegarLoopUtils]: At program point L168(line 168) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2021-02-22 02:29:33,887 INFO L185 CegarLoopUtils]: At program point L167-1(lines 158 175) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2021-02-22 02:29:33,887 INFO L185 CegarLoopUtils]: At program point L165(line 165) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,887 INFO L185 CegarLoopUtils]: At program point L163(line 163) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,887 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 464 475) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2021-02-22 02:29:33,887 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 464 475) the Hoare annotation is: true [2021-02-22 02:29:33,887 INFO L192 CegarLoopUtils]: At program point L473(line 473) the Hoare annotation is: true [2021-02-22 02:29:33,887 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 464 475) the Hoare annotation is: true [2021-02-22 02:29:33,888 INFO L192 CegarLoopUtils]: At program point L470(line 470) the Hoare annotation is: true [2021-02-22 02:29:33,888 INFO L185 CegarLoopUtils]: At program point L469(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2021-02-22 02:29:33,888 INFO L185 CegarLoopUtils]: At program point L469-1(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_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(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2021-02-22 02:29:33,888 INFO L192 CegarLoopUtils]: At program point errorEXIT(lines 8 15) the Hoare annotation is: true [2021-02-22 02:29:33,888 INFO L192 CegarLoopUtils]: At program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2021-02-22 02:29:33,888 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-22 02:29:33,888 INFO L192 CegarLoopUtils]: At program point errorENTRY(lines 8 15) the Hoare annotation is: true [2021-02-22 02:29:33,888 INFO L192 CegarLoopUtils]: At program point errorFINAL(lines 8 15) the Hoare annotation is: true [2021-02-22 02:29:33,889 INFO L185 CegarLoopUtils]: At program point masterEXIT(lines 32 75) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (= ~m_pc~0 1)) (.cse20 (= ~t1_i~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~M_E~0 2)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse12 (not .cse17)) (.cse0 (not .cse19)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and (<= 2 ~t1_st~0) .cse5 .cse17 .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse20)) (.cse4 (not .cse18)) (.cse15 (and .cse5 .cse17 (= ~t1_st~0 0) .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15) (let ((.cse16 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse12 .cse0 (not (<= |old(~token~0)| .cse16)) .cse13 .cse14 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 (not (<= .cse16 |old(~token~0)|)) .cse15))))) [2021-02-22 02:29:33,889 INFO L185 CegarLoopUtils]: At program point L56(line 56) the Hoare annotation is: (let ((.cse9 (= ~t1_st~0 0)) (.cse17 (= ~E_M~0 ~M_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse18 (= ~t1_i~0 1)) (.cse10 (= ~m_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse19 (= ~M_E~0 2)) (.cse16 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse16)) (.cse1 (not .cse19)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (not (= |old(~m_st~0)| 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and .cse16 .cse9 .cse17 .cse11 .cse19 .cse18 .cse10 .cse12 .cse13)) (.cse6 (not .cse18)) (.cse7 (not .cse17)) (.cse15 (not (= |old(~m_pc~0)| 0))) (.cse8 (and (<= 2 ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse17 .cse18 .cse19 .cse11 .cse10 .cse12 .cse13 (= |old(~t1_st~0)| ~t1_st~0)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 (= |old(~m_st~0)| 0) .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse2 |old(~token~0)|)))) (or (and (= ~m_st~0 1) .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse14 .cse4 .cse6 .cse7 .cse15) (or .cse0 .cse1 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8)))) [2021-02-22 02:29:33,889 INFO L185 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse5 (= ~m_pc~0 0)) (.cse10 (not (= |old(~m_pc~0)| 0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 (and (= ~m_st~0 1) .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse1 .cse7 .cse8 (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6) .cse9 .cse10) (let ((.cse14 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse11 .cse0 (not (<= |old(~token~0)| .cse14)) .cse12 (= |old(~m_st~0)| 0) (and .cse13 .cse2 .cse3 (= ~m_pc~0 1) .cse4 .cse6) .cse7 .cse8 .cse9 (not (<= .cse14 |old(~token~0)|)))))) [2021-02-22 02:29:33,890 INFO L185 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (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))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-22 02:29:33,890 INFO L185 CegarLoopUtils]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (not (= ~M_E~0 2))) (.cse3 (not (= |old(~m_st~0)| 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not (= ~t1_i~0 1))) (.cse10 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (let ((.cse12 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse12)) .cse2 (= |old(~m_st~0)| 0) .cse4 (and .cse6 .cse7 (= ~m_pc~0 1) .cse9) .cse5 .cse10 (not (<= .cse12 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 (and (= ~m_st~0 1) .cse7 .cse8 .cse9) .cse5 .cse10 .cse11))) [2021-02-22 02:29:33,890 INFO L185 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (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))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-22 02:29:33,890 INFO L185 CegarLoopUtils]: At program point L40(lines 35 74) the Hoare annotation is: (let ((.cse6 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse5 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse6 .cse0 (not (<= |old(~token~0)| .cse7)) .cse8 (= |old(~m_st~0)| 0) .cse2 .cse3 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~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))) .cse4 (not (<= .cse7 |old(~token~0)|)))) (or .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-02-22 02:29:33,890 INFO L185 CegarLoopUtils]: At program point L69(lines 32 75) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (= ~m_pc~0 1)) (.cse20 (= ~t1_i~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~M_E~0 2)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse12 (not .cse17)) (.cse0 (not .cse19)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and (<= 2 ~t1_st~0) .cse5 .cse17 .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse20)) (.cse4 (not .cse18)) (.cse15 (and .cse5 .cse17 (= ~t1_st~0 0) .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15) (let ((.cse16 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse12 .cse0 (not (<= |old(~token~0)| .cse16)) .cse13 .cse14 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 (not (<= .cse16 |old(~token~0)|)) .cse15))))) [2021-02-22 02:29:33,891 INFO L185 CegarLoopUtils]: At program point L63(line 63) the Hoare annotation is: (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse5 (not (= |old(~m_pc~0)| 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse6 .cse0 (not (<= |old(~token~0)| .cse8)) .cse7 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 (not (<= .cse8 |old(~token~0)|)))))) [2021-02-22 02:29:33,891 INFO L185 CegarLoopUtils]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (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))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 (= |old(~m_st~0)| 0) .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-22 02:29:33,891 INFO L185 CegarLoopUtils]: At program point L55(line 55) the Hoare annotation is: (let ((.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~t1_i~0 1)) (.cse10 (= ~M_E~0 2)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_st~0)| 1))) (.cse16 (not (= |old(~m_pc~0)| 0))) (.cse0 (not .cse5)) (.cse1 (not .cse10)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~t1_st~0 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (<= ~token~0 ~local~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (not .cse8)) (.cse15 (not .cse7))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 (and .cse17 .cse9 .cse11 .cse12 .cse13 .cse18)) (or (not (= |old(~t1_st~0)| 0)) .cse1 (and (= ~m_st~0 1) .cse6 .cse9 .cse11 .cse12 .cse13) (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse14 .cse15 .cse16) (let ((.cse19 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse19)) .cse2 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |old(~m_st~0)| 0) .cse4 (and .cse17 .cse9 .cse11 .cse12 .cse18) .cse14 .cse15 (not (<= .cse19 |old(~token~0)|))))))) [2021-02-22 02:29:33,891 INFO L185 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse0 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse11 (= ~m_pc~0 0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse1 (not (= ~M_E~0 2))) (.cse12 (not (= |old(~m_st~0)| 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse10 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (= |old(~m_pc~0)| 0)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 (= |old(~m_st~0)| 0) .cse4 .cse5 (and .cse6 .cse7 (= ~m_pc~0 1) .cse8 .cse9) .cse10 (not (<= .cse2 |old(~token~0)|)))) (or (and .cse6 .cse7 .cse8 .cse11 .cse9) .cse0 .cse1 .cse3 .cse12 .cse4 .cse5 .cse10 .cse13) (or (and (= ~m_st~0 1) .cse7 .cse8 .cse11 .cse9) (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse12 .cse4 .cse5 .cse10 .cse13))) [2021-02-22 02:29:33,891 INFO L185 CegarLoopUtils]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (not (= ~E_1~0 1))) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (not (= |old(~m_st~0)| 1))) (.cse10 (= ~t1_st~0 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse14 (= ~m_pc~0 0)) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse12 (not (= ~E_M~0 ~M_E~0))) (.cse15 (not (= |old(~m_pc~0)| 0)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) (= |old(~m_st~0)| 0) .cse9 (and .cse10 .cse6 .cse7) .cse11 .cse12 (not (<= .cse2 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse13 (and (= ~m_st~0 1) .cse10 .cse6 .cse7 .cse14) .cse9 .cse11 .cse12 .cse15) (or .cse0 .cse1 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse14 .cse8) .cse13 (and .cse10 .cse6 .cse7 .cse14) .cse9 .cse11 .cse12 .cse15))) [2021-02-22 02:29:33,892 INFO L185 CegarLoopUtils]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (not (= ~M_E~0 2))) (.cse3 (not (= |old(~m_st~0)| 1))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not (= ~t1_i~0 1))) (.cse10 (not (= ~E_M~0 ~M_E~0))) (.cse11 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (let ((.cse12 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse12)) .cse2 (= |old(~m_st~0)| 0) .cse4 (and .cse6 .cse7 (= ~m_pc~0 1) .cse9) .cse5 .cse10 (not (<= .cse12 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 (and (= ~m_st~0 1) .cse7 .cse8 .cse9) .cse5 .cse10 .cse11))) [2021-02-22 02:29:33,892 INFO L185 CegarLoopUtils]: At program point masterENTRY(lines 32 75) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0))) (let ((.cse1 (not (= |old(~m_st~0)| 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse6 (not (= |old(~m_pc~0)| 0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse9)) .cse8 (= |old(~m_st~0)| 0) .cse2 .cse3 (let ((.cse10 (+ ~local~0 1))) (and (<= .cse10 ~token~0) (<= ~token~0 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15)) .cse5 (not (<= .cse9 |old(~token~0)|))))))) [2021-02-22 02:29:33,892 INFO L185 CegarLoopUtils]: At program point L39(lines 39 43) the Hoare annotation is: (let ((.cse6 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= |old(~m_st~0)| 1))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse5 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse6 .cse0 (not (<= |old(~token~0)| .cse7)) .cse8 (= |old(~m_st~0)| 0) .cse2 .cse3 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~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))) .cse4 (not (<= .cse7 |old(~token~0)|)))) (or .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-02-22 02:29:33,892 INFO L185 CegarLoopUtils]: At program point fire_time_eventsEXIT(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (= ~M_E~0 1)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2021-02-22 02:29:33,892 INFO L185 CegarLoopUtils]: At program point fire_time_eventsENTRY(lines 339 347) the Hoare annotation is: (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse6 (= ~M_E~0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse4 .cse6))) [2021-02-22 02:29:33,893 INFO L185 CegarLoopUtils]: At program point fire_time_eventsFINAL(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (= ~M_E~0 1)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2021-02-22 02:29:33,893 INFO L185 CegarLoopUtils]: At program point L3-2(line 3) 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)|)) [2021-02-22 02:29:33,893 INFO L185 CegarLoopUtils]: At program point L3-3(line 3) 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)|)) [2021-02-22 02:29:33,893 INFO L185 CegarLoopUtils]: At program point L-1(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)|)) [2021-02-22 02:29:33,893 INFO L185 CegarLoopUtils]: At program point L3-4(line 3) 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)|)) [2021-02-22 02:29:33,893 INFO L185 CegarLoopUtils]: At program point L31(line 31) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2021-02-22 02:29:33,893 INFO L185 CegarLoopUtils]: At program point L-1-1(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)|)) [2021-02-22 02:29:33,893 INFO L185 CegarLoopUtils]: At program point L3-5(line 3) 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)|)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: (and (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (and (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L22(line 22) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (and (= ~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) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,894 INFO L185 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: (and (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2021-02-22 02:29:33,895 INFO L185 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: (and (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) [2021-02-22 02:29:33,895 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= ~E_M~0 |old(~E_M~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~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)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~m_i~0 |old(~m_i~0)|)) [2021-02-22 02:29:33,895 INFO L185 CegarLoopUtils]: At program point L3(line 3) 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)|)) [2021-02-22 02:29:33,895 INFO L185 CegarLoopUtils]: At program point L3-1(line 3) 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)|)) [2021-02-22 02:29:33,895 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2021-02-22 02:29:33,895 INFO L185 CegarLoopUtils]: At program point stop_simulationFINAL(lines 386 404) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (< 0 (+ stop_simulation_~tmp~2 1)) (<= 1 stop_simulation_~__retres2~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,895 INFO L185 CegarLoopUtils]: At program point L401(lines 390 403) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (and (<= stop_simulation_~tmp~2 0) (< 0 (+ stop_simulation_~tmp~2 1)) (<= 1 stop_simulation_~__retres2~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,896 INFO L185 CegarLoopUtils]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse5 (and (<= stop_simulation_~tmp~2 0) (< 0 (+ stop_simulation_~tmp~2 1)))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9))) [2021-02-22 02:29:33,896 INFO L185 CegarLoopUtils]: At program point L395(line 395) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,896 INFO L185 CegarLoopUtils]: At program point L394(lines 394 399) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (and (<= stop_simulation_~tmp~2 0) (< 0 (+ stop_simulation_~tmp~2 1))) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,896 INFO L192 CegarLoopUtils]: At program point L392(line 392) the Hoare annotation is: true [2021-02-22 02:29:33,896 INFO L185 CegarLoopUtils]: At program point L392-1(line 392) the Hoare annotation is: (or (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,896 INFO L185 CegarLoopUtils]: At program point L392-2(line 392) the Hoare annotation is: (or (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,896 INFO L185 CegarLoopUtils]: At program point stop_simulationEXIT(lines 386 404) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (< 0 (+ stop_simulation_~tmp~2 1)) (<= 1 stop_simulation_~__retres2~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,896 INFO L185 CegarLoopUtils]: At program point L392-3(line 392) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (and (<= stop_simulation_~tmp~2 0) (< 0 (+ stop_simulation_~tmp~2 1)) (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2021-02-22 02:29:33,897 INFO L192 CegarLoopUtils]: At program point L388(line 388) the Hoare annotation is: true [2021-02-22 02:29:33,897 INFO L192 CegarLoopUtils]: At program point stop_simulationENTRY(lines 386 404) the Hoare annotation is: true [2021-02-22 02:29:33,897 INFO L185 CegarLoopUtils]: At program point L217(line 217) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse11 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse3 (not (= eval_~tmp~0 0)))) (let ((.cse13 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse7 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse14 (let ((.cse16 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse16) (<= .cse16 ~token~0) .cse11 .cse2 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse3))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= |old(~token~0)| ~token~0))) (or .cse0 (and (= ~local~0 |old(~local~0)|) .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 (= |old(~t1_st~0)| ~t1_st~0) .cse6) .cse7 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse8 .cse9 (and .cse1 (or (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse10 .cse11 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse4 .cse5)) (and .cse10 .cse11 .cse4 .cse5 .cse6)) .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse13 .cse14)) (or .cse9 .cse13 .cse15) (or (not (= |old(~m_pc~0)| 1)) .cse0 (= |old(~E_M~0)| 1) .cse7 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse8 .cse9 .cse14 .cse15)))) [2021-02-22 02:29:33,897 INFO L185 CegarLoopUtils]: At program point L213(line 213) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-22 02:29:33,898 INFO L185 CegarLoopUtils]: At program point L205(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse5 (not (= |eval_#t~ret8| 0))) (.cse15 (= ~t1_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse26 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse0 (and .cse23 .cse14 .cse24 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse2 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse13 (and .cse14 .cse24 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse21 (not (<= 2 |old(~E_1~0)|))) (.cse22 (let ((.cse28 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse24 .cse5 .cse6 .cse17 .cse18 .cse25 .cse19))) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= ~t1_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse6 .cse7 .cse8 .cse9) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) .cse21 .cse22 (and .cse23 .cse24 .cse5 .cse4 .cse6 .cse25 .cse19 .cse26 .cse9))) (or .cse10 (and .cse14 .cse26) .cse11 .cse27) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse10 (and .cse2 .cse3 .cse24 .cse5 .cse4 .cse16 .cse17 .cse20 .cse8 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_pc~0)| 1)) .cse12 (= |old(~E_M~0)| 1) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse21 .cse22 .cse27)))) [2021-02-22 02:29:33,898 INFO L185 CegarLoopUtils]: At program point L205-1(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse5 (not (= |eval_#t~ret8| 0))) (.cse15 (= ~t1_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse26 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse0 (and .cse23 .cse14 .cse24 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse2 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse13 (and .cse14 .cse24 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse21 (not (<= 2 |old(~E_1~0)|))) (.cse22 (let ((.cse28 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse24 .cse5 .cse6 .cse17 .cse18 .cse25 .cse19))) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= ~t1_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse6 .cse7 .cse8 .cse9) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) .cse21 .cse22 (and .cse23 .cse24 .cse5 .cse4 .cse6 .cse25 .cse19 .cse26 .cse9))) (or .cse10 (and .cse14 .cse26) .cse11 .cse27) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse10 (and .cse2 .cse3 .cse24 .cse5 .cse4 .cse16 .cse17 .cse20 .cse8 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_pc~0)| 1)) .cse12 (= |old(~E_M~0)| 1) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse21 .cse22 .cse27)))) [2021-02-22 02:29:33,898 INFO L185 CegarLoopUtils]: At program point L205-2(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse3 (not (= |eval_#t~ret8| 0))) (.cse20 (= ~t1_st~0 0)) (.cse5 (not (= eval_~tmp~0 0))) (.cse26 (<= 2 ~t1_st~0)) (.cse17 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse21 (= ~E_M~0 ~M_E~0)) (.cse4 (<= ~token~0 ~local~0)) (.cse22 (= ~m_pc~0 1)) (.cse23 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (let ((.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse19 (not (= |old(~m_pc~0)| 0))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse12 (and .cse26 .cse17 .cse1 .cse21 .cse4 .cse22 .cse23 .cse6)) (.cse13 (and .cse17 .cse1 .cse3 .cse20 .cse21 .cse4 .cse22 .cse23 .cse5 .cse6)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (let ((.cse27 (+ ~local~0 1))) (and .cse26 (<= ~token~0 .cse27) (<= .cse27 ~token~0) .cse1 .cse3 .cse21 .cse22 .cse23 .cse25 .cse5))) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~m_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (and (or .cse0 (not (= |old(~t1_pc~0)| 1)) (and .cse1 (= ~m_st~0 |old(~m_st~0)|) .cse2 .cse3 (= ~m_pc~0 |old(~m_pc~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (not (= |old(~m_pc~0)| 1)) .cse11 (= |old(~E_M~0)| 1) .cse12 .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse14 .cse15 .cse16) (or .cse10 (and .cse17 .cse18) .cse19 .cse16) (let ((.cse24 (= ~t1_pc~0 0))) (or .cse0 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse19 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse17 .cse3 .cse20 .cse21 .cse4 .cse22 .cse23 .cse5 .cse24 .cse6) .cse14 .cse15 (and (= ~local~0 |old(~local~0)|) .cse3 .cse2 .cse5 .cse25 .cse24 .cse18 .cse7 .cse9 .cse8) (and .cse26 .cse1 .cse3 .cse2 .cse21 .cse25 .cse5 .cse18 .cse9)))))) [2021-02-22 02:29:33,898 INFO L185 CegarLoopUtils]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse7 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not (= eval_~tmp~0 0))) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse14 .cse1 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse20 (let ((.cse24 (+ ~local~0 1))) (and .cse14 (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse15 .cse8 .cse10 .cse11 .cse17 .cse12))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (and .cse1 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_pc~0 0) .cse13) (and .cse14 .cse15 .cse16 .cse8 .cse17 .cse12 .cse2 .cse18) (and (= ~local~0 |old(~local~0)|) .cse16 .cse19 .cse8 .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18) .cse0 .cse3 .cse20 .cse21 .cse22 (not (= |old(~t1_pc~0)| 0)) .cse23) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse20 (not (= |old(~m_pc~0)| 1)) (and .cse15 (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse7 .cse19 .cse9 .cse13 (= ~E_M~0 |old(~E_M~0)|) .cse18) .cse21 (= |old(~E_M~0)| 1) .cse22 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse23 .cse4)))) [2021-02-22 02:29:33,899 INFO L185 CegarLoopUtils]: At program point evalEXIT(lines 196 246) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse5 (and (<= 2 ~t1_st~0) .cse1 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse2 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 (= ~m_pc~0 0)) .cse2 .cse3) (or (not (= |old(~m_pc~0)| 1)) .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse7 .cse0 .cse3) (or .cse4 .cse6 .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse7 .cse0 .cse2)))) [2021-02-22 02:29:33,899 INFO L185 CegarLoopUtils]: At program point L218(line 218) the Hoare annotation is: (let ((.cse24 (+ ~local~0 1))) (let ((.cse8 (<= 2 ~t1_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse10 (<= .cse24 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (= ~E_M~0 ~M_E~0)) (.cse13 (= ~m_pc~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (not (= eval_~tmp~0 0))) (.cse17 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= |old(~m_pc~0)| 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (= ~m_st~0 1)) (.cse18 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (= |old(~E_M~0)| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~m_st~0 0))) .cse16) (or .cse7 .cse17 .cse16) (let ((.cse20 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (= ~m_pc~0 0)) (.cse23 (= |old(~token~0)| ~token~0))) (or .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse18 (and .cse19 .cse20 (or (let ((.cse21 (+ |old(~token~0)| 1))) (and .cse8 .cse11 (<= .cse21 ~token~0) (<= ~token~0 .cse21) .cse22)) (and .cse8 .cse11 .cse22 .cse23)) .cse15 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse6 (and .cse19 .cse20 (= ~t1_st~0 0) .cse12 .cse15 (= ~t1_pc~0 0) .cse22 .cse23) (and .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15) .cse7 .cse17)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse18 .cse5 .cse6 .cse7 .cse16)))) [2021-02-22 02:29:33,899 INFO L185 CegarLoopUtils]: At program point L214(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-22 02:29:33,899 INFO L185 CegarLoopUtils]: At program point L214-1(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-22 02:29:33,900 INFO L185 CegarLoopUtils]: At program point L214-2(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-22 02:29:33,900 INFO L185 CegarLoopUtils]: At program point L231(line 231) the Hoare annotation is: (let ((.cse6 (= ~t1_i~0 1))) (let ((.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse14 (not .cse6)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~t1_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse12 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse16 (not (= |old(~m_pc~0)| 0))) (.cse9 (not (= eval_~tmp~0 0))) (.cse11 (= ~E_M~0 |old(~E_M~0)|))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) .cse12) .cse13 .cse14 .cse15) (or (and .cse2 .cse4 (= ~m_pc~0 0)) .cse14 .cse16 .cse15) (let ((.cse17 (= ~t1_pc~0 0))) (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse2 .cse4 .cse5 .cse7 .cse12 .cse8 .cse9 .cse17 .cse10) .cse13 .cse14 (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse12 .cse8 .cse9 .cse10 .cse11) .cse16 (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)|) .cse9 .cse17 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= |old(~token~0)| ~token~0))))))) [2021-02-22 02:29:33,900 INFO L185 CegarLoopUtils]: At program point L227(line 227) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-22 02:29:33,900 INFO L185 CegarLoopUtils]: At program point evalENTRY(lines 196 246) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse7 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (= ~M_E~0 2))) (.cse1 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~token~0)| ~token~0)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse9 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (or (not (= |old(~m_pc~0)| 1)) .cse11 (and .cse2 .cse3 (= ~t1_st~0 0) .cse4 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse7 .cse8) (= |old(~E_M~0)| 1) .cse12 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse13 .cse0 .cse10) (or .cse11 .cse12 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse3 .cse4 (= ~E_M~0 ~M_E~0) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse6 .cse8) .cse13 .cse0 .cse9))) [2021-02-22 02:29:33,901 INFO L185 CegarLoopUtils]: At program point L215(lines 215 222) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2021-02-22 02:29:33,901 INFO L185 CegarLoopUtils]: At program point L207(lines 207 211) the Hoare annotation is: (let ((.cse13 (= ~t1_st~0 0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (<= 2 ~t1_st~0)) (.cse20 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~m_pc~0 1)) (.cse17 (<= 2 ~E_1~0)) (.cse8 (= ~m_st~0 0)) (.cse7 (not (= eval_~tmp~0 0)))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0)) (.cse21 (let ((.cse26 (+ ~local~0 1))) (and .cse19 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse20 .cse14 .cse16 .cse17 .cse8 .cse7))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse23 (and .cse19 .cse1 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18)) (.cse24 (and .cse1 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse9 (= ~t1_pc~0 0))) (or .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse9 .cse18) (and .cse19 .cse20 .cse6 .cse14 .cse8 .cse7 .cse2 .cse11) .cse0 .cse3 .cse21 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse20 (= ~m_st~0 |old(~m_st~0)|) .cse6 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse7 .cse18 .cse10 .cse12 .cse11) .cse21 (not (= |old(~m_pc~0)| 1)) .cse22 (= |old(~E_M~0)| 1) .cse23 .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2021-02-22 02:29:33,901 INFO L185 CegarLoopUtils]: At program point L207-1(lines 202 240) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse21 (= ~t1_pc~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse8 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse20 .cse1 .cse21 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse22 (let ((.cse26 (+ ~local~0 1))) (and .cse20 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse21 .cse15 .cse17 .cse18 .cse9 .cse8))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse1 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse10 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse10 .cse19) (and .cse20 .cse21 .cse7 .cse15 .cse9 .cse8 .cse2 .cse12) .cse0 .cse3 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse21 (= ~m_st~0 |old(~m_st~0)|) .cse7 (= ~m_pc~0 |old(~m_pc~0)|) .cse16 .cse8 .cse19 .cse11 .cse13 .cse12) .cse22 (not (= |old(~m_pc~0)| 1)) .cse23 (= |old(~E_M~0)| 1) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2021-02-22 02:29:33,901 INFO L185 CegarLoopUtils]: At program point L203(line 203) the Hoare annotation is: (let ((.cse7 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not (= eval_~tmp~0 0))) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse14 .cse1 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse20 (let ((.cse24 (+ ~local~0 1))) (and .cse14 (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse15 .cse8 .cse10 .cse11 .cse17 .cse12))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (and .cse1 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_pc~0 0) .cse13) (and .cse14 .cse15 .cse16 .cse8 .cse17 .cse12 .cse2 .cse18) (and (= ~local~0 |old(~local~0)|) .cse16 .cse19 .cse8 .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18) .cse0 .cse3 .cse20 .cse21 .cse22 (not (= |old(~t1_pc~0)| 0)) .cse23) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse20 (not (= |old(~m_pc~0)| 1)) (and .cse15 (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse7 .cse19 .cse9 .cse13 (= ~E_M~0 |old(~E_M~0)|) .cse18) .cse21 (= |old(~E_M~0)| 1) .cse22 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse23 .cse4)))) [2021-02-22 02:29:33,902 INFO L185 CegarLoopUtils]: At program point L232(line 232) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~m_st~0 0)) (.cse19 (= |old(~token~0)| ~token~0)) (.cse16 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (<= 2 ~m_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse12 (<= 2 ~E_1~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse13 (not (= eval_~tmp~0 0))) (.cse14 (<= ~local~0 ~token~0)) (.cse10 (= ~m_pc~0 1)) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse15 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14) .cse16 .cse0 (and .cse17 .cse8 .cse11 .cse18 .cse13 .cse15 .cse2 .cse19) (and .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse19) .cse3)) (let ((.cse20 (= ~E_M~0 |old(~E_M~0)|))) (or (not (= |old(~m_pc~0)| 1)) .cse5 .cse6 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse7 .cse17 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse20 .cse19) .cse16 .cse0 (and (or (and .cse1 .cse7 .cse9 .cse12 .cse11 .cse13 .cse14 .cse20) (and .cse1 .cse7 .cse8 .cse9 .cse12 .cse11 .cse13 .cse14)) .cse10) .cse4)))) [2021-02-22 02:29:33,902 INFO L185 CegarLoopUtils]: At program point L228(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-22 02:29:33,902 INFO L185 CegarLoopUtils]: At program point L228-1(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-22 02:29:33,903 INFO L185 CegarLoopUtils]: At program point L228-2(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-22 02:29:33,903 INFO L185 CegarLoopUtils]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse21 (= ~t1_pc~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse8 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse20 .cse1 .cse21 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse22 (let ((.cse26 (+ ~local~0 1))) (and .cse20 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse21 .cse15 .cse17 .cse18 .cse9 .cse8))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse1 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse10 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse10 .cse19) (and .cse20 .cse21 .cse7 .cse15 .cse9 .cse8 .cse2 .cse12) .cse0 .cse3 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse21 (= ~m_st~0 |old(~m_st~0)|) .cse7 (= ~m_pc~0 |old(~m_pc~0)|) .cse16 .cse8 .cse19 .cse11 .cse13 .cse12) .cse22 (not (= |old(~m_pc~0)| 1)) .cse23 (= |old(~E_M~0)| 1) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2021-02-22 02:29:33,903 INFO L185 CegarLoopUtils]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse5 (and (<= 2 ~t1_st~0) .cse1 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse2 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 (= ~m_pc~0 0)) .cse2 .cse3) (or (not (= |old(~m_pc~0)| 1)) .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse7 .cse0 .cse3) (or .cse4 .cse6 .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse7 .cse0 .cse2)))) [2021-02-22 02:29:33,903 INFO L185 CegarLoopUtils]: At program point L229(lines 229 236) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2021-02-22 02:29:33,903 INFO L185 CegarLoopUtils]: At program point fire_delta_eventsENTRY(lines 247 274) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse6 (and .cse1 .cse2 (= ~E_M~0 ~M_E~0) .cse3)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5) (or .cse0 .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse5 .cse8 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse4 (not (= ~t1_pc~0 1)) .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse5 .cse8 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse9 (not (<= ~local~0 ~token~0)))))) [2021-02-22 02:29:33,904 INFO L185 CegarLoopUtils]: At program point L256-1(lines 250 273) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4) (or .cse0 .cse1 .cse4 .cse5 (= ~M_E~0 2)) (or .cse0 (not (= ~t1_pc~0 0)) (and .cse2 (= ~M_E~0 |old(~M_E~0)|) .cse3) .cse6 .cse4 .cse5 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (and .cse2 (= ~E_M~0 ~M_E~0) .cse3) (not (<= ~token~0 ~local~0)) .cse6 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0))))) [2021-02-22 02:29:33,904 INFO L185 CegarLoopUtils]: At program point L252(line 252) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .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 .cse2) (or .cse0 .cse1 .cse2 .cse3) (or .cse0 (not (= ~t1_pc~0 0)) .cse4 .cse2 .cse3 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse4 .cse2 .cse3 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))))) [2021-02-22 02:29:33,904 INFO L185 CegarLoopUtils]: At program point L267(line 267) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse4 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) .cse2) (or .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse2 .cse4 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse3 .cse2 .cse4 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse4 (= ~M_E~0 2)))) [2021-02-22 02:29:33,904 INFO L185 CegarLoopUtils]: At program point L261-1(lines 250 273) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse4 (and .cse2 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse3 .cse6 (= ~M_E~0 2)) (or .cse0 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)))))) [2021-02-22 02:29:33,904 INFO L185 CegarLoopUtils]: At program point L257(line 257) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (and .cse2 .cse8 (= ~E_M~0 ~M_E~0) .cse9)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse6 (and .cse8 .cse9)) (or .cse1 (not (= ~t1_pc~0 1)) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0)))))) [2021-02-22 02:29:33,905 INFO L185 CegarLoopUtils]: At program point L251-1(lines 250 273) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (and .cse2 .cse8 (= ~E_M~0 ~M_E~0) .cse9)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse6 (and .cse8 .cse9)) (or .cse1 (not (= ~t1_pc~0 1)) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0)))))) [2021-02-22 02:29:33,905 INFO L185 CegarLoopUtils]: At program point fire_delta_eventsEXIT(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse6 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (not (= ~t1_pc~0 1)) (and .cse1 (= ~E_M~0 ~M_E~0) .cse2) (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse6 (not (<= ~local~0 ~token~0))) (or .cse7 .cse0 .cse4 .cse5 (= ~M_E~0 2)) (or .cse7 (not (= ~t1_pc~0 0)) (and .cse1 .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2021-02-22 02:29:33,905 INFO L185 CegarLoopUtils]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse6 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (not (= ~t1_pc~0 1)) (and .cse1 (= ~E_M~0 ~M_E~0) .cse2) (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse6 (not (<= ~local~0 ~token~0))) (or .cse7 .cse0 .cse4 .cse5 (= ~M_E~0 2)) (or .cse7 (not (= ~t1_pc~0 0)) (and .cse1 .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2021-02-22 02:29:33,905 INFO L185 CegarLoopUtils]: At program point L262(line 262) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse4 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse2 .cse4 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse3 .cse2 .cse4 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse4 (= ~M_E~0 2)))) [2021-02-22 02:29:33,905 INFO L192 CegarLoopUtils]: At program point update_channelsEXIT(lines 150 157) the Hoare annotation is: true [2021-02-22 02:29:33,905 INFO L192 CegarLoopUtils]: At program point update_channelsFINAL(lines 150 157) the Hoare annotation is: true [2021-02-22 02:29:33,905 INFO L185 CegarLoopUtils]: At program point L415(line 415) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 0)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0))) (or (and (<= 2 ~m_st~0) (= ~M_E~0 2) .cse0 .cse1) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and (= ~E_M~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)))) [2021-02-22 02:29:33,906 INFO L192 CegarLoopUtils]: At program point start_simulationEXIT(lines 405 463) the Hoare annotation is: true [2021-02-22 02:29:33,906 INFO L185 CegarLoopUtils]: At program point L407(line 407) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-22 02:29:33,906 INFO L185 CegarLoopUtils]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,906 INFO L185 CegarLoopUtils]: At program point L432-1(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,906 INFO L185 CegarLoopUtils]: At program point L428(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,906 INFO L185 CegarLoopUtils]: At program point L428-1(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,906 INFO L185 CegarLoopUtils]: At program point L424(line 424) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2021-02-22 02:29:33,907 INFO L185 CegarLoopUtils]: At program point L424-1(line 424) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,907 INFO L185 CegarLoopUtils]: At program point L420-1(lines 417 457) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2021-02-22 02:29:33,907 INFO L185 CegarLoopUtils]: At program point start_simulationENTRY(lines 405 463) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-22 02:29:33,907 INFO L185 CegarLoopUtils]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (= ~t1_st~0 0)) (.cse1 (= ~m_pc~0 0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and .cse0 (= ~E_M~0 ~M_E~0) (<= 2 ~E_1~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse1 (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (and (<= 2 ~m_st~0) .cse0 (= ~M_E~0 2) .cse1) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,907 INFO L185 CegarLoopUtils]: At program point L412(line 412) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-22 02:29:33,907 INFO L185 CegarLoopUtils]: 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 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-22 02:29:33,907 INFO L185 CegarLoopUtils]: At program point L408(line 408) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-22 02:29:33,908 INFO L185 CegarLoopUtils]: At program point L437(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,908 INFO L185 CegarLoopUtils]: At program point L437-1(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,908 INFO L185 CegarLoopUtils]: At program point L437-2(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,908 INFO L185 CegarLoopUtils]: At program point L433(line 433) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,908 INFO L192 CegarLoopUtils]: At program point L458(lines 405 463) the Hoare annotation is: true [2021-02-22 02:29:33,908 INFO L185 CegarLoopUtils]: At program point L421(line 421) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2021-02-22 02:29:33,908 INFO L185 CegarLoopUtils]: At program point L450(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-22 02:29:33,909 INFO L185 CegarLoopUtils]: At program point L450-1(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-22 02:29:33,909 INFO L185 CegarLoopUtils]: At program point L450-2(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (and (not (= start_simulation_~tmp___0~1 0)) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-22 02:29:33,909 INFO L185 CegarLoopUtils]: At program point L413(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-22 02:29:33,909 INFO L185 CegarLoopUtils]: At program point L413-1(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2021-02-22 02:29:33,909 INFO L185 CegarLoopUtils]: At program point L442(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-02-22 02:29:33,910 INFO L185 CegarLoopUtils]: At program point L442-1(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= ~M_E~0 1))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,910 INFO L185 CegarLoopUtils]: At program point L434(line 434) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,910 INFO L185 CegarLoopUtils]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~m_pc~0 0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 .cse4 (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse4 .cse3 (= ~E_M~0 |old(~E_M~0)|)))) [2021-02-22 02:29:33,910 INFO L185 CegarLoopUtils]: At program point L443(line 443) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= ~M_E~0 1))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,910 INFO L185 CegarLoopUtils]: At program point L439(lines 439 448) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2021-02-22 02:29:33,910 INFO L185 CegarLoopUtils]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-22 02:29:33,911 INFO L185 CegarLoopUtils]: At program point L452(lines 452 456) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and (not (= start_simulation_~tmp___0~1 0)) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-02-22 02:29:33,911 INFO L185 CegarLoopUtils]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse13 (= ~t1_st~0 0)) (.cse7 (= ~m_st~0 0))) (let ((.cse18 (= ~E_M~0 1)) (.cse21 (not (= ~M_E~0 1))) (.cse17 (not .cse7)) (.cse16 (not (<= 2 ~E_1~0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse20 (not .cse13)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse15 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (<= 2 ~m_st~0))) (.cse1 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse5 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (<= 1 is_master_triggered_~__retres1~0) (let ((.cse19 (+ ~local~0 1))) (let ((.cse11 (not (<= ~token~0 .cse19))) (.cse12 (not (<= .cse19 ~token~0))) (.cse14 (not .cse18))) (and (or .cse10 .cse2 .cse11 .cse3 .cse12 .cse13 .cse14 .cse5 .cse15 .cse16) (or .cse2 .cse11 .cse3 .cse12 .cse13 .cse14 .cse5 .cse15 .cse17 .cse16))))) (or .cse10 .cse2 .cse1 .cse18 .cse4 .cse5 .cse15 .cse20 .cse21 .cse9 .cse16) (or .cse10 .cse2 .cse1 .cse18 .cse4 .cse5 .cse15 .cse6 .cse21 .cse9 .cse16) (or .cse0 .cse1 .cse3 .cse22 .cse5 .cse20 .cse8 .cse17 .cse16) (or .cse0 .cse3 .cse1 .cse22 .cse4 (not (= ~m_st~0 1)) .cse5 .cse20 .cse8 .cse9) (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse5)))) [2021-02-22 02:29:33,911 INFO L185 CegarLoopUtils]: At program point L118(line 118) the Hoare annotation is: (let ((.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (= ~m_st~0 0)) (.cse2 (not (= ~M_E~0 2))) (.cse9 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse12 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= ~t1_st~0 0))) (.cse15 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse2 .cse9 .cse4 .cse10 .cse7 (not .cse6) .cse11) (or .cse12 .cse1 .cse13 .cse3 .cse4 .cse14 .cse5 .cse15 .cse8 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse2 .cse9 .cse3 (not (= ~m_st~0 1)) .cse4 .cse10 .cse7 .cse8) (or .cse0 .cse12 .cse4) (or .cse12 .cse1 .cse13 .cse3 .cse4 .cse14 .cse10 .cse15 .cse8 .cse11))) [2021-02-22 02:29:33,911 INFO L185 CegarLoopUtils]: At program point L117(lines 117 122) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse1 (not (= ~M_E~0 2))) (.cse7 (not (= ~t1_pc~0 0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_st~0 0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse3 (not (= ~t1_i~0 1)))) (and (or .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse2 .cse3 (not (<= 2 ~t1_st~0)) .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse3 .cse8 .cse5 (not .cse4) (not (<= 2 ~E_1~0))) (or .cse0 .cse1 .cse7 .cse2 (not (= ~m_st~0 1)) .cse3 .cse8 .cse5 .cse6) (or .cse0 (not (<= 2 ~m_st~0)) .cse3))) [2021-02-22 02:29:33,912 INFO L185 CegarLoopUtils]: At program point is_master_triggeredFINAL(lines 112 130) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0)) (.cse19 (= ~t1_st~0 0))) (let ((.cse8 (not (= ~M_E~0 1))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse3 (= ~E_M~0 1)) (.cse14 (not (= ~t1_pc~0 0))) (.cse7 (not .cse19)) (.cse21 (not .cse16)) (.cse10 (not (<= 2 ~E_1~0))) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse2 (and (<= 0 |is_master_triggered_#res|) (<= |is_master_triggered_#res| 0) (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse9 .cse10) (or .cse12 .cse0 .cse2 .cse5) (or .cse12 .cse13 .cse14 .cse2 .cse4 (not (= ~m_st~0 1)) .cse5 .cse7 .cse15 .cse9) (or .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse11 .cse16 .cse15 .cse9) (or (let ((.cse22 (+ ~local~0 1))) (let ((.cse17 (not (<= ~token~0 .cse22))) (.cse18 (not (<= .cse22 ~token~0))) (.cse20 (not .cse3))) (and (or .cse0 .cse1 .cse17 .cse13 .cse18 .cse19 .cse20 .cse5 .cse6 .cse10) (or .cse1 .cse17 .cse13 .cse18 .cse19 .cse20 .cse5 .cse6 .cse21 .cse10)))) (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0))) (or .cse12 .cse13 .cse14 .cse2 .cse5 .cse7 .cse15 .cse21 .cse10) (or .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse11 .cse16 .cse15 .cse9)))) [2021-02-22 02:29:33,912 INFO L192 CegarLoopUtils]: At program point L116(lines 116 125) the Hoare annotation is: true [2021-02-22 02:29:33,912 INFO L185 CegarLoopUtils]: At program point L116-2(lines 116 125) the Hoare annotation is: (let ((.cse9 (+ ~local~0 1))) (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (<= ~token~0 .cse9))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= .cse9 ~token~0))) (.cse4 (= ~t1_st~0 0)) (.cse5 (not (= ~E_M~0 1))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or (not (<= 2 ~m_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8)))) [2021-02-22 02:29:33,912 INFO L185 CegarLoopUtils]: At program point is_master_triggeredEXIT(lines 112 130) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0)) (.cse19 (= ~t1_st~0 0))) (let ((.cse8 (not (= ~M_E~0 1))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse3 (= ~E_M~0 1)) (.cse14 (not (= ~t1_pc~0 0))) (.cse7 (not .cse19)) (.cse21 (not .cse16)) (.cse10 (not (<= 2 ~E_1~0))) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse2 (and (<= 0 |is_master_triggered_#res|) (<= |is_master_triggered_#res| 0) (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse9 .cse10) (or .cse12 .cse0 .cse2 .cse5) (or .cse12 .cse13 .cse14 .cse2 .cse4 (not (= ~m_st~0 1)) .cse5 .cse7 .cse15 .cse9) (or .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse11 .cse16 .cse15 .cse9) (or (let ((.cse22 (+ ~local~0 1))) (let ((.cse17 (not (<= ~token~0 .cse22))) (.cse18 (not (<= .cse22 ~token~0))) (.cse20 (not .cse3))) (and (or .cse0 .cse1 .cse17 .cse13 .cse18 .cse19 .cse20 .cse5 .cse6 .cse10) (or .cse1 .cse17 .cse13 .cse18 .cse19 .cse20 .cse5 .cse6 .cse21 .cse10)))) (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0))) (or .cse12 .cse13 .cse14 .cse2 .cse5 .cse7 .cse15 .cse21 .cse10) (or .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse11 .cse16 .cse15 .cse9)))) [2021-02-22 02:29:33,912 INFO L192 CegarLoopUtils]: At program point is_master_triggeredENTRY(lines 112 130) the Hoare annotation is: true [2021-02-22 02:29:33,912 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-22 02:29:33,912 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2021-02-22 02:29:33,912 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-22 02:29:33,913 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-22 02:29:33,913 INFO L185 CegarLoopUtils]: At program point L353(line 353) the Hoare annotation is: (let ((.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))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2021-02-22 02:29:33,913 INFO L185 CegarLoopUtils]: At program point reset_time_eventsEXIT(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2021-02-22 02:29:33,913 INFO L185 CegarLoopUtils]: At program point L368(line 368) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8))) [2021-02-22 02:29:33,913 INFO L185 CegarLoopUtils]: At program point L362-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse3 (and .cse1 (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (= |old(~E_M~0)| 1)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse10) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (= ~t1_st~0 0)) .cse9 .cse10)))) [2021-02-22 02:29:33,914 INFO L185 CegarLoopUtils]: At program point L358(line 358) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) .cse2) .cse3 .cse4) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2021-02-22 02:29:33,914 INFO L185 CegarLoopUtils]: At program point L352-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) .cse2) .cse3 .cse4) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2021-02-22 02:29:33,914 INFO L185 CegarLoopUtils]: At program point reset_time_eventsENTRY(lines 348 375) the Hoare annotation is: (let ((.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))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2021-02-22 02:29:33,914 INFO L185 CegarLoopUtils]: At program point L367-1(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2021-02-22 02:29:33,914 INFO L185 CegarLoopUtils]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse1 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8))) [2021-02-22 02:29:33,915 INFO L185 CegarLoopUtils]: At program point L357-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse4 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse0 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 .cse2) .cse3) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2021-02-22 02:29:33,915 INFO L185 CegarLoopUtils]: At program point init_modelFINAL(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2021-02-22 02:29:33,915 INFO L185 CegarLoopUtils]: At program point L381(line 381) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2021-02-22 02:29:33,915 INFO L185 CegarLoopUtils]: At program point init_modelEXIT(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2021-02-22 02:29:33,915 INFO L185 CegarLoopUtils]: At program point init_modelENTRY(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2021-02-22 02:29:33,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.02 02:29:33 BoogieIcfgContainer [2021-02-22 02:29:33,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-22 02:29:34,000 INFO L168 Benchmark]: Toolchain (without parser) took 262573.35 ms. Allocated memory was 151.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 127.4 MB in the beginning and 700.8 MB in the end (delta: -573.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2021-02-22 02:29:34,001 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 125.4 MB in the end (delta: 436.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-02-22 02:29:34,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.23 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 113.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-02-22 02:29:34,001 INFO L168 Benchmark]: Boogie Preprocessor took 58.69 ms. Allocated memory is still 151.0 MB. Free memory was 113.4 MB in the beginning and 111.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-22 02:29:34,001 INFO L168 Benchmark]: RCFGBuilder took 782.00 ms. Allocated memory is still 151.0 MB. Free memory was 111.3 MB in the beginning and 73.9 MB in the end (delta: 37.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. [2021-02-22 02:29:34,001 INFO L168 Benchmark]: TraceAbstraction took 261262.41 ms. Allocated memory was 151.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 73.5 MB in the beginning and 700.8 MB in the end (delta: -627.3 MB). Peak memory consumption was 987.5 MB. Max. memory is 8.0 GB. [2021-02-22 02:29:34,002 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 125.4 MB in the end (delta: 436.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 444.23 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 113.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.69 ms. Allocated memory is still 151.0 MB. Free memory was 113.4 MB in the beginning and 111.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 782.00 ms. Allocated memory is still 151.0 MB. Free memory was 111.3 MB in the beginning and 73.9 MB in the end (delta: 37.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 261262.41 ms. Allocated memory was 151.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 73.5 MB in the beginning and 700.8 MB in the end (delta: -627.3 MB). Peak memory consumption was 987.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((((!(m_pc == 0) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc == 1)) || !(M_E == 2)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) && (1 <= __retres1 || ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1))))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc == 0)) || !(token <= local)) || !(m_st == 1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((!(m_pc == 0) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || !(t1_i == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) && (((((((((((__retres1 <= 0 && 0 <= __retres1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(t1_pc == 1) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && (((((((((((((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || ((((((((2 <= m_st && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && t1_pc == 0) && local <= token)) || (((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && E_M == M_E) && m_st == 0) && !(tmp == 0)) && m_pc == 0) && \old(token) == token)) || (((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && E_M == M_E) && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token)) || !(t1_i == 1)) || !(\old(m_pc) == 0)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) || !(\old(t1_st) == 0)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1)))) && (((((((((((((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(t1_i == 1)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) || !(\old(m_pc) == 1)) || ((((((((t1_pc == 1 && m_st == \old(m_st)) && E_1 == \old(E_1)) && t1_st == 0) && m_pc == \old(m_pc)) && token <= local) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(m_st))) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((!(m_pc == 0) || 2 <= m_st) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((2 <= t1_st && t1_pc == 1) && E_M == M_E) && m_st == 0) && \old(token) == token)) || !(2 <= E_1))) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((!(m_pc == 0) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(t1_i == 1)) || !(2 <= \old(m_st))) && (((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || ((((m_st == \old(m_st) && t1_pc == 1) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || (((((((t1_st == 0 && M_E == 2) && 2 <= E_1) && m_st == 0) && t1_pc == 0) && m_pc == 0) && \old(token) == token) && E_M == \old(E_M))) || !(\old(m_st) == 0)) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || (2 <= m_st && m_pc == 0)) || !(\old(E_M) == \old(M_E))) || !(\old(m_pc) == 0)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && !(E_M == 1)) && token <= local) && M_E == 2) && m_pc == 1) && 2 <= E_1) && local <= token) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && ((((((((((!(\old(m_pc) == 1) || !(\old(t1_st) == 0)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || ((tmp <= 0 && 0 < tmp + 1) && 1 <= __retres2)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) && ((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((local + 1 <= token && token <= local + 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token)))) && (((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) && ((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 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)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((!(t1_pc == 1) || !(M_E == 2)) || 1 <= __retres1) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || 1 <= __retres1) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((((!(m_pc == 0) || ((((E_M == M_E && m_st == 0) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == token)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((m_st == \old(m_st) && E_M == M_E) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((!(m_pc == 0) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (2 <= m_st && (t1_st == 0 || \old(t1_st) == t1_st)))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((t1_pc == 1 && \old(token) + 1 <= token) && (t1_st == 0 || \old(t1_st) == t1_st)) && token <= \old(token) + 1) && E_M == M_E) && m_st == 0)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || (((((2 <= m_st && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || ((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) || (((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token))) && (((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || ((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) || (((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) - ProcedureContractResult [Line: 76]: Procedure Contract for transmit1 Derived contract for procedure transmit1: (((((!(m_pc == 0) || 2 <= m_st) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((2 <= t1_st && t1_pc == 1) && E_M == M_E) && m_st == 0) && \old(token) == token)) || !(2 <= E_1))) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) - ProcedureContractResult [Line: 303]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: (((((((((((t1_st == 0 && m_st == 0) && 1 <= tmp) || ((m_st == 0 && \old(t1_st) == t1_st) && 1 <= tmp)) || ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)))) && ((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(E_M == M_E)) || (((tmp <= 0 && 0 < tmp + 1) && m_st == 0) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((((!(t1_pc == 1) || !(2 <= \old(t1_st))) || E_M == 1) || (((2 <= m_st && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && ((((!(m_pc == 0) || (((2 <= m_st && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st))) && ((((((((((2 <= m_st || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((!(\old(t1_st) == 0) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((((!(m_pc == 0) || ((((!(E_1 == 1) && t1_st == 0) && tmp <= 0) && 0 < tmp + 1) && !(m_st == 0))) || ((((m_st == \old(m_st) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) || ((((t1_st == 0 && tmp <= 0) && 1 <= tmp___0) && 0 < tmp + 1) && !(m_st == 0)))) && (((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(token <= local)) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st))) && (((((((((((((!(M_E == 2) || ((((m_st == \old(m_st) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || !(m_pc == 1)) || !(local <= token)) || (((!(E_1 == 1) && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_pc == 1)) || ((!(E_1 == 1) && t1_st == 0) && m_st == 0)) || !(2 <= \old(t1_st))) || !(token <= local)) || \old(m_st) == 0) || ((t1_st == 0 && m_st == 0) && 1 <= tmp___0)) || (((t1_st == 0 && tmp <= 0) && 1 <= tmp___0) && 0 < tmp + 1)) || !(E_M == M_E)) - ProcedureContractResult [Line: 328]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: ((((((t1_st == 0 && m_st == 0) || (m_st == 0 && \old(t1_st) == t1_st)) || ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)))) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || !(token <= local)) || \old(m_st) == 0) || (t1_st == 0 && !(m_st == 0))) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token))) && ((((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || t1_st == 0) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(token <= local)) || !(t1_i == 1)) || (m_st == 1 && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(local <= token))) && ((((!(m_pc == 0) || (2 <= m_st && t1_st == 0)) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(2 <= \old(m_st))) - ProcedureContractResult [Line: 176]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: ((((((((((((((!(2 <= m_st) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) && ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 <= __retres1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1)) - ProcedureContractResult [Line: 131]: Procedure Contract for is_transmit1_triggered Derived contract for procedure is_transmit1_triggered: (((((((((!(t1_pc == 1) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 275]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events: ((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(local <= token)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == 2)) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(E_M) == \old(M_E))) || !(local <= token))) && ((((!(m_pc == 0) || !(2 <= m_st)) || !(t1_i == 1)) || !(2 == \old(M_E))) || M_E == 2)) && ((((((((!(m_pc == 0) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) - ProcedureContractResult [Line: 158]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || (m_st == 0 && \old(t1_st) == t1_st)) || (2 <= m_st && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(2 <= E_1) - ProcedureContractResult [Line: 464]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for error Derived contract for procedure error: 1 - ProcedureContractResult [Line: 32]: Procedure Contract for master Derived contract for procedure master: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || (((((2 <= m_st && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || ((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_st) == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) || (((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token))) && (((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || ((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) || (((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) - ProcedureContractResult [Line: 339]: Procedure Contract for fire_time_events Derived contract for procedure fire_time_events: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || M_E == 1) || !(2 <= E_1)) && (((((((((!(2 <= m_st) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || M_E == 1) || !(2 <= E_1)) - ProcedureContractResult [Line: 196]: Procedure Contract for eval Derived contract for procedure eval: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && ((((((((((!(\old(m_pc) == 1) || !(\old(t1_st) == 0)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(m_pc) == 0)) - ProcedureContractResult [Line: 386]: Procedure Contract for stop_simulation Derived contract for procedure stop_simulation: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || (((tmp <= 0 && 1 <= \result) && 0 < tmp + 1) && 1 <= __retres2)) || !(local <= token)) || !(2 <= E_1) - ProcedureContractResult [Line: 150]: Procedure Contract for update_channels Derived contract for procedure update_channels: 1 - ProcedureContractResult [Line: 247]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events: (((((((((((!(2 <= m_st) || !(t1_pc == 1)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == \old(M_E))) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(E_M) == \old(M_E))) || !(local <= token)) && ((((!(m_pc == 0) || !(2 <= m_st)) || !(t1_i == 1)) || !(2 == \old(M_E))) || M_E == 2)) && ((((((((!(m_pc == 0) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) - ProcedureContractResult [Line: 405]: Procedure Contract for start_simulation Derived contract for procedure start_simulation: 1 - ProcedureContractResult [Line: 112]: Procedure Contract for is_master_triggered Derived contract for procedure is_master_triggered: ((((((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1)) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && (((!(m_pc == 0) || !(2 <= m_st)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1))) && (((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(m_st == 1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1))) || (1 <= \result && 1 <= __retres1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 348]: Procedure Contract for reset_time_events Derived contract for procedure reset_time_events: ((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(2 <= m_st)) || \old(E_M) == 1) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(\old(M_E) == 1)) && ((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(2 <= m_st)) || \old(E_M) == 1) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || !(\old(M_E) == 1)) - ProcedureContractResult [Line: 376]: Procedure Contract for init_model Derived contract for procedure init_model: (((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || t1_i == 1) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) || \old(t1_i) == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 98.0s, OverallIterations: 16, TraceHistogramMax: 8, AutomataDifference: 78.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 162.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4512 SDtfs, 27743 SDslu, 2679 SDs, 0 SdLazy, 30654 SolverSat, 9597 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1782 GetRequests, 1113 SyntacticMatches, 2 SemanticMatches, 667 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11282 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6220occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 9639 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 227 LocationsWithAnnotation, 42830 PreInvPairs, 45381 NumberOfFragments, 33304 HoareAnnotationTreeSize, 42830 FomulaSimplifications, 7363179199 FormulaSimplificationTreeSizeReduction, 37.9s HoareSimplificationTime, 227 FomulaSimplificationsInter, 3403011 FormulaSimplificationTreeSizeReductionInter, 123.9s 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...