./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:23:24,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:23:24,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:23:24,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:23:24,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:23:24,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:23:24,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:23:24,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:23:24,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:23:24,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:23:24,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:23:24,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:23:24,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:23:24,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:23:24,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:23:24,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:23:24,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:23:24,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:23:24,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:23:24,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:23:24,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:23:24,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:23:24,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:23:24,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:23:24,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:23:24,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:23:24,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:23:24,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:23:24,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:23:24,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:23:24,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:23:24,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:23:24,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:23:24,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:23:24,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:23:24,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:23:24,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:23:24,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:23:24,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:23:24,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:23:24,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:23:24,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-19 07:23:24,811 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:23:24,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:23:24,812 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:23:24,812 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:23:24,813 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:23:24,813 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:23:24,813 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:23:24,814 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:23:24,814 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:23:24,814 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:23:24,815 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:23:24,815 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:23:24,815 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:23:24,816 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:23:24,816 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:23:24,816 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:23:24,816 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:23:24,816 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:23:24,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:23:24,817 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:23:24,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:23:24,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:23:24,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:23:24,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:23:24,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:23:24,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:23:24,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:23:24,820 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 07:23:24,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:23:24,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:23:24,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:23:24,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:23:24,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:23:24,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:23:24,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:23:24,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:23:24,822 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:23:24,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:23:24,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:23:24,824 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:23:24,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:23:24,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:23:24,824 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:23:24,824 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2022-11-19 07:23:25,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:23:25,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:23:25,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:23:25,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:23:25,138 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:23:25,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-11-19 07:23:25,209 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/data/925c60b10/5a32297334924b73a34d2a6f9152085e/FLAG41b860c0b [2022-11-19 07:23:25,800 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:23:25,801 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-11-19 07:23:25,823 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/data/925c60b10/5a32297334924b73a34d2a6f9152085e/FLAG41b860c0b [2022-11-19 07:23:26,097 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/data/925c60b10/5a32297334924b73a34d2a6f9152085e [2022-11-19 07:23:26,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:23:26,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:23:26,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:23:26,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:23:26,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:23:26,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f40cc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26, skipping insertion in model container [2022-11-19 07:23:26,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:23:26,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:23:26,378 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-11-19 07:23:26,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:23:26,516 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:23:26,528 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-11-19 07:23:26,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:23:26,611 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:23:26,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26 WrapperNode [2022-11-19 07:23:26,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:23:26,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:23:26,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:23:26,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:23:26,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,678 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 854 [2022-11-19 07:23:26,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:23:26,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:23:26,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:23:26,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:23:26,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,743 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:23:26,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:23:26,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:23:26,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:23:26,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (1/1) ... [2022-11-19 07:23:26,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:23:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:23:26,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:23:26,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:23:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:23:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:23:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-19 07:23:26,833 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-19 07:23:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:23:26,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:23:26,928 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:23:26,930 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:23:27,810 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:23:27,987 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:23:27,987 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-11-19 07:23:27,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:23:27 BoogieIcfgContainer [2022-11-19 07:23:27,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:23:27,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:23:27,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:23:27,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:23:27,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:23:26" (1/3) ... [2022-11-19 07:23:28,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccdab6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:23:28, skipping insertion in model container [2022-11-19 07:23:28,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:26" (2/3) ... [2022-11-19 07:23:28,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccdab6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:23:28, skipping insertion in model container [2022-11-19 07:23:28,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:23:27" (3/3) ... [2022-11-19 07:23:28,002 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2022-11-19 07:23:28,022 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:23:28,022 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-19 07:23:28,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:23:28,104 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@58dbcbb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:23:28,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-19 07:23:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 224 states have (on average 1.7857142857142858) internal successors, (400), 237 states have internal predecessors, (400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:23:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:23:28,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:28,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:28,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1097034834, now seen corresponding path program 1 times [2022-11-19 07:23:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:28,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993030604] [2022-11-19 07:23:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:28,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:28,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993030604] [2022-11-19 07:23:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993030604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:28,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:28,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365062419] [2022-11-19 07:23:28,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:28,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:28,480 INFO L87 Difference]: Start difference. First operand has 239 states, 224 states have (on average 1.7857142857142858) internal successors, (400), 237 states have internal predecessors, (400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:29,080 INFO L93 Difference]: Finished difference Result 642 states and 1088 transitions. [2022-11-19 07:23:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:23:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:29,100 INFO L225 Difference]: With dead ends: 642 [2022-11-19 07:23:29,100 INFO L226 Difference]: Without dead ends: 389 [2022-11-19 07:23:29,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:29,107 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 221 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:29,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 579 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:23:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-19 07:23:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 381. [2022-11-19 07:23:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 373 states have (on average 1.522788203753351) internal successors, (568), 380 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 568 transitions. [2022-11-19 07:23:29,177 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 568 transitions. Word has length 15 [2022-11-19 07:23:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:29,178 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 568 transitions. [2022-11-19 07:23:29,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 568 transitions. [2022-11-19 07:23:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:23:29,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:29,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:29,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:23:29,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1118601284, now seen corresponding path program 1 times [2022-11-19 07:23:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:29,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291935104] [2022-11-19 07:23:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:29,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:29,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291935104] [2022-11-19 07:23:29,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291935104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:29,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:29,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:29,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243808192] [2022-11-19 07:23:29,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:29,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:29,281 INFO L87 Difference]: Start difference. First operand 381 states and 568 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:29,502 INFO L93 Difference]: Finished difference Result 1047 states and 1583 transitions. [2022-11-19 07:23:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:29,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:23:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:29,506 INFO L225 Difference]: With dead ends: 1047 [2022-11-19 07:23:29,506 INFO L226 Difference]: Without dead ends: 676 [2022-11-19 07:23:29,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:29,509 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 323 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:29,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 853 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:23:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-19 07:23:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 601. [2022-11-19 07:23:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.4974704890387858) internal successors, (888), 600 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 888 transitions. [2022-11-19 07:23:29,553 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 888 transitions. Word has length 19 [2022-11-19 07:23:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:29,554 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 888 transitions. [2022-11-19 07:23:29,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 888 transitions. [2022-11-19 07:23:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 07:23:29,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:29,557 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:29,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:23:29,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -20601460, now seen corresponding path program 1 times [2022-11-19 07:23:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:29,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482437009] [2022-11-19 07:23:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:29,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:29,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482437009] [2022-11-19 07:23:29,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482437009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:29,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:29,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324275387] [2022-11-19 07:23:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:29,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:29,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:29,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:29,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:29,690 INFO L87 Difference]: Start difference. First operand 601 states and 888 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:30,318 INFO L93 Difference]: Finished difference Result 1657 states and 2508 transitions. [2022-11-19 07:23:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:23:30,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-19 07:23:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:30,325 INFO L225 Difference]: With dead ends: 1657 [2022-11-19 07:23:30,326 INFO L226 Difference]: Without dead ends: 1066 [2022-11-19 07:23:30,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:30,334 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 928 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:30,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1086 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:23:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-11-19 07:23:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 920. [2022-11-19 07:23:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 912 states have (on average 1.537280701754386) internal successors, (1402), 919 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1402 transitions. [2022-11-19 07:23:30,408 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1402 transitions. Word has length 48 [2022-11-19 07:23:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:30,408 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1402 transitions. [2022-11-19 07:23:30,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1402 transitions. [2022-11-19 07:23:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-19 07:23:30,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:30,420 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:30,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:23:30,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 828650942, now seen corresponding path program 1 times [2022-11-19 07:23:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:30,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80588316] [2022-11-19 07:23:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:30,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80588316] [2022-11-19 07:23:30,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80588316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:30,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:30,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:30,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021615790] [2022-11-19 07:23:30,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:30,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:30,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:30,565 INFO L87 Difference]: Start difference. First operand 920 states and 1402 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:30,989 INFO L93 Difference]: Finished difference Result 2311 states and 3529 transitions. [2022-11-19 07:23:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:23:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-19 07:23:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:30,996 INFO L225 Difference]: With dead ends: 2311 [2022-11-19 07:23:30,996 INFO L226 Difference]: Without dead ends: 1401 [2022-11-19 07:23:30,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:30,999 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 352 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:30,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1121 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2022-11-19 07:23:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1286. [2022-11-19 07:23:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1278 states have (on average 1.5391236306729263) internal successors, (1967), 1285 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1967 transitions. [2022-11-19 07:23:31,095 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1967 transitions. Word has length 51 [2022-11-19 07:23:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:31,096 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1967 transitions. [2022-11-19 07:23:31,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1967 transitions. [2022-11-19 07:23:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-19 07:23:31,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:31,100 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:31,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:23:31,101 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2039643689, now seen corresponding path program 1 times [2022-11-19 07:23:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:31,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425283969] [2022-11-19 07:23:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:23:31,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:31,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425283969] [2022-11-19 07:23:31,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425283969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:31,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:31,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:31,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861186462] [2022-11-19 07:23:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:31,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:31,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:31,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:31,291 INFO L87 Difference]: Start difference. First operand 1286 states and 1967 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:31,934 INFO L93 Difference]: Finished difference Result 4049 states and 6081 transitions. [2022-11-19 07:23:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:23:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-19 07:23:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:31,947 INFO L225 Difference]: With dead ends: 4049 [2022-11-19 07:23:31,950 INFO L226 Difference]: Without dead ends: 2771 [2022-11-19 07:23:31,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:31,956 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 544 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:31,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 831 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:23:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2022-11-19 07:23:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2468. [2022-11-19 07:23:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2460 states have (on average 1.5089430894308944) internal successors, (3712), 2467 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3712 transitions. [2022-11-19 07:23:32,159 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3712 transitions. Word has length 63 [2022-11-19 07:23:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:32,167 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 3712 transitions. [2022-11-19 07:23:32,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3712 transitions. [2022-11-19 07:23:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-19 07:23:32,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:32,172 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:32,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:23:32,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1167486893, now seen corresponding path program 1 times [2022-11-19 07:23:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:32,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279556929] [2022-11-19 07:23:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:32,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:32,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279556929] [2022-11-19 07:23:32,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279556929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:32,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:32,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:23:32,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464436963] [2022-11-19 07:23:32,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:32,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:32,315 INFO L87 Difference]: Start difference. First operand 2468 states and 3712 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:32,920 INFO L93 Difference]: Finished difference Result 5448 states and 8252 transitions. [2022-11-19 07:23:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:23:32,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-19 07:23:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:32,932 INFO L225 Difference]: With dead ends: 5448 [2022-11-19 07:23:32,932 INFO L226 Difference]: Without dead ends: 2774 [2022-11-19 07:23:32,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:32,940 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 552 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:32,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 789 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-11-19 07:23:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2469. [2022-11-19 07:23:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2461 states have (on average 1.5160503860219423) internal successors, (3731), 2468 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3731 transitions. [2022-11-19 07:23:33,122 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3731 transitions. Word has length 63 [2022-11-19 07:23:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:33,123 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 3731 transitions. [2022-11-19 07:23:33,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3731 transitions. [2022-11-19 07:23:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-19 07:23:33,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:33,125 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:33,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:23:33,125 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:33,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -396856952, now seen corresponding path program 1 times [2022-11-19 07:23:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:33,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956346072] [2022-11-19 07:23:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:33,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:33,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956346072] [2022-11-19 07:23:33,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956346072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:33,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:33,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719448615] [2022-11-19 07:23:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:33,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:33,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:33,172 INFO L87 Difference]: Start difference. First operand 2469 states and 3731 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:33,536 INFO L93 Difference]: Finished difference Result 5654 states and 8644 transitions. [2022-11-19 07:23:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:33,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-19 07:23:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:33,553 INFO L225 Difference]: With dead ends: 5654 [2022-11-19 07:23:33,553 INFO L226 Difference]: Without dead ends: 3195 [2022-11-19 07:23:33,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:33,562 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 292 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:33,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 507 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2022-11-19 07:23:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2881. [2022-11-19 07:23:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 2873 states have (on average 1.5391576749042812) internal successors, (4422), 2880 states have internal predecessors, (4422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4422 transitions. [2022-11-19 07:23:33,813 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4422 transitions. Word has length 63 [2022-11-19 07:23:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:33,814 INFO L495 AbstractCegarLoop]: Abstraction has 2881 states and 4422 transitions. [2022-11-19 07:23:33,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4422 transitions. [2022-11-19 07:23:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-19 07:23:33,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:33,818 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:33,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:23:33,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:33,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1892192728, now seen corresponding path program 1 times [2022-11-19 07:23:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:33,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054634742] [2022-11-19 07:23:33,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:33,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:33,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:33,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054634742] [2022-11-19 07:23:33,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054634742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:33,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:33,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970653926] [2022-11-19 07:23:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:33,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:33,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:33,919 INFO L87 Difference]: Start difference. First operand 2881 states and 4422 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:34,305 INFO L93 Difference]: Finished difference Result 6310 states and 9674 transitions. [2022-11-19 07:23:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:34,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-19 07:23:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:34,320 INFO L225 Difference]: With dead ends: 6310 [2022-11-19 07:23:34,321 INFO L226 Difference]: Without dead ends: 3447 [2022-11-19 07:23:34,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:34,327 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 162 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:34,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 615 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2022-11-19 07:23:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3164. [2022-11-19 07:23:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3164 states, 3156 states have (on average 1.5348542458808618) internal successors, (4844), 3163 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 4844 transitions. [2022-11-19 07:23:34,597 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 4844 transitions. Word has length 78 [2022-11-19 07:23:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:34,598 INFO L495 AbstractCegarLoop]: Abstraction has 3164 states and 4844 transitions. [2022-11-19 07:23:34,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 4844 transitions. [2022-11-19 07:23:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-19 07:23:34,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:34,603 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:34,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:23:34,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash -755069329, now seen corresponding path program 1 times [2022-11-19 07:23:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:34,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433883849] [2022-11-19 07:23:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:34,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:34,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433883849] [2022-11-19 07:23:34,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433883849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:34,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:34,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984590735] [2022-11-19 07:23:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:34,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:34,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:34,681 INFO L87 Difference]: Start difference. First operand 3164 states and 4844 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:35,411 INFO L93 Difference]: Finished difference Result 7467 states and 11425 transitions. [2022-11-19 07:23:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:35,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-11-19 07:23:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:35,430 INFO L225 Difference]: With dead ends: 7467 [2022-11-19 07:23:35,431 INFO L226 Difference]: Without dead ends: 4384 [2022-11-19 07:23:35,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:35,436 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 208 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:35,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 588 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-11-19 07:23:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3406. [2022-11-19 07:23:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3398 states have (on average 1.468510888758093) internal successors, (4990), 3405 states have internal predecessors, (4990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4990 transitions. [2022-11-19 07:23:35,815 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 4990 transitions. Word has length 88 [2022-11-19 07:23:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:35,816 INFO L495 AbstractCegarLoop]: Abstraction has 3406 states and 4990 transitions. [2022-11-19 07:23:35,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 4990 transitions. [2022-11-19 07:23:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-19 07:23:35,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:35,825 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-19 07:23:35,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:23:35,825 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:35,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1003143585, now seen corresponding path program 1 times [2022-11-19 07:23:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:35,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780050573] [2022-11-19 07:23:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:35,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:23:35,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:35,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780050573] [2022-11-19 07:23:35,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780050573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:35,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:35,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:23:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201170347] [2022-11-19 07:23:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:35,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:35,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:35,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:35,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:35,961 INFO L87 Difference]: Start difference. First operand 3406 states and 4990 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:36,695 INFO L93 Difference]: Finished difference Result 7015 states and 10275 transitions. [2022-11-19 07:23:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:23:36,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-11-19 07:23:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:36,709 INFO L225 Difference]: With dead ends: 7015 [2022-11-19 07:23:36,709 INFO L226 Difference]: Without dead ends: 3735 [2022-11-19 07:23:36,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:36,714 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 474 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:36,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 926 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-11-19 07:23:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3617. [2022-11-19 07:23:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3609 states have (on average 1.4630091438071489) internal successors, (5280), 3616 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5280 transitions. [2022-11-19 07:23:37,039 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5280 transitions. Word has length 95 [2022-11-19 07:23:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:37,039 INFO L495 AbstractCegarLoop]: Abstraction has 3617 states and 5280 transitions. [2022-11-19 07:23:37,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5280 transitions. [2022-11-19 07:23:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-19 07:23:37,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:37,042 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:37,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:23:37,043 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:37,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1950589719, now seen corresponding path program 1 times [2022-11-19 07:23:37,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:37,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332757242] [2022-11-19 07:23:37,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:37,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:37,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332757242] [2022-11-19 07:23:37,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332757242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:37,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:37,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:37,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785173500] [2022-11-19 07:23:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:37,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:37,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:37,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:37,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:37,119 INFO L87 Difference]: Start difference. First operand 3617 states and 5280 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:37,606 INFO L93 Difference]: Finished difference Result 7143 states and 10448 transitions. [2022-11-19 07:23:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:37,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-11-19 07:23:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:37,624 INFO L225 Difference]: With dead ends: 7143 [2022-11-19 07:23:37,624 INFO L226 Difference]: Without dead ends: 3617 [2022-11-19 07:23:37,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:37,632 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 277 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:37,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 326 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2022-11-19 07:23:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 3617. [2022-11-19 07:23:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3609 states have (on average 1.4505403158769743) internal successors, (5235), 3616 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5235 transitions. [2022-11-19 07:23:37,992 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5235 transitions. Word has length 96 [2022-11-19 07:23:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:37,992 INFO L495 AbstractCegarLoop]: Abstraction has 3617 states and 5235 transitions. [2022-11-19 07:23:37,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5235 transitions. [2022-11-19 07:23:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-19 07:23:37,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:37,995 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-19 07:23:37,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:23:37,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1424196516, now seen corresponding path program 1 times [2022-11-19 07:23:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:37,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092488405] [2022-11-19 07:23:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:23:38,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092488405] [2022-11-19 07:23:38,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092488405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:38,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:38,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:23:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184633087] [2022-11-19 07:23:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:38,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:38,072 INFO L87 Difference]: Start difference. First operand 3617 states and 5235 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:38,864 INFO L93 Difference]: Finished difference Result 8692 states and 12599 transitions. [2022-11-19 07:23:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:23:38,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-19 07:23:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:38,884 INFO L225 Difference]: With dead ends: 8692 [2022-11-19 07:23:38,884 INFO L226 Difference]: Without dead ends: 5085 [2022-11-19 07:23:38,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:38,892 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 339 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:38,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 950 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2022-11-19 07:23:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 4249. [2022-11-19 07:23:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 4241 states have (on average 1.441641122376798) internal successors, (6114), 4248 states have internal predecessors, (6114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 6114 transitions. [2022-11-19 07:23:39,246 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 6114 transitions. Word has length 98 [2022-11-19 07:23:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:39,247 INFO L495 AbstractCegarLoop]: Abstraction has 4249 states and 6114 transitions. [2022-11-19 07:23:39,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 6114 transitions. [2022-11-19 07:23:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-19 07:23:39,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:39,251 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:39,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:23:39,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash 284455504, now seen corresponding path program 1 times [2022-11-19 07:23:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:39,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876130782] [2022-11-19 07:23:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:39,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:39,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876130782] [2022-11-19 07:23:39,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876130782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:39,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:39,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:23:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416071478] [2022-11-19 07:23:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:39,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:23:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:39,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:23:39,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:39,349 INFO L87 Difference]: Start difference. First operand 4249 states and 6114 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:41,859 INFO L93 Difference]: Finished difference Result 22914 states and 33155 transitions. [2022-11-19 07:23:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:23:41,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-11-19 07:23:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:41,924 INFO L225 Difference]: With dead ends: 22914 [2022-11-19 07:23:41,924 INFO L226 Difference]: Without dead ends: 18768 [2022-11-19 07:23:41,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:23:41,936 INFO L413 NwaCegarLoop]: 877 mSDtfsCounter, 1467 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:41,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 2741 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:23:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18768 states. [2022-11-19 07:23:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18768 to 7352. [2022-11-19 07:23:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7352 states, 7344 states have (on average 1.4552015250544663) internal successors, (10687), 7351 states have internal predecessors, (10687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10687 transitions. [2022-11-19 07:23:42,690 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10687 transitions. Word has length 105 [2022-11-19 07:23:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:42,690 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10687 transitions. [2022-11-19 07:23:42,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10687 transitions. [2022-11-19 07:23:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-19 07:23:42,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:42,693 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:42,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:23:42,694 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1608185451, now seen corresponding path program 1 times [2022-11-19 07:23:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:42,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245922542] [2022-11-19 07:23:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:23:42,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245922542] [2022-11-19 07:23:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245922542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:42,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441538896] [2022-11-19 07:23:42,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:42,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:42,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:42,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:42,749 INFO L87 Difference]: Start difference. First operand 7352 states and 10687 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:43,663 INFO L93 Difference]: Finished difference Result 14609 states and 21254 transitions. [2022-11-19 07:23:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:43,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-11-19 07:23:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:43,684 INFO L225 Difference]: With dead ends: 14609 [2022-11-19 07:23:43,685 INFO L226 Difference]: Without dead ends: 7360 [2022-11-19 07:23:43,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:43,696 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 311 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:43,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 643 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2022-11-19 07:23:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 7352. [2022-11-19 07:23:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7352 states, 7344 states have (on average 1.4212962962962963) internal successors, (10438), 7351 states have internal predecessors, (10438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10438 transitions. [2022-11-19 07:23:44,629 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10438 transitions. Word has length 107 [2022-11-19 07:23:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:44,630 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10438 transitions. [2022-11-19 07:23:44,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10438 transitions. [2022-11-19 07:23:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-19 07:23:44,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:44,633 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:44,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:23:44,634 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:44,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 977811739, now seen corresponding path program 1 times [2022-11-19 07:23:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:44,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413200871] [2022-11-19 07:23:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:44,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:44,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413200871] [2022-11-19 07:23:44,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413200871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:23:44,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146203605] [2022-11-19 07:23:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:44,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:44,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:23:44,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:23:44,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:23:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:44,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:23:44,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:23:45,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146203605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:45,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:23:45,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-19 07:23:45,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093247358] [2022-11-19 07:23:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:45,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:45,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:45,155 INFO L87 Difference]: Start difference. First operand 7352 states and 10438 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:46,385 INFO L93 Difference]: Finished difference Result 14601 states and 20756 transitions. [2022-11-19 07:23:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-11-19 07:23:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:46,401 INFO L225 Difference]: With dead ends: 14601 [2022-11-19 07:23:46,401 INFO L226 Difference]: Without dead ends: 7352 [2022-11-19 07:23:46,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:46,415 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 237 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:46,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 340 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7352 states. [2022-11-19 07:23:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7352 to 7352. [2022-11-19 07:23:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7352 states, 7344 states have (on average 1.4098583877995643) internal successors, (10354), 7351 states have internal predecessors, (10354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10354 transitions. [2022-11-19 07:23:47,360 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10354 transitions. Word has length 107 [2022-11-19 07:23:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:47,361 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10354 transitions. [2022-11-19 07:23:47,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10354 transitions. [2022-11-19 07:23:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-19 07:23:47,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:47,365 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:47,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 07:23:47,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 07:23:47,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:47,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1371703008, now seen corresponding path program 1 times [2022-11-19 07:23:47,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:47,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793566020] [2022-11-19 07:23:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:23:47,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793566020] [2022-11-19 07:23:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793566020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:47,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:47,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474334023] [2022-11-19 07:23:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:47,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:47,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:47,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:47,724 INFO L87 Difference]: Start difference. First operand 7352 states and 10354 transitions. Second operand has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:49,679 INFO L93 Difference]: Finished difference Result 16362 states and 22995 transitions. [2022-11-19 07:23:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:23:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-11-19 07:23:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:49,722 INFO L225 Difference]: With dead ends: 16362 [2022-11-19 07:23:49,722 INFO L226 Difference]: Without dead ends: 16358 [2022-11-19 07:23:49,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:49,732 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 790 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:49,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1047 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:23:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16358 states. [2022-11-19 07:23:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 13656. [2022-11-19 07:23:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13656 states, 13648 states have (on average 1.4251172332942557) internal successors, (19450), 13655 states have internal predecessors, (19450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13656 states to 13656 states and 19450 transitions. [2022-11-19 07:23:51,418 INFO L78 Accepts]: Start accepts. Automaton has 13656 states and 19450 transitions. Word has length 109 [2022-11-19 07:23:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:51,419 INFO L495 AbstractCegarLoop]: Abstraction has 13656 states and 19450 transitions. [2022-11-19 07:23:51,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 13656 states and 19450 transitions. [2022-11-19 07:23:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 07:23:51,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:51,423 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:51,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:23:51,424 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -206319556, now seen corresponding path program 1 times [2022-11-19 07:23:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:51,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169392514] [2022-11-19 07:23:51,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:51,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:23:51,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:51,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169392514] [2022-11-19 07:23:51,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169392514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:23:51,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598281573] [2022-11-19 07:23:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:51,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:51,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:23:51,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:23:51,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:23:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:51,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:23:51,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:23:51,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:51,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598281573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:51,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:23:51,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-19 07:23:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541768440] [2022-11-19 07:23:51,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:51,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:51,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:51,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:51,801 INFO L87 Difference]: Start difference. First operand 13656 states and 19450 transitions. Second operand has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:54,390 INFO L93 Difference]: Finished difference Result 18155 states and 25723 transitions. [2022-11-19 07:23:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-11-19 07:23:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:54,422 INFO L225 Difference]: With dead ends: 18155 [2022-11-19 07:23:54,422 INFO L226 Difference]: Without dead ends: 18154 [2022-11-19 07:23:54,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:54,429 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 249 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:54,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 677 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18154 states. [2022-11-19 07:23:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18154 to 13655. [2022-11-19 07:23:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13655 states, 13648 states have (on average 1.4242379835873389) internal successors, (19438), 13654 states have internal predecessors, (19438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13655 states to 13655 states and 19438 transitions. [2022-11-19 07:23:55,868 INFO L78 Accepts]: Start accepts. Automaton has 13655 states and 19438 transitions. Word has length 113 [2022-11-19 07:23:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:55,868 INFO L495 AbstractCegarLoop]: Abstraction has 13655 states and 19438 transitions. [2022-11-19 07:23:55,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 13655 states and 19438 transitions. [2022-11-19 07:23:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-19 07:23:55,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:55,871 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:23:55,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-19 07:23:56,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 07:23:56,077 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:23:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2100938705, now seen corresponding path program 1 times [2022-11-19 07:23:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:56,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639862255] [2022-11-19 07:23:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:56,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:23:56,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:56,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639862255] [2022-11-19 07:23:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639862255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:23:56,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440471903] [2022-11-19 07:23:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:56,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:56,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:23:56,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:23:56,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:23:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:56,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:23:56,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 07:23:56,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:56,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440471903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:56,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:23:56,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-19 07:23:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509149502] [2022-11-19 07:23:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:56,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:56,426 INFO L87 Difference]: Start difference. First operand 13655 states and 19438 transitions. Second operand has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:59,025 INFO L93 Difference]: Finished difference Result 19846 states and 28217 transitions. [2022-11-19 07:23:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:59,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-11-19 07:23:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:59,064 INFO L225 Difference]: With dead ends: 19846 [2022-11-19 07:23:59,064 INFO L226 Difference]: Without dead ends: 19845 [2022-11-19 07:23:59,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:59,073 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 248 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:59,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 673 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19845 states. [2022-11-19 07:24:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19845 to 13654. [2022-11-19 07:24:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13654 states, 13648 states have (on average 1.4233587338804221) internal successors, (19426), 13653 states have internal predecessors, (19426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13654 states to 13654 states and 19426 transitions. [2022-11-19 07:24:01,437 INFO L78 Accepts]: Start accepts. Automaton has 13654 states and 19426 transitions. Word has length 114 [2022-11-19 07:24:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:01,438 INFO L495 AbstractCegarLoop]: Abstraction has 13654 states and 19426 transitions. [2022-11-19 07:24:01,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 13654 states and 19426 transitions. [2022-11-19 07:24:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-11-19 07:24:01,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:01,452 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:01,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:24:01,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 07:24:01,659 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:24:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2019096260, now seen corresponding path program 1 times [2022-11-19 07:24:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:01,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937526146] [2022-11-19 07:24:01,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:24:01,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:01,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937526146] [2022-11-19 07:24:01,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937526146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:01,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:01,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:01,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992371367] [2022-11-19 07:24:01,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:01,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:24:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:01,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:24:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:24:01,805 INFO L87 Difference]: Start difference. First operand 13654 states and 19426 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:02,715 INFO L93 Difference]: Finished difference Result 16602 states and 23507 transitions. [2022-11-19 07:24:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:24:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2022-11-19 07:24:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:02,720 INFO L225 Difference]: With dead ends: 16602 [2022-11-19 07:24:02,720 INFO L226 Difference]: Without dead ends: 3051 [2022-11-19 07:24:02,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:24:02,737 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 130 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:02,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 330 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2022-11-19 07:24:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2323. [2022-11-19 07:24:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2317 states have (on average 1.1890375485541649) internal successors, (2755), 2322 states have internal predecessors, (2755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 2755 transitions. [2022-11-19 07:24:03,166 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 2755 transitions. Word has length 192 [2022-11-19 07:24:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:03,166 INFO L495 AbstractCegarLoop]: Abstraction has 2323 states and 2755 transitions. [2022-11-19 07:24:03,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2755 transitions. [2022-11-19 07:24:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-11-19 07:24:03,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:03,173 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 2, 2, 2, 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] [2022-11-19 07:24:03,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 07:24:03,174 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:24:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1397049888, now seen corresponding path program 1 times [2022-11-19 07:24:03,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:03,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484750972] [2022-11-19 07:24:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:03,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 07:24:03,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:03,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484750972] [2022-11-19 07:24:03,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484750972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:24:03,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475612785] [2022-11-19 07:24:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:03,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:24:03,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:24:03,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:24:03,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:24:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:03,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:24:03,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 07:24:03,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:03,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475612785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:03,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:24:03,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-19 07:24:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40723123] [2022-11-19 07:24:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:03,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:03,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:03,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:03,952 INFO L87 Difference]: Start difference. First operand 2323 states and 2755 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:04,453 INFO L93 Difference]: Finished difference Result 3211 states and 3830 transitions. [2022-11-19 07:24:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:04,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2022-11-19 07:24:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:04,457 INFO L225 Difference]: With dead ends: 3211 [2022-11-19 07:24:04,457 INFO L226 Difference]: Without dead ends: 1462 [2022-11-19 07:24:04,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:24:04,461 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 391 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:04,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 433 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-11-19 07:24:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1176. [2022-11-19 07:24:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1174 states have (on average 1.1814310051107326) internal successors, (1387), 1175 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1387 transitions. [2022-11-19 07:24:04,711 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1387 transitions. Word has length 207 [2022-11-19 07:24:04,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:04,712 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1387 transitions. [2022-11-19 07:24:04,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1387 transitions. [2022-11-19 07:24:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-19 07:24:04,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:04,716 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1] [2022-11-19 07:24:04,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:24:04,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:24:04,923 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:24:04,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1623566563, now seen corresponding path program 1 times [2022-11-19 07:24:04,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:04,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099443554] [2022-11-19 07:24:04,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:24:05,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:05,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099443554] [2022-11-19 07:24:05,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099443554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:05,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:05,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:05,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037219913] [2022-11-19 07:24:05,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:05,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:05,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:05,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:05,089 INFO L87 Difference]: Start difference. First operand 1176 states and 1387 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:05,698 INFO L93 Difference]: Finished difference Result 2259 states and 2696 transitions. [2022-11-19 07:24:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:05,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-11-19 07:24:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:05,701 INFO L225 Difference]: With dead ends: 2259 [2022-11-19 07:24:05,701 INFO L226 Difference]: Without dead ends: 1835 [2022-11-19 07:24:05,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:24:05,704 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 448 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:05,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 856 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-11-19 07:24:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1164. [2022-11-19 07:24:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1162 states have (on average 1.1764199655765921) internal successors, (1367), 1163 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1367 transitions. [2022-11-19 07:24:05,878 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1367 transitions. Word has length 208 [2022-11-19 07:24:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:05,878 INFO L495 AbstractCegarLoop]: Abstraction has 1164 states and 1367 transitions. [2022-11-19 07:24:05,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1367 transitions. [2022-11-19 07:24:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-19 07:24:05,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:05,882 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:05,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 07:24:05,883 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:24:05,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1425418275, now seen corresponding path program 1 times [2022-11-19 07:24:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:05,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603864912] [2022-11-19 07:24:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 07:24:06,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:06,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603864912] [2022-11-19 07:24:06,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603864912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:06,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:06,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:06,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614024553] [2022-11-19 07:24:06,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:06,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:06,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:06,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:06,124 INFO L87 Difference]: Start difference. First operand 1164 states and 1367 transitions. Second operand has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:06,713 INFO L93 Difference]: Finished difference Result 1725 states and 2050 transitions. [2022-11-19 07:24:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:24:06,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2022-11-19 07:24:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:06,717 INFO L225 Difference]: With dead ends: 1725 [2022-11-19 07:24:06,717 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:24:06,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:24:06,720 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 478 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:06,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 558 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:24:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:24:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:24:06,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 209 [2022-11-19 07:24:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:06,723 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:24:06,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:24:06,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:24:06,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-19 07:24:06,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-19 07:24:06,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-19 07:24:06,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-19 07:24:06,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-19 07:24:06,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-19 07:24:06,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-19 07:24:06,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-19 07:24:06,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 07:24:06,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:24:21,801 WARN L233 SmtUtils]: Spent 14.85s on a formula simplification. DAG size of input: 240 DAG size of output: 233 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:25:09,738 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 216 DAG size of output: 182 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:25:33,803 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 963 DAG size of output: 835 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:26:26,789 WARN L233 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 835 DAG size of output: 68 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-19 07:26:29,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-11-19 07:26:29,336 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2022-11-19 07:26:29,336 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2022-11-19 07:26:29,336 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2022-11-19 07:26:29,336 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2022-11-19 07:26:29,337 INFO L895 garLoopResultBuilder]: At program point L763(lines 756 809) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,337 INFO L899 garLoopResultBuilder]: For program point L829-2(lines 829 835) no Hoare annotation was computed. [2022-11-19 07:26:29,337 INFO L899 garLoopResultBuilder]: For program point L829-3(lines 829 835) no Hoare annotation was computed. [2022-11-19 07:26:29,337 INFO L895 garLoopResultBuilder]: At program point L697(lines 690 725) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,338 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-11-19 07:26:29,338 INFO L895 garLoopResultBuilder]: At program point L1094(lines 1087 1104) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-11-19 07:26:29,338 INFO L895 garLoopResultBuilder]: At program point L1161(lines 1113 1166) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-11-19 07:26:29,339 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2022-11-19 07:26:29,339 INFO L902 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: true [2022-11-19 07:26:29,339 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2022-11-19 07:26:29,339 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2022-11-19 07:26:29,340 INFO L895 garLoopResultBuilder]: At program point L1294(lines 1287 1313) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-11-19 07:26:29,340 INFO L895 garLoopResultBuilder]: At program point L237(lines 230 265) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse8 (= ~m_run_pc~0 0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8) (and .cse0 (or (and .cse5 (= ~m_run_pc~0 3)) (and .cse5 .cse6 .cse8)) .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse7))) [2022-11-19 07:26:29,340 INFO L895 garLoopResultBuilder]: At program point L105(lines 105 129) the Hoare annotation is: (let ((.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse1 .cse8 .cse2 .cse10 .cse3 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7))) [2022-11-19 07:26:29,341 INFO L895 garLoopResultBuilder]: At program point L437(lines 430 456) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,341 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2022-11-19 07:26:29,341 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2022-11-19 07:26:29,341 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2022-11-19 07:26:29,341 INFO L895 garLoopResultBuilder]: At program point L174(lines 144 175) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~s_run_pc~0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-19 07:26:29,342 INFO L895 garLoopResultBuilder]: At program point L108(lines 108 128) the Hoare annotation is: (let ((.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse1 .cse8 .cse2 .cse10 .cse3 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7))) [2022-11-19 07:26:29,342 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2022-11-19 07:26:29,342 INFO L895 garLoopResultBuilder]: At program point L571(lines 564 617) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,342 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-11-19 07:26:29,342 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2022-11-19 07:26:29,343 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-11-19 07:26:29,343 INFO L895 garLoopResultBuilder]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) .cse4 (= ~c_empty_rsp~0 1) .cse5) (and .cse0 .cse1 .cse2 .cse3 (not (= ~c_empty_req~0 0)) .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse5))) [2022-11-19 07:26:29,343 INFO L895 garLoopResultBuilder]: At program point L771(lines 764 808) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,343 INFO L895 garLoopResultBuilder]: At program point L705(lines 698 724) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,344 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2022-11-19 07:26:29,344 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2022-11-19 07:26:29,344 INFO L895 garLoopResultBuilder]: At program point L111(lines 111 127) the Hoare annotation is: (let ((.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse1 .cse8 .cse2 .cse10 .cse3 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7))) [2022-11-19 07:26:29,344 INFO L895 garLoopResultBuilder]: At program point L904(lines 878 905) the Hoare annotation is: (let ((.cse2 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse0 (not (= ~c_m_lock~0 1))) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse4 (not (= ~c_empty_req~0 1))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~a_t~0 0)) (.cse3 (= ~req_tt_a~0 0))) (or (and .cse0 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse1 .cse2 (= ~c_req_type~0 1) .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse6) (and (= ~c_req_type~0 0) .cse2 (let ((.cse7 (= ~m_run_pc~0 6))) (or (and .cse1 .cse0 .cse4 .cse5 .cse7 .cse6) (and .cse1 .cse4 .cse5 .cse7 .cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)))) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3))) [2022-11-19 07:26:29,345 INFO L895 garLoopResultBuilder]: At program point L838(lines 85 844) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse7 (= ~m_run_pc~0 6)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse8 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse6 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse10 (not (= ~c_empty_req~0 0)) .cse4 .cse5 .cse7 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse8) (and .cse1 (= ~c_req_type~0 1) .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse6 .cse8 .cse9))) [2022-11-19 07:26:29,345 INFO L895 garLoopResultBuilder]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (not (= ~m_run_st~0 0))) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse4 (<= 0 ~a_t~0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-19 07:26:29,345 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2022-11-19 07:26:29,345 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2022-11-19 07:26:29,346 INFO L895 garLoopResultBuilder]: At program point L1302(lines 1295 1312) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-11-19 07:26:29,346 INFO L895 garLoopResultBuilder]: At program point L245(lines 238 264) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse8 (= ~m_run_pc~0 0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8) (and .cse0 (or (and .cse5 (= ~m_run_pc~0 3)) (and .cse5 .cse6 .cse8)) .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse7))) [2022-11-19 07:26:29,346 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2022-11-19 07:26:29,347 INFO L895 garLoopResultBuilder]: At program point L972(lines 965 982) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-11-19 07:26:29,347 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2022-11-19 07:26:29,347 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2022-11-19 07:26:29,347 INFO L895 garLoopResultBuilder]: At program point L114(lines 114 126) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~m_run_st~0 0))) (.cse5 (= ~m_run_pc~0 6)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_empty_rsp~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 0)) .cse3 .cse4 .cse5 .cse6))) [2022-11-19 07:26:29,347 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2022-11-19 07:26:29,348 INFO L895 garLoopResultBuilder]: At program point L445(lines 438 455) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,348 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2022-11-19 07:26:29,348 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2022-11-19 07:26:29,348 INFO L895 garLoopResultBuilder]: At program point L1040(lines 1033 1086) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-11-19 07:26:29,349 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2022-11-19 07:26:29,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-11-19 07:26:29,349 INFO L895 garLoopResultBuilder]: At program point L1107(lines 851 1112) the Hoare annotation is: (let ((.cse7 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (= ~req_tt_a~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~a_t~0 0)) (.cse4 (not (= ~c_empty_req~0 0))) (.cse9 (= 2 ~s_run_pc~0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse12 (not (= ~m_run_st~0 0))) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse8 .cse9 (= ~c_empty_req~0 1) .cse5 (= ~c_empty_rsp~0 1) .cse6 .cse10) (and .cse7 .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse11 (= ~m_run_pc~0 6))) (or (and .cse0 .cse2 .cse8 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse4 .cse5 .cse11 .cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))))) (and .cse8 .cse4 .cse12 .cse10) (and (not .cse9) .cse8 .cse12 .cse10))) [2022-11-19 07:26:29,349 INFO L895 garLoopResultBuilder]: At program point L579(lines 572 616) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,350 INFO L895 garLoopResultBuilder]: At program point L117(lines 117 125) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~m_run_st~0 0))) (.cse5 (= ~m_run_pc~0 6)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_empty_rsp~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 0)) .cse3 .cse4 .cse5 .cse6))) [2022-11-19 07:26:29,350 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2022-11-19 07:26:29,350 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2022-11-19 07:26:29,350 INFO L895 garLoopResultBuilder]: At program point L779(lines 772 807) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,351 INFO L895 garLoopResultBuilder]: At program point L713(lines 706 723) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,351 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2022-11-19 07:26:29,351 INFO L895 garLoopResultBuilder]: At program point L317(lines 287 318) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,351 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2022-11-19 07:26:29,351 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2022-11-19 07:26:29,351 INFO L895 garLoopResultBuilder]: At program point L1243(lines 1236 1253) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-11-19 07:26:29,352 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2022-11-19 07:26:29,352 INFO L895 garLoopResultBuilder]: At program point L120(lines 120 124) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~m_run_st~0 0))) (.cse5 (= ~m_run_pc~0 6)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_empty_rsp~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 0)) .cse3 .cse4 .cse5 .cse6))) [2022-11-19 07:26:29,352 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2022-11-19 07:26:29,352 INFO L895 garLoopResultBuilder]: At program point L385(lines 378 395) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,353 INFO L895 garLoopResultBuilder]: At program point L253(lines 246 263) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6) (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 (= ~m_run_pc~0 0)))) [2022-11-19 07:26:29,353 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2022-11-19 07:26:29,353 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2022-11-19 07:26:29,353 INFO L895 garLoopResultBuilder]: At program point L1048(lines 1041 1085) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-11-19 07:26:29,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:26:29,354 INFO L895 garLoopResultBuilder]: At program point L587(lines 580 615) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 3)) (and .cse0 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)))) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,354 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2022-11-19 07:26:29,354 INFO L895 garLoopResultBuilder]: At program point L918(lines 911 964) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-11-19 07:26:29,354 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2022-11-19 07:26:29,354 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2022-11-19 07:26:29,355 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2022-11-19 07:26:29,355 INFO L895 garLoopResultBuilder]: At program point L787(lines 780 806) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,355 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2022-11-19 07:26:29,355 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2022-11-19 07:26:29,355 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2022-11-19 07:26:29,356 INFO L895 garLoopResultBuilder]: At program point L524(lines 494 525) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,356 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-11-19 07:26:29,356 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2022-11-19 07:26:29,356 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2022-11-19 07:26:29,356 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2022-11-19 07:26:29,356 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-11-19 07:26:29,357 INFO L895 garLoopResultBuilder]: At program point L131(lines 101 843) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (not (= ~m_run_st~0 0))) (.cse8 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) .cse5 .cse6 .cse7 .cse8))) [2022-11-19 07:26:29,357 INFO L895 garLoopResultBuilder]: At program point L1056(lines 1049 1084) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-11-19 07:26:29,357 INFO L895 garLoopResultBuilder]: At program point L528-2(lines 528 556) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,357 INFO L895 garLoopResultBuilder]: At program point L1189(lines 1182 1235) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-11-19 07:26:29,358 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-11-19 07:26:29,358 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2022-11-19 07:26:29,358 INFO L895 garLoopResultBuilder]: At program point L595(lines 588 614) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 3)) (and .cse0 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)))) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,358 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2022-11-19 07:26:29,358 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2022-11-19 07:26:29,359 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2022-11-19 07:26:29,359 INFO L895 garLoopResultBuilder]: At program point L331(lines 324 377) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,359 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2022-11-19 07:26:29,359 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2022-11-19 07:26:29,359 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2022-11-19 07:26:29,359 INFO L895 garLoopResultBuilder]: At program point L926(lines 919 963) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-11-19 07:26:29,360 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2022-11-19 07:26:29,360 INFO L895 garLoopResultBuilder]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse4 (<= 0 ~a_t~0)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_run_pc~0 3) (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (and .cse7 .cse0 .cse1 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse7 .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 (= ~a_t~0 0) .cse9 .cse10))) [2022-11-19 07:26:29,360 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2022-11-19 07:26:29,360 INFO L895 garLoopResultBuilder]: At program point L795(lines 788 805) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,361 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2022-11-19 07:26:29,361 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2022-11-19 07:26:29,361 INFO L902 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: true [2022-11-19 07:26:29,361 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2022-11-19 07:26:29,361 INFO L895 garLoopResultBuilder]: At program point L1324(lines 1317 1334) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse11 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse14 (not (= ~c_m_lock~0 1))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse13 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8) (and .cse10 .cse0 .cse3 .cse11 .cse4 .cse6 .cse9 .cse12 .cse8 .cse13) (and .cse14 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse10 .cse1 .cse11 .cse4 (or (and .cse0 .cse3 .cse14 .cse5 .cse6 .cse12 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse12 .cse8 .cse13))))) [2022-11-19 07:26:29,361 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2022-11-19 07:26:29,362 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2022-11-19 07:26:29,362 INFO L895 garLoopResultBuilder]: At program point L69-1(lines 66 69) the Hoare annotation is: (let ((.cse0 (not (= ~c_m_lock~0 1))) (.cse1 (not (= ~c_empty_req~0 0)))) (or (and .cse0 .cse1 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and (= ~c_req_type~0 0) (let ((.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0))) (or (and .cse2 .cse1 .cse3 .cse4 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (and .cse2 .cse0 .cse1 .cse3 .cse4 .cse5))) (<= 0 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)))) [2022-11-19 07:26:29,362 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2022-11-19 07:26:29,362 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2022-11-19 07:26:29,362 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2022-11-19 07:26:29,363 INFO L895 garLoopResultBuilder]: At program point L467(lines 460 477) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,363 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2022-11-19 07:26:29,363 INFO L895 garLoopResultBuilder]: At program point L864(lines 864 872) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse11 (not (= ~c_m_lock~0 1))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse14 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse11 .cse6 .cse12 .cse13 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse6 .cse12 .cse13 .cse8 .cse14) (and .cse11 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse9 .cse1 .cse10 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse6 .cse13 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse13 .cse8 .cse14))))) [2022-11-19 07:26:29,363 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2022-11-19 07:26:29,363 INFO L895 garLoopResultBuilder]: At program point L667(lines 637 668) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,364 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2022-11-19 07:26:29,364 INFO L895 garLoopResultBuilder]: At program point L1064(lines 1057 1083) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-11-19 07:26:29,364 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2022-11-19 07:26:29,364 INFO L895 garLoopResultBuilder]: At program point L1197(lines 1190 1234) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-11-19 07:26:29,365 INFO L895 garLoopResultBuilder]: At program point L867(lines 867 871) the Hoare annotation is: (let ((.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (= ~req_tt_a~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~a_t~0 0)) (.cse6 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and (= ~c_req_type~0 0) .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse7 (= ~m_run_pc~0 6))) (or (and .cse0 .cse2 .cse6 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse4 .cse7 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0))))) (and .cse6 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)))) [2022-11-19 07:26:29,365 INFO L895 garLoopResultBuilder]: At program point L735(lines 728 745) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,365 INFO L895 garLoopResultBuilder]: At program point L603(lines 596 613) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,365 INFO L895 garLoopResultBuilder]: At program point L339(lines 332 376) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,365 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2022-11-19 07:26:29,366 INFO L895 garLoopResultBuilder]: At program point L207(lines 177 208) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (not (= ~m_run_st~0 0))) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse4 (<= 0 ~a_t~0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-19 07:26:29,366 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2022-11-19 07:26:29,366 INFO L895 garLoopResultBuilder]: At program point L934(lines 927 962) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-11-19 07:26:29,366 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2022-11-19 07:26:29,367 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-11-19 07:26:29,367 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2022-11-19 07:26:29,367 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2022-11-19 07:26:29,367 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2022-11-19 07:26:29,367 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2022-11-19 07:26:29,367 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 876 1106) the Hoare annotation is: (let ((.cse9 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_req_type~0 0)) (.cse14 (= ~m_run_pc~0 6)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~m_run_st~0 0))) (.cse12 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse1 (or (and .cse8 .cse0 .cse5 .cse9 .cse14 .cse7 .cse15) (and .cse8 .cse0 .cse10 .cse5 .cse9 .cse14 .cse7)) .cse16 .cse3) (and .cse13 (or (and .cse0 .cse4 .cse5 .cse14 .cse7 .cse15) (and .cse0 .cse10 .cse4 .cse5 .cse14 .cse7)) .cse1 .cse16 .cse3 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse13 .cse1 (or (and .cse8 .cse0 .cse10 .cse4 .cse5 .cse14 .cse7) (and .cse8 .cse0 .cse4 .cse5 .cse14 .cse7 .cse15)) .cse16 .cse3) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse10 .cse11 .cse12))) [2022-11-19 07:26:29,368 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2022-11-19 07:26:29,368 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2022-11-19 07:26:29,368 INFO L895 garLoopResultBuilder]: At program point L275(lines 268 285) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6) (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 (= ~m_run_pc~0 0)))) [2022-11-19 07:26:29,368 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-11-19 07:26:29,368 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2022-11-19 07:26:29,369 INFO L899 garLoopResultBuilder]: For program point L143-1(line 143) no Hoare annotation was computed. [2022-11-19 07:26:29,369 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2022-11-19 07:26:29,369 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-11-19 07:26:29,369 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-11-19 07:26:29,369 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2022-11-19 07:26:29,369 INFO L895 garLoopResultBuilder]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~s_run_pc~0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-19 07:26:29,370 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2022-11-19 07:26:29,370 INFO L895 garLoopResultBuilder]: At program point L79-1(lines 74 82) the Hoare annotation is: (let ((.cse0 (not (= ~c_empty_req~0 0)))) (or (and (<= 2 ~c_write_req_ev~0) (<= 0 |ULTIMATE.start_m_run_~a~0#1|) (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (= ~req_tt_a~0 0) .cse0 (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (= ~a_t~0 0)) (and (not (= ~c_m_lock~0 1)) .cse0 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)))) [2022-11-19 07:26:29,370 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2022-11-19 07:26:29,370 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2022-11-19 07:26:29,370 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2022-11-19 07:26:29,371 INFO L895 garLoopResultBuilder]: At program point L1270(lines 1263 1316) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-11-19 07:26:29,371 INFO L895 garLoopResultBuilder]: At program point L1072(lines 1065 1082) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-11-19 07:26:29,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-11-19 07:26:29,371 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2022-11-19 07:26:29,371 INFO L895 garLoopResultBuilder]: At program point L1205(lines 1198 1233) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-11-19 07:26:29,372 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2022-11-19 07:26:29,372 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2022-11-19 07:26:29,372 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-11-19 07:26:29,372 INFO L895 garLoopResultBuilder]: At program point L413(lines 406 459) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,372 INFO L895 garLoopResultBuilder]: At program point L347(lines 340 375) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,372 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2022-11-19 07:26:29,373 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1170 1349) the Hoare annotation is: (let ((.cse5 (= ~c_empty_rsp~0 1)) (.cse13 (= ~m_run_pc~0 0)) (.cse2 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (= ~c_req_type~0 0)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse14 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse12 (not (= ~m_run_st~0 0)) .cse13) (and .cse8 .cse0 (= ~s_run_pc~0 0) .cse3 .cse12 (= ~c_empty_req~0 1) .cse4 .cse5 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7) (and .cse8 (or (and .cse0 .cse14 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse12 .cse14 .cse4 .cse10 .cse7)) .cse1 .cse9 .cse3))) [2022-11-19 07:26:29,373 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2022-11-19 07:26:29,373 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-11-19 07:26:29,373 INFO L895 garLoopResultBuilder]: At program point L942(lines 935 961) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-11-19 07:26:29,374 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 860 1111) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~m_run_pc~0 6)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse13 (not (= 2 ~s_run_pc~0))) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~req_tt_a~0 0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~a_t~0 0)) (.cse12 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse4 .cse5)) .cse8 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse2 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse3 .cse11 .cse5) (and .cse7 (not (= ~m_run_st~0 0)) .cse12) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse13 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6))) (and .cse13 .cse2 .cse1 .cse10 .cse9 .cse3 .cse11 .cse5) (and .cse0 .cse13 .cse2 (not (= ~s_run_st~0 0)) .cse9 .cse7 (= ~c_empty_req~0 1) .cse3 (= ~c_empty_rsp~0 1) .cse5 .cse12))) [2022-11-19 07:26:29,374 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2022-11-19 07:26:29,374 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2022-11-19 07:26:29,374 INFO L895 garLoopResultBuilder]: At program point L481(lines 133 482) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) [2022-11-19 07:26:29,374 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-11-19 07:26:29,375 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2022-11-19 07:26:29,375 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2022-11-19 07:26:29,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:26:29,375 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 876 1106) the Hoare annotation is: (let ((.cse3 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= ~c_req_type~0 0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse4 (= ~req_tt_a~0 0)) (.cse0 (not (= ~c_m_lock~0 1))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~a_t~0 0)) (.cse1 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ~m_run_st~0 0)) .cse1) (and .cse2 .cse3 (= ~c_req_type~0 1) .cse4 .cse5 (= ~m_run_pc~0 3) .cse6) (and .cse7 .cse3 (let ((.cse8 (= ~m_run_pc~0 6))) (or (and .cse2 .cse5 .cse8 .cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (and .cse2 .cse0 .cse5 .cse8 .cse6))) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4) (and .cse7 .cse2 (not (= ~s_run_st~0 0)) .cse4 .cse0 (= ~c_empty_req~0 1) .cse5 (= ~c_empty_rsp~0 1) .cse6 .cse1))) [2022-11-19 07:26:29,375 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2022-11-19 07:26:29,375 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2022-11-19 07:26:29,376 INFO L895 garLoopResultBuilder]: At program point L681(lines 674 727) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,376 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2022-11-19 07:26:29,376 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse13 (= ~c_empty_req~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse2 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (= ~c_req_type~0 0)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse15 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse8 .cse0 (not (= ~s_run_st~0 0)) .cse3 .cse12 (= 2 ~s_run_pc~0) .cse13 .cse4 .cse5 .cse7 .cse14) (and .cse12 (not (= ~m_run_st~0 0)) .cse14) (and .cse8 .cse0 (= ~s_run_pc~0 0) .cse3 .cse12 .cse13 .cse4 .cse5 .cse7 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse7) (and .cse8 (or (and .cse0 .cse15 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse12 .cse15 .cse4 .cse10 .cse7)) .cse1 .cse9 .cse3))) [2022-11-19 07:26:29,376 INFO L902 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: true [2022-11-19 07:26:29,376 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2022-11-19 07:26:29,377 INFO L895 garLoopResultBuilder]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1))) (or (and (= ~c_req_type~0 0) .cse0 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_run_pc~0 6) (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~a_t~0 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)))) [2022-11-19 07:26:29,377 INFO L895 garLoopResultBuilder]: At program point L1278(lines 1271 1315) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-11-19 07:26:29,377 INFO L895 garLoopResultBuilder]: At program point L221(lines 214 267) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse8 (= ~m_run_pc~0 0))) (or (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-19 07:26:29,377 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2022-11-19 07:26:29,378 INFO L902 garLoopResultBuilder]: At program point L1345(lines 1167 1350) the Hoare annotation is: true [2022-11-19 07:26:29,378 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse4 (= ~a_t~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 0)) .cse3 (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 1)) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5))) [2022-11-19 07:26:29,378 INFO L895 garLoopResultBuilder]: At program point L1213(lines 1206 1232) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-11-19 07:26:29,378 INFO L895 garLoopResultBuilder]: At program point L817(lines 810 827) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,378 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2022-11-19 07:26:29,379 INFO L895 garLoopResultBuilder]: At program point L421(lines 414 458) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,379 INFO L895 garLoopResultBuilder]: At program point L355(lines 348 374) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,379 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2022-11-19 07:26:29,379 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2022-11-19 07:26:29,379 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-11-19 07:26:29,380 INFO L895 garLoopResultBuilder]: At program point L950(lines 943 960) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-11-19 07:26:29,380 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2022-11-19 07:26:29,380 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2022-11-19 07:26:29,380 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2022-11-19 07:26:29,380 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2022-11-19 07:26:29,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-11-19 07:26:29,380 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-19 07:26:29,381 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-11-19 07:26:29,381 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-11-19 07:26:29,381 INFO L895 garLoopResultBuilder]: At program point L689(lines 682 726) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,381 INFO L895 garLoopResultBuilder]: At program point L557(lines 527 558) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,381 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2022-11-19 07:26:29,382 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2022-11-19 07:26:29,382 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-11-19 07:26:29,382 INFO L895 garLoopResultBuilder]: At program point L625(lines 618 635) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,382 INFO L895 garLoopResultBuilder]: At program point L1286(lines 1279 1314) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-11-19 07:26:29,382 INFO L895 garLoopResultBuilder]: At program point L229(lines 222 266) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse8 (= ~m_run_pc~0 0))) (or (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-19 07:26:29,383 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2022-11-19 07:26:29,383 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2022-11-19 07:26:29,383 INFO L895 garLoopResultBuilder]: At program point L1221(lines 1214 1231) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-11-19 07:26:29,383 INFO L895 garLoopResultBuilder]: At program point L429(lines 422 457) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,384 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 523) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,384 INFO L895 garLoopResultBuilder]: At program point L363(lines 356 373) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-11-19 07:26:29,384 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2022-11-19 07:26:29,384 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2022-11-19 07:26:29,384 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2022-11-19 07:26:29,384 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2022-11-19 07:26:29,385 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2022-11-19 07:26:29,385 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2022-11-19 07:26:29,385 INFO L895 garLoopResultBuilder]: At program point L1026(lines 1000 1027) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse4 (= ~m_run_pc~0 6)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse12 (not (= 2 ~s_run_pc~0))) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse4 .cse5)) .cse8 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse2 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse3 .cse11 .cse5) (and .cse7 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse12 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse6))) (and .cse12 .cse2 .cse1 .cse10 .cse9 .cse3 .cse11 .cse5))) [2022-11-19 07:26:29,385 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-11-19 07:26:29,385 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2022-11-19 07:26:29,389 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:29,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:26:29,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:26:29 BoogieIcfgContainer [2022-11-19 07:26:29,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:26:29,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:26:29,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:26:29,474 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:26:29,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:23:27" (3/4) ... [2022-11-19 07:26:29,477 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:26:29,483 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-19 07:26:29,496 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2022-11-19 07:26:29,497 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-19 07:26:29,498 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-19 07:26:29,500 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:26:29,603 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:26:29,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:26:29,604 INFO L158 Benchmark]: Toolchain (without parser) took 183502.69ms. Allocated memory was 90.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 55.0MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-19 07:26:29,604 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 90.2MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:26:29,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.09ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 54.8MB in the beginning and 83.8MB in the end (delta: -29.0MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-11-19 07:26:29,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.58ms. Allocated memory is still 115.3MB. Free memory was 83.8MB in the beginning and 80.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:26:29,605 INFO L158 Benchmark]: Boogie Preprocessor took 86.37ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 76.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:26:29,605 INFO L158 Benchmark]: RCFGBuilder took 1224.48ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 73.6MB in the end (delta: 3.3MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-11-19 07:26:29,606 INFO L158 Benchmark]: TraceAbstraction took 181477.64ms. Allocated memory was 115.3MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 73.0MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-11-19 07:26:29,606 INFO L158 Benchmark]: Witness Printer took 129.75ms. Allocated memory is still 3.6GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-19 07:26:29,608 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.24ms. Allocated memory is still 90.2MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.09ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 54.8MB in the beginning and 83.8MB in the end (delta: -29.0MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.58ms. Allocated memory is still 115.3MB. Free memory was 83.8MB in the beginning and 80.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.37ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 76.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1224.48ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 73.6MB in the end (delta: 3.3MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * TraceAbstraction took 181477.64ms. Allocated memory was 115.3MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 73.0MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 129.75ms. Allocated memory is still 3.6GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 239 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 181.3s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 142.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9421 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9421 mSDsluCounter, 17469 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9234 mSDsCounter, 368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4584 IncrementalHoareTripleChecker+Invalid, 4952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 368 mSolverCounterUnsat, 8235 mSDtfsCounter, 4584 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13656occurred in iteration=16, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 29982 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 103 LocationsWithAnnotation, 117 PreInvPairs, 1140 NumberOfFragments, 7912 HoareAnnotationTreeSize, 117 FomulaSimplifications, 1035312 FormulaSimplificationTreeSizeReduction, 90.0s HoareSimplificationTime, 103 FomulaSimplificationsInter, 1685249 FormulaSimplificationTreeSizeReductionInter, 52.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2789 NumberOfCodeBlocks, 2789 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2763 ConstructedInterpolants, 0 QuantifiedInterpolants, 5084 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1778 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 609/625 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 1 <= a) && a_t == 0) || ((((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: (((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) - InvariantResult [Line: 1263]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: ((((((((req_type___0 == 0 && c_req_type == 0) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0)))) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || (((!(2 == s_run_pc) && !(c_m_lock == 1)) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: ((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 965]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((c_req_type == 0 && 0 <= a) && ((((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || (((((2 <= c_write_req_ev && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) - InvariantResult [Line: 1170]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) || ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((c_req_type == 0 && ((((((2 <= c_write_req_ev && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 1 <= a - InvariantResult [Line: 494]: Loop Invariant Derived loop invariant: (((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((c_req_type == 1 && ((c_empty_rsp == 1 && m_run_pc == 3) || ((c_empty_rsp == 1 && !(m_run_st == 0)) && m_run_pc == 0))) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 1 <= a) && a_t == 0)) || ((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0) - InvariantResult [Line: 1198]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 1033]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && m_run_pc == 0) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 1214]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 1236]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0) || ((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0)) || ((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && a == 0) - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 1271]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 810]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 1287]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: ((((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((c_req_type == 0 && 0 <= a) && (((((2 <= c_write_req_ev && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && req_a___0 == 0) && req_tt_a == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0) - InvariantResult [Line: 1295]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 1 <= a) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 0 <= a) && (((((2 <= c_write_req_ev && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && req_a___0 == 0) && req_tt_a == 0) && req_type == 0) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0)))) || (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 1167]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((((c_req_type == 1 && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 1 && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) || (((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 0 <= a) && (((((2 <= c_write_req_ev && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && req_a___0 == 0) && req_tt_a == 0) && req_type == 0) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0)))) || (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0) - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0))) && req_a___0 == 0) && req_tt_a == 0)) || (((((c_req_type == 0 && ((((((2 <= c_write_req_ev && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && req_type == 0)) || ((((c_req_type == 0 && 0 <= a) && (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0)) || ((((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || (((!(2 == s_run_pc) && !(c_m_lock == 1)) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((c_req_type == 1 && ((c_empty_rsp == 1 && m_run_pc == 3) || ((c_empty_rsp == 1 && !(m_run_st == 0)) && m_run_pc == 0))) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 1317]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 1 && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) || (((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0)))) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 864]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0)) || ((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((req_type___0 == 0 && c_req_type == 0) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0 - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((req_type___0 == 0 && c_req_type == 0) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((req_type___0 == 0 && c_req_type == 0) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0 - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0) || (((((c_req_type == 0 && ((((((2 <= c_write_req_ev && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && req_type == 0) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) || ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((c_req_type == 0 && ((((((2 <= c_write_req_ev && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((req_type___0 == 0 && c_req_type == 0) && ((c_empty_rsp == 1 && m_run_pc == 3) || ((c_empty_rsp == 1 && !(m_run_st == 0)) && m_run_pc == 0))) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0 - InvariantResult [Line: 460]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((((c_req_type == 1 && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 1279]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((((((req_type___0 == 0 && c_req_type == 0) && ((c_empty_rsp == 1 && m_run_pc == 3) || ((c_empty_rsp == 1 && !(m_run_st == 0)) && m_run_pc == 0))) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0 RESULT: Ultimate proved your program to be correct! [2022-11-19 07:26:29,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_342041d5-e8e4-4051-8884-b7305768dfa6/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE