./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 b5237d83 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_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/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_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 01:49:47,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:49:47,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:49:47,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:49:47,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:49:47,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:49:47,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:49:47,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:49:47,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:49:47,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:49:47,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:49:47,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:49:47,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:49:47,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:49:47,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:49:47,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:49:47,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:49:47,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:49:47,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:49:47,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:49:47,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:49:47,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:49:47,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:49:47,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:49:47,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:49:47,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:49:47,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:49:47,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:49:47,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:49:47,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:49:47,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:49:47,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:49:47,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:49:47,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:49:47,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:49:47,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:49:47,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:49:47,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:49:47,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:49:47,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:49:47,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:49:47,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:49:47,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:49:47,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:49:47,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:49:47,321 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:49:47,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:49:47,322 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:49:47,322 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:49:47,322 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:49:47,323 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:49:47,323 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:49:47,324 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:49:47,324 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:49:47,324 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:49:47,324 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:49:47,325 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:49:47,325 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:49:47,325 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:49:47,325 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:49:47,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:49:47,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:49:47,326 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:49:47,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:49:47,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:49:47,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:49:47,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:49:47,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:49:47,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:49:47,327 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:49:47,328 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:49:47,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:49:47,328 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:49:47,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:49:47,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:49:47,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:49:47,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:49:47,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:49:47,329 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:49:47,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:49:47,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:49:47,330 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:49:47,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:49:47,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:49:47,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:49:47,331 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_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/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_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba 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-22 01:49:47,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:49:47,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:49:47,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:49:47,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:49:47,663 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:49:47,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-11-22 01:49:50,732 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:49:51,032 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:49:51,033 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-11-22 01:49:51,063 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/data/44fae1bf0/7129c2721e9847bfb5af9effea9a2c7b/FLAG5db034083 [2022-11-22 01:49:51,116 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/data/44fae1bf0/7129c2721e9847bfb5af9effea9a2c7b [2022-11-22 01:49:51,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:49:51,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:49:51,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:49:51,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:49:51,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:49:51,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dbb9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51, skipping insertion in model container [2022-11-22 01:49:51,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:49:51,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:49:51,420 WARN L237 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_f050805c-6f0c-407a-97ea-37530e337e2b/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-11-22 01:49:51,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:49:51,566 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:49:51,578 WARN L237 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_f050805c-6f0c-407a-97ea-37530e337e2b/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-11-22 01:49:51,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:49:51,735 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:49:51,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51 WrapperNode [2022-11-22 01:49:51,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:49:51,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:49:51,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:49:51,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:49:51,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,811 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 854 [2022-11-22 01:49:51,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:49:51,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:49:51,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:49:51,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:49:51,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:49:51,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:49:51,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:49:51,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:49:51,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (1/1) ... [2022-11-22 01:49:51,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:49:51,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:49:51,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:49:51,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:49:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:49:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:49:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-22 01:49:51,986 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-22 01:49:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:49:51,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:49:52,120 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:49:52,122 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:49:53,047 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:49:53,224 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:49:53,224 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-11-22 01:49:53,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:49:53 BoogieIcfgContainer [2022-11-22 01:49:53,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:49:53,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:49:53,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:49:53,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:49:53,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:49:51" (1/3) ... [2022-11-22 01:49:53,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f12455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:49:53, skipping insertion in model container [2022-11-22 01:49:53,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:49:51" (2/3) ... [2022-11-22 01:49:53,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f12455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:49:53, skipping insertion in model container [2022-11-22 01:49:53,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:49:53" (3/3) ... [2022-11-22 01:49:53,238 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2022-11-22 01:49:53,258 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:49:53,258 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-22 01:49:53,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:49:53,336 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;@5757eee5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:49:53,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-22 01:49:53,343 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-22 01:49:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:49:53,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:53,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:49:53,355 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-22 01:49:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1097034834, now seen corresponding path program 1 times [2022-11-22 01:49:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:53,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341252609] [2022-11-22 01:49:53,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:53,672 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-22 01:49:53,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:53,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341252609] [2022-11-22 01:49:53,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341252609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:53,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:53,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:49:53,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519618443] [2022-11-22 01:49:53,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:53,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:49:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:49:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:49:53,734 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-22 01:49:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:54,290 INFO L93 Difference]: Finished difference Result 642 states and 1088 transitions. [2022-11-22 01:49:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:49:54,292 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-22 01:49:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:54,313 INFO L225 Difference]: With dead ends: 642 [2022-11-22 01:49:54,314 INFO L226 Difference]: Without dead ends: 389 [2022-11-22 01:49:54,321 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-22 01:49:54,325 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-22 01:49:54,326 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-22 01:49:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-22 01:49:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 381. [2022-11-22 01:49:54,407 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-22 01:49:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 568 transitions. [2022-11-22 01:49:54,411 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 568 transitions. Word has length 15 [2022-11-22 01:49:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:54,412 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 568 transitions. [2022-11-22 01:49:54,412 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-22 01:49:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 568 transitions. [2022-11-22 01:49:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:49:54,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:54,414 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-22 01:49:54,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:49:54,414 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-22 01:49:54,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1118601284, now seen corresponding path program 1 times [2022-11-22 01:49:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:54,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703659868] [2022-11-22 01:49:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:54,539 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-22 01:49:54,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:54,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703659868] [2022-11-22 01:49:54,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703659868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:54,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:54,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:49:54,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809967736] [2022-11-22 01:49:54,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:49:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:49:54,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:49:54,544 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-22 01:49:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:54,742 INFO L93 Difference]: Finished difference Result 1047 states and 1583 transitions. [2022-11-22 01:49:54,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:49:54,743 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-22 01:49:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:54,747 INFO L225 Difference]: With dead ends: 1047 [2022-11-22 01:49:54,747 INFO L226 Difference]: Without dead ends: 676 [2022-11-22 01:49:54,753 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-22 01:49:54,756 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:54,757 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.1s Time] [2022-11-22 01:49:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-22 01:49:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 601. [2022-11-22 01:49:54,826 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-22 01:49:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 888 transitions. [2022-11-22 01:49:54,829 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 888 transitions. Word has length 19 [2022-11-22 01:49:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:54,830 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 888 transitions. [2022-11-22 01:49:54,830 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-22 01:49:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 888 transitions. [2022-11-22 01:49:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 01:49:54,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:54,833 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-22 01:49:54,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:49:54,833 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-22 01:49:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash -20601460, now seen corresponding path program 1 times [2022-11-22 01:49:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:54,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88198939] [2022-11-22 01:49:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:55,044 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-22 01:49:55,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:55,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88198939] [2022-11-22 01:49:55,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88198939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:55,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:55,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:49:55,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953623824] [2022-11-22 01:49:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:55,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:49:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:55,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:49:55,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:49:55,047 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-22 01:49:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:55,675 INFO L93 Difference]: Finished difference Result 1657 states and 2508 transitions. [2022-11-22 01:49:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:49:55,676 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-22 01:49:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:55,680 INFO L225 Difference]: With dead ends: 1657 [2022-11-22 01:49:55,680 INFO L226 Difference]: Without dead ends: 1066 [2022-11-22 01:49:55,682 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-22 01:49:55,683 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-22 01:49:55,683 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-22 01:49:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-11-22 01:49:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 920. [2022-11-22 01:49:55,750 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-22 01:49:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1402 transitions. [2022-11-22 01:49:55,754 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1402 transitions. Word has length 48 [2022-11-22 01:49:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:55,754 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1402 transitions. [2022-11-22 01:49:55,754 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-22 01:49:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1402 transitions. [2022-11-22 01:49:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 01:49:55,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:55,766 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-22 01:49:55,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:49:55,767 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-22 01:49:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash 828650942, now seen corresponding path program 1 times [2022-11-22 01:49:55,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:55,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144477600] [2022-11-22 01:49:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:55,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:55,926 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-22 01:49:55,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:55,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144477600] [2022-11-22 01:49:55,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144477600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:55,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:55,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:49:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031573637] [2022-11-22 01:49:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:55,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:49:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:49:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:49:55,932 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-22 01:49:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:56,342 INFO L93 Difference]: Finished difference Result 2311 states and 3529 transitions. [2022-11-22 01:49:56,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:49:56,342 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-22 01:49:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:56,348 INFO L225 Difference]: With dead ends: 2311 [2022-11-22 01:49:56,348 INFO L226 Difference]: Without dead ends: 1401 [2022-11-22 01:49:56,350 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-22 01:49:56,351 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 352 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-22 01:49:56,351 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-22 01:49:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2022-11-22 01:49:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1286. [2022-11-22 01:49:56,426 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-22 01:49:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1967 transitions. [2022-11-22 01:49:56,431 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1967 transitions. Word has length 51 [2022-11-22 01:49:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:56,431 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1967 transitions. [2022-11-22 01:49:56,431 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-22 01:49:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1967 transitions. [2022-11-22 01:49:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-22 01:49:56,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:56,433 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-22 01:49:56,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:49:56,434 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-22 01:49:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:56,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2039643689, now seen corresponding path program 1 times [2022-11-22 01:49:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:56,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188543192] [2022-11-22 01:49:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:56,508 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-22 01:49:56,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:56,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188543192] [2022-11-22 01:49:56,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188543192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:56,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:56,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:49:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846969670] [2022-11-22 01:49:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:56,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:49:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:56,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:49:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:49:56,523 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-22 01:49:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:57,086 INFO L93 Difference]: Finished difference Result 4049 states and 6081 transitions. [2022-11-22 01:49:57,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:49:57,087 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-22 01:49:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:57,102 INFO L225 Difference]: With dead ends: 4049 [2022-11-22 01:49:57,102 INFO L226 Difference]: Without dead ends: 2771 [2022-11-22 01:49:57,105 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-22 01:49:57,107 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.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:57,107 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.3s Time] [2022-11-22 01:49:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2022-11-22 01:49:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2468. [2022-11-22 01:49:57,277 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-22 01:49:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3712 transitions. [2022-11-22 01:49:57,286 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3712 transitions. Word has length 63 [2022-11-22 01:49:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:57,293 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 3712 transitions. [2022-11-22 01:49:57,294 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-22 01:49:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3712 transitions. [2022-11-22 01:49:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-22 01:49:57,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:57,297 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-22 01:49:57,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:49:57,298 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-22 01:49:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1167486893, now seen corresponding path program 1 times [2022-11-22 01:49:57,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:57,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784916635] [2022-11-22 01:49:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:57,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:57,421 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-22 01:49:57,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:57,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784916635] [2022-11-22 01:49:57,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784916635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:57,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:57,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:49:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805395576] [2022-11-22 01:49:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:57,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:49:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:49:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:49:57,425 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-22 01:49:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:58,039 INFO L93 Difference]: Finished difference Result 5448 states and 8252 transitions. [2022-11-22 01:49:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:49:58,040 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-22 01:49:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:58,050 INFO L225 Difference]: With dead ends: 5448 [2022-11-22 01:49:58,050 INFO L226 Difference]: Without dead ends: 2774 [2022-11-22 01:49:58,057 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-22 01:49:58,061 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.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:49:58,062 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.4s Time] [2022-11-22 01:49:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-11-22 01:49:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2469. [2022-11-22 01:49:58,227 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-22 01:49:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3731 transitions. [2022-11-22 01:49:58,237 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3731 transitions. Word has length 63 [2022-11-22 01:49:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:58,238 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 3731 transitions. [2022-11-22 01:49:58,238 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-22 01:49:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3731 transitions. [2022-11-22 01:49:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-22 01:49:58,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:58,240 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-22 01:49:58,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:49:58,240 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-22 01:49:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash -396856952, now seen corresponding path program 1 times [2022-11-22 01:49:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:58,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025317429] [2022-11-22 01:49:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:58,282 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-22 01:49:58,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:58,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025317429] [2022-11-22 01:49:58,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025317429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:58,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:58,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:49:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535313904] [2022-11-22 01:49:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:58,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:49:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:58,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:49:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:49:58,285 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-22 01:49:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:58,604 INFO L93 Difference]: Finished difference Result 5654 states and 8644 transitions. [2022-11-22 01:49:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:49:58,605 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-22 01:49:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:58,618 INFO L225 Difference]: With dead ends: 5654 [2022-11-22 01:49:58,618 INFO L226 Difference]: Without dead ends: 3195 [2022-11-22 01:49:58,622 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-22 01:49:58,623 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-22 01:49:58,623 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-22 01:49:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2022-11-22 01:49:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2881. [2022-11-22 01:49:58,809 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-22 01:49:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4422 transitions. [2022-11-22 01:49:58,866 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4422 transitions. Word has length 63 [2022-11-22 01:49:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:58,866 INFO L495 AbstractCegarLoop]: Abstraction has 2881 states and 4422 transitions. [2022-11-22 01:49:58,867 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-22 01:49:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4422 transitions. [2022-11-22 01:49:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-22 01:49:58,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:58,870 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-22 01:49:58,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:49:58,870 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-22 01:49:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1892192728, now seen corresponding path program 1 times [2022-11-22 01:49:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:58,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428757750] [2022-11-22 01:49:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:58,950 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-22 01:49:58,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428757750] [2022-11-22 01:49:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428757750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:58,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:58,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:49:58,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134836606] [2022-11-22 01:49:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:58,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:49:58,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:49:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:49:58,953 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-22 01:49:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:49:59,315 INFO L93 Difference]: Finished difference Result 6310 states and 9674 transitions. [2022-11-22 01:49:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:49:59,316 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-22 01:49:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:49:59,329 INFO L225 Difference]: With dead ends: 6310 [2022-11-22 01:49:59,329 INFO L226 Difference]: Without dead ends: 3447 [2022-11-22 01:49:59,333 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-22 01:49:59,334 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-22 01:49:59,334 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-22 01:49:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2022-11-22 01:49:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3164. [2022-11-22 01:49:59,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-22 01:49:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 4844 transitions. [2022-11-22 01:49:59,596 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 4844 transitions. Word has length 78 [2022-11-22 01:49:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:49:59,597 INFO L495 AbstractCegarLoop]: Abstraction has 3164 states and 4844 transitions. [2022-11-22 01:49:59,597 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-22 01:49:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 4844 transitions. [2022-11-22 01:49:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-22 01:49:59,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:49:59,602 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-22 01:49:59,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:49:59,602 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-22 01:49:59,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:49:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash -755069329, now seen corresponding path program 1 times [2022-11-22 01:49:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:49:59,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339867269] [2022-11-22 01:49:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:49:59,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:49:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:49:59,658 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-22 01:49:59,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:49:59,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339867269] [2022-11-22 01:49:59,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339867269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:49:59,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:49:59,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:49:59,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684642322] [2022-11-22 01:49:59,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:49:59,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:49:59,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:49:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:49:59,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:49:59,661 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-22 01:50:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:00,227 INFO L93 Difference]: Finished difference Result 7467 states and 11425 transitions. [2022-11-22 01:50:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:00,228 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-22 01:50:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:00,243 INFO L225 Difference]: With dead ends: 7467 [2022-11-22 01:50:00,244 INFO L226 Difference]: Without dead ends: 4384 [2022-11-22 01:50:00,249 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-22 01:50:00,250 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-22 01:50:00,250 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-22 01:50:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-11-22 01:50:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3406. [2022-11-22 01:50:00,511 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-22 01:50:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4990 transitions. [2022-11-22 01:50:00,519 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 4990 transitions. Word has length 88 [2022-11-22 01:50:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:00,519 INFO L495 AbstractCegarLoop]: Abstraction has 3406 states and 4990 transitions. [2022-11-22 01:50:00,519 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-22 01:50:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 4990 transitions. [2022-11-22 01:50:00,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-22 01:50:00,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:00,521 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-22 01:50:00,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:50:00,522 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-22 01:50:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1003143585, now seen corresponding path program 1 times [2022-11-22 01:50:00,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:00,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635931934] [2022-11-22 01:50:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:00,596 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-22 01:50:00,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:00,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635931934] [2022-11-22 01:50:00,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635931934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:00,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:00,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:50:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660658741] [2022-11-22 01:50:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:00,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:50:00,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:00,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:50:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:50:00,599 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-22 01:50:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:01,183 INFO L93 Difference]: Finished difference Result 7015 states and 10275 transitions. [2022-11-22 01:50:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:50:01,184 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-22 01:50:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:01,197 INFO L225 Difference]: With dead ends: 7015 [2022-11-22 01:50:01,197 INFO L226 Difference]: Without dead ends: 3735 [2022-11-22 01:50:01,203 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-22 01:50:01,203 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-22 01:50:01,204 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-22 01:50:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-11-22 01:50:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3617. [2022-11-22 01:50:01,530 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-22 01:50:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5280 transitions. [2022-11-22 01:50:01,538 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5280 transitions. Word has length 95 [2022-11-22 01:50:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:01,539 INFO L495 AbstractCegarLoop]: Abstraction has 3617 states and 5280 transitions. [2022-11-22 01:50:01,539 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-22 01:50:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5280 transitions. [2022-11-22 01:50:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-22 01:50:01,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:01,541 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-22 01:50:01,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:50:01,541 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-22 01:50:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1950589719, now seen corresponding path program 1 times [2022-11-22 01:50:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:01,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108065096] [2022-11-22 01:50:01,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:01,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:01,614 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-22 01:50:01,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:01,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108065096] [2022-11-22 01:50:01,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108065096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:01,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:01,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:50:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478291965] [2022-11-22 01:50:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:01,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:01,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:01,617 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-22 01:50:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:01,957 INFO L93 Difference]: Finished difference Result 7143 states and 10448 transitions. [2022-11-22 01:50:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:01,957 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-22 01:50:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:01,974 INFO L225 Difference]: With dead ends: 7143 [2022-11-22 01:50:01,975 INFO L226 Difference]: Without dead ends: 3617 [2022-11-22 01:50:01,980 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-22 01:50:01,981 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-22 01:50:01,981 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-22 01:50:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2022-11-22 01:50:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 3617. [2022-11-22 01:50:02,298 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-22 01:50:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5235 transitions. [2022-11-22 01:50:02,313 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5235 transitions. Word has length 96 [2022-11-22 01:50:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:02,314 INFO L495 AbstractCegarLoop]: Abstraction has 3617 states and 5235 transitions. [2022-11-22 01:50:02,314 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-22 01:50:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5235 transitions. [2022-11-22 01:50:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-22 01:50:02,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:02,317 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-22 01:50:02,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:50:02,317 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-22 01:50:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:02,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1424196516, now seen corresponding path program 1 times [2022-11-22 01:50:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:02,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554012653] [2022-11-22 01:50:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:02,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:02,402 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-22 01:50:02,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554012653] [2022-11-22 01:50:02,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554012653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:02,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:02,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:50:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120142247] [2022-11-22 01:50:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:02,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:50:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:02,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:50:02,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:50:02,405 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-22 01:50:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:03,149 INFO L93 Difference]: Finished difference Result 8692 states and 12599 transitions. [2022-11-22 01:50:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:50:03,150 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-22 01:50:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:03,169 INFO L225 Difference]: With dead ends: 8692 [2022-11-22 01:50:03,169 INFO L226 Difference]: Without dead ends: 5085 [2022-11-22 01:50:03,175 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-22 01:50:03,176 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 339 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 01:50:03,176 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-22 01:50:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2022-11-22 01:50:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 4249. [2022-11-22 01:50:03,642 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-22 01:50:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 6114 transitions. [2022-11-22 01:50:03,655 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 6114 transitions. Word has length 98 [2022-11-22 01:50:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:03,655 INFO L495 AbstractCegarLoop]: Abstraction has 4249 states and 6114 transitions. [2022-11-22 01:50:03,655 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-22 01:50:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 6114 transitions. [2022-11-22 01:50:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-22 01:50:03,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:03,661 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-22 01:50:03,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:50:03,661 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-22 01:50:03,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash 284455504, now seen corresponding path program 1 times [2022-11-22 01:50:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:03,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421103043] [2022-11-22 01:50:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:03,781 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-22 01:50:03,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:03,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421103043] [2022-11-22 01:50:03,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421103043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:03,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:03,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:50:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131289088] [2022-11-22 01:50:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:03,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:03,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:03,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:03,785 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-22 01:50:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:05,739 INFO L93 Difference]: Finished difference Result 22914 states and 33155 transitions. [2022-11-22 01:50:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:50:05,740 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-22 01:50:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:05,789 INFO L225 Difference]: With dead ends: 22914 [2022-11-22 01:50:05,790 INFO L226 Difference]: Without dead ends: 18768 [2022-11-22 01:50:05,798 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-22 01:50:05,799 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.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:05,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 2741 Invalid, 383 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:50:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18768 states. [2022-11-22 01:50:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18768 to 7352. [2022-11-22 01:50:06,799 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-22 01:50:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10687 transitions. [2022-11-22 01:50:06,823 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10687 transitions. Word has length 105 [2022-11-22 01:50:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:06,823 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10687 transitions. [2022-11-22 01:50:06,824 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-22 01:50:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10687 transitions. [2022-11-22 01:50:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-22 01:50:06,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:06,827 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-22 01:50:06,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:50:06,827 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-22 01:50:06,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:06,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1608185451, now seen corresponding path program 1 times [2022-11-22 01:50:06,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:06,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145348266] [2022-11-22 01:50:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:06,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:06,894 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-22 01:50:06,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:06,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145348266] [2022-11-22 01:50:06,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145348266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:06,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:06,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273532680] [2022-11-22 01:50:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:06,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:06,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:06,897 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-22 01:50:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:07,841 INFO L93 Difference]: Finished difference Result 14609 states and 21254 transitions. [2022-11-22 01:50:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:07,842 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-22 01:50:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:07,860 INFO L225 Difference]: With dead ends: 14609 [2022-11-22 01:50:07,860 INFO L226 Difference]: Without dead ends: 7360 [2022-11-22 01:50:07,869 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-22 01:50:07,869 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-22 01:50:07,870 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-22 01:50:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2022-11-22 01:50:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 7352. [2022-11-22 01:50:08,475 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-22 01:50:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10438 transitions. [2022-11-22 01:50:08,491 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10438 transitions. Word has length 107 [2022-11-22 01:50:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:08,492 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10438 transitions. [2022-11-22 01:50:08,492 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-22 01:50:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10438 transitions. [2022-11-22 01:50:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-22 01:50:08,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:08,494 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-22 01:50:08,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:50:08,494 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-22 01:50:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash 977811739, now seen corresponding path program 1 times [2022-11-22 01:50:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:08,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554698141] [2022-11-22 01:50:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:08,590 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-22 01:50:08,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:08,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554698141] [2022-11-22 01:50:08,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554698141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:50:08,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320567042] [2022-11-22 01:50:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:50:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:50:08,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:50:08,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:50:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:08,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 01:50:08,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:08,911 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-22 01:50:08,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:08,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320567042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:08,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:50:08,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-22 01:50:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414923804] [2022-11-22 01:50:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:08,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:08,914 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-22 01:50:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:09,597 INFO L93 Difference]: Finished difference Result 14601 states and 20756 transitions. [2022-11-22 01:50:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:09,597 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-22 01:50:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:09,614 INFO L225 Difference]: With dead ends: 14601 [2022-11-22 01:50:09,615 INFO L226 Difference]: Without dead ends: 7352 [2022-11-22 01:50:09,623 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-22 01:50:09,624 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-22 01:50:09,624 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-22 01:50:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7352 states. [2022-11-22 01:50:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7352 to 7352. [2022-11-22 01:50:10,549 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-22 01:50:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10354 transitions. [2022-11-22 01:50:10,567 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10354 transitions. Word has length 107 [2022-11-22 01:50:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:10,568 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10354 transitions. [2022-11-22 01:50:10,568 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-22 01:50:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10354 transitions. [2022-11-22 01:50:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-22 01:50:10,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:10,575 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-22 01:50:10,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 01:50:10,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 01:50:10,782 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-22 01:50:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:10,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1371703008, now seen corresponding path program 1 times [2022-11-22 01:50:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:10,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317744546] [2022-11-22 01:50:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:10,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:10,922 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-22 01:50:10,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:10,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317744546] [2022-11-22 01:50:10,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317744546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:10,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:10,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769688248] [2022-11-22 01:50:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:10,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:50:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:50:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:50:10,925 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-22 01:50:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:12,997 INFO L93 Difference]: Finished difference Result 16362 states and 22995 transitions. [2022-11-22 01:50:12,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:50:12,998 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-22 01:50:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:13,030 INFO L225 Difference]: With dead ends: 16362 [2022-11-22 01:50:13,030 INFO L226 Difference]: Without dead ends: 16358 [2022-11-22 01:50:13,034 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-22 01:50:13,035 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-22 01:50:13,035 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-22 01:50:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16358 states. [2022-11-22 01:50:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 13656. [2022-11-22 01:50:14,226 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-22 01:50:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13656 states to 13656 states and 19450 transitions. [2022-11-22 01:50:14,252 INFO L78 Accepts]: Start accepts. Automaton has 13656 states and 19450 transitions. Word has length 109 [2022-11-22 01:50:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:14,252 INFO L495 AbstractCegarLoop]: Abstraction has 13656 states and 19450 transitions. [2022-11-22 01:50:14,252 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-22 01:50:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13656 states and 19450 transitions. [2022-11-22 01:50:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-22 01:50:14,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:14,255 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-22 01:50:14,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:50:14,255 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-22 01:50:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -206319556, now seen corresponding path program 1 times [2022-11-22 01:50:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:14,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730838025] [2022-11-22 01:50:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:14,377 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-22 01:50:14,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:14,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730838025] [2022-11-22 01:50:14,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730838025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:50:14,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373312841] [2022-11-22 01:50:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:14,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:50:14,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:50:14,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:50:14,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:50:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:14,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 01:50:14,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:14,581 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-22 01:50:14,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:14,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373312841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:14,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:50:14,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-22 01:50:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839673357] [2022-11-22 01:50:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:14,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:14,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:14,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:14,583 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-22 01:50:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:16,085 INFO L93 Difference]: Finished difference Result 18155 states and 25723 transitions. [2022-11-22 01:50:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:16,086 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-22 01:50:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:16,113 INFO L225 Difference]: With dead ends: 18155 [2022-11-22 01:50:16,113 INFO L226 Difference]: Without dead ends: 18154 [2022-11-22 01:50:16,119 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-22 01:50:16,120 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-22 01:50:16,120 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-22 01:50:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18154 states. [2022-11-22 01:50:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18154 to 13655. [2022-11-22 01:50:17,453 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-22 01:50:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13655 states to 13655 states and 19438 transitions. [2022-11-22 01:50:17,488 INFO L78 Accepts]: Start accepts. Automaton has 13655 states and 19438 transitions. Word has length 113 [2022-11-22 01:50:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:17,489 INFO L495 AbstractCegarLoop]: Abstraction has 13655 states and 19438 transitions. [2022-11-22 01:50:17,489 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-22 01:50:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 13655 states and 19438 transitions. [2022-11-22 01:50:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-22 01:50:17,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:17,492 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-22 01:50:17,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:50:17,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 01:50:17,697 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-22 01:50:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2100938705, now seen corresponding path program 1 times [2022-11-22 01:50:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:17,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619932046] [2022-11-22 01:50:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:17,879 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-22 01:50:17,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:17,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619932046] [2022-11-22 01:50:17,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619932046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:50:17,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655770694] [2022-11-22 01:50:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:17,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:50:17,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:50:17,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:50:17,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:50:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:18,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:50:18,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:18,080 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-22 01:50:18,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:18,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655770694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:18,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:50:18,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-22 01:50:18,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610718483] [2022-11-22 01:50:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:18,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:18,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:18,083 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-22 01:50:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:20,235 INFO L93 Difference]: Finished difference Result 19846 states and 28217 transitions. [2022-11-22 01:50:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:20,236 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-22 01:50:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:20,260 INFO L225 Difference]: With dead ends: 19846 [2022-11-22 01:50:20,260 INFO L226 Difference]: Without dead ends: 19845 [2022-11-22 01:50:20,265 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-22 01:50:20,266 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-22 01:50:20,266 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-22 01:50:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19845 states. [2022-11-22 01:50:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19845 to 13654. [2022-11-22 01:50:21,538 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-22 01:50:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13654 states to 13654 states and 19426 transitions. [2022-11-22 01:50:21,564 INFO L78 Accepts]: Start accepts. Automaton has 13654 states and 19426 transitions. Word has length 114 [2022-11-22 01:50:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:21,565 INFO L495 AbstractCegarLoop]: Abstraction has 13654 states and 19426 transitions. [2022-11-22 01:50:21,565 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-22 01:50:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 13654 states and 19426 transitions. [2022-11-22 01:50:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-11-22 01:50:21,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:21,574 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-22 01:50:21,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:50:21,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 01:50:21,780 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-22 01:50:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2019096260, now seen corresponding path program 1 times [2022-11-22 01:50:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:21,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973350302] [2022-11-22 01:50:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:21,896 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-22 01:50:21,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:21,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973350302] [2022-11-22 01:50:21,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973350302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:21,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:21,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130912977] [2022-11-22 01:50:21,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:21,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:21,899 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-22 01:50:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:22,585 INFO L93 Difference]: Finished difference Result 16602 states and 23507 transitions. [2022-11-22 01:50:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:22,586 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-22 01:50:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:22,591 INFO L225 Difference]: With dead ends: 16602 [2022-11-22 01:50:22,591 INFO L226 Difference]: Without dead ends: 3051 [2022-11-22 01:50:22,607 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-22 01:50:22,607 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 130 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-22 01:50:22,608 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-22 01:50:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2022-11-22 01:50:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2323. [2022-11-22 01:50:22,977 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-22 01:50:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 2755 transitions. [2022-11-22 01:50:22,981 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 2755 transitions. Word has length 192 [2022-11-22 01:50:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:22,982 INFO L495 AbstractCegarLoop]: Abstraction has 2323 states and 2755 transitions. [2022-11-22 01:50:22,982 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-22 01:50:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2755 transitions. [2022-11-22 01:50:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-11-22 01:50:22,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:22,989 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-22 01:50:22,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 01:50:22,990 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-22 01:50:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1397049888, now seen corresponding path program 1 times [2022-11-22 01:50:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:22,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030256039] [2022-11-22 01:50:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:23,184 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-22 01:50:23,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:23,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030256039] [2022-11-22 01:50:23,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030256039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:50:23,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648537294] [2022-11-22 01:50:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:23,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:50:23,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:50:23,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:50:23,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:50:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:23,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:50:23,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:23,554 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-22 01:50:23,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:23,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648537294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:23,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:50:23,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 01:50:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954115526] [2022-11-22 01:50:23,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:23,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:50:23,560 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-22 01:50:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:23,936 INFO L93 Difference]: Finished difference Result 3211 states and 3830 transitions. [2022-11-22 01:50:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:50:23,936 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-22 01:50:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:23,938 INFO L225 Difference]: With dead ends: 3211 [2022-11-22 01:50:23,939 INFO L226 Difference]: Without dead ends: 1462 [2022-11-22 01:50:23,942 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-22 01:50:23,943 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-22 01:50:23,943 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-22 01:50:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-11-22 01:50:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1176. [2022-11-22 01:50:24,160 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-22 01:50:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1387 transitions. [2022-11-22 01:50:24,162 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1387 transitions. Word has length 207 [2022-11-22 01:50:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:24,163 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1387 transitions. [2022-11-22 01:50:24,163 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-22 01:50:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1387 transitions. [2022-11-22 01:50:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-22 01:50:24,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:24,167 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-22 01:50:24,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:50:24,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:50:24,374 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-22 01:50:24,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1623566563, now seen corresponding path program 1 times [2022-11-22 01:50:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:24,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563424196] [2022-11-22 01:50:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:24,502 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-22 01:50:24,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:24,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563424196] [2022-11-22 01:50:24,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563424196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:24,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:24,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:50:24,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906923830] [2022-11-22 01:50:24,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:24,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:24,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:24,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:24,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:24,504 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-22 01:50:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:25,013 INFO L93 Difference]: Finished difference Result 2259 states and 2696 transitions. [2022-11-22 01:50:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:50:25,013 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-22 01:50:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:25,015 INFO L225 Difference]: With dead ends: 2259 [2022-11-22 01:50:25,015 INFO L226 Difference]: Without dead ends: 1835 [2022-11-22 01:50:25,016 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-22 01:50:25,017 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:25,018 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.1s Time] [2022-11-22 01:50:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-11-22 01:50:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1164. [2022-11-22 01:50:25,164 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-22 01:50:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1367 transitions. [2022-11-22 01:50:25,166 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1367 transitions. Word has length 208 [2022-11-22 01:50:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:25,166 INFO L495 AbstractCegarLoop]: Abstraction has 1164 states and 1367 transitions. [2022-11-22 01:50:25,166 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-22 01:50:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1367 transitions. [2022-11-22 01:50:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-22 01:50:25,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:25,170 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-22 01:50:25,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 01:50:25,171 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-22 01:50:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1425418275, now seen corresponding path program 1 times [2022-11-22 01:50:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:25,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459374753] [2022-11-22 01:50:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:25,328 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-22 01:50:25,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:25,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459374753] [2022-11-22 01:50:25,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459374753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:25,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:25,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:50:25,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479607247] [2022-11-22 01:50:25,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:25,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:25,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:25,332 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-22 01:50:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:25,832 INFO L93 Difference]: Finished difference Result 1725 states and 2050 transitions. [2022-11-22 01:50:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:50:25,835 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-22 01:50:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:25,835 INFO L225 Difference]: With dead ends: 1725 [2022-11-22 01:50:25,835 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 01:50:25,837 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-22 01:50:25,837 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-22 01:50:25,838 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-22 01:50:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 01:50:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 01:50:25,838 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-22 01:50:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 01:50:25,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 209 [2022-11-22 01:50:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:25,839 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 01:50:25,839 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-22 01:50:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 01:50:25,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 01:50:25,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-22 01:50:25,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-22 01:50:25,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-22 01:50:25,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-22 01:50:25,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-22 01:50:25,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-22 01:50:25,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-22 01:50:25,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-22 01:50:25,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 01:50:25,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 01:50:38,091 WARN L233 SmtUtils]: Spent 12.06s 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-22 01:51:37,044 WARN L233 SmtUtils]: Spent 5.12s 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-22 01:52:29,603 WARN L233 SmtUtils]: Spent 5.79s 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-22 01:52:32,123 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-11-22 01:52:32,123 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2022-11-22 01:52:32,123 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2022-11-22 01:52:32,123 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2022-11-22 01:52:32,123 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2022-11-22 01:52:32,124 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-22 01:52:32,124 INFO L899 garLoopResultBuilder]: For program point L829-2(lines 829 835) no Hoare annotation was computed. [2022-11-22 01:52:32,124 INFO L899 garLoopResultBuilder]: For program point L829-3(lines 829 835) no Hoare annotation was computed. [2022-11-22 01:52:32,124 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-22 01:52:32,124 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-11-22 01:52:32,125 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-22 01:52:32,125 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-22 01:52:32,125 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2022-11-22 01:52:32,126 INFO L902 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: true [2022-11-22 01:52:32,126 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2022-11-22 01:52:32,126 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2022-11-22 01:52:32,126 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-22 01:52:32,126 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-22 01:52:32,127 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-22 01:52:32,127 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-22 01:52:32,127 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2022-11-22 01:52:32,127 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2022-11-22 01:52:32,127 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2022-11-22 01:52:32,128 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-22 01:52:32,128 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-22 01:52:32,128 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2022-11-22 01:52:32,128 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-22 01:52:32,129 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-11-22 01:52:32,129 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2022-11-22 01:52:32,129 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-11-22 01:52:32,129 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-22 01:52:32,129 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-22 01:52:32,130 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-22 01:52:32,130 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2022-11-22 01:52:32,130 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2022-11-22 01:52:32,130 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-22 01:52:32,130 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-22 01:52:32,131 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-22 01:52:32,131 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-22 01:52:32,131 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2022-11-22 01:52:32,131 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2022-11-22 01:52:32,132 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-22 01:52:32,132 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-22 01:52:32,132 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2022-11-22 01:52:32,132 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-22 01:52:32,132 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2022-11-22 01:52:32,133 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2022-11-22 01:52:32,133 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-22 01:52:32,133 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2022-11-22 01:52:32,133 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-22 01:52:32,133 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2022-11-22 01:52:32,133 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2022-11-22 01:52:32,134 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-22 01:52:32,134 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2022-11-22 01:52:32,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-11-22 01:52:32,134 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-22 01:52:32,135 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-22 01:52:32,135 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-22 01:52:32,135 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2022-11-22 01:52:32,135 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2022-11-22 01:52:32,135 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-22 01:52:32,136 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-22 01:52:32,136 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2022-11-22 01:52:32,136 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-22 01:52:32,136 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2022-11-22 01:52:32,136 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2022-11-22 01:52:32,137 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-22 01:52:32,137 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2022-11-22 01:52:32,137 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-22 01:52:32,137 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2022-11-22 01:52:32,137 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-22 01:52:32,137 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-22 01:52:32,138 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2022-11-22 01:52:32,138 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2022-11-22 01:52:32,138 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-22 01:52:32,138 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 01:52:32,138 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-22 01:52:32,138 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2022-11-22 01:52:32,139 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-22 01:52:32,139 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2022-11-22 01:52:32,139 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2022-11-22 01:52:32,139 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2022-11-22 01:52:32,139 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-22 01:52:32,139 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2022-11-22 01:52:32,139 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2022-11-22 01:52:32,139 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2022-11-22 01:52:32,140 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-22 01:52:32,140 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-11-22 01:52:32,140 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2022-11-22 01:52:32,140 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2022-11-22 01:52:32,140 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2022-11-22 01:52:32,140 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-11-22 01:52:32,141 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-22 01:52:32,141 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-22 01:52:32,141 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-22 01:52:32,141 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-22 01:52:32,142 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-11-22 01:52:32,142 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2022-11-22 01:52:32,142 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-22 01:52:32,142 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2022-11-22 01:52:32,142 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2022-11-22 01:52:32,142 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2022-11-22 01:52:32,143 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-22 01:52:32,143 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2022-11-22 01:52:32,143 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2022-11-22 01:52:32,143 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2022-11-22 01:52:32,143 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-22 01:52:32,143 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2022-11-22 01:52:32,144 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-22 01:52:32,144 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2022-11-22 01:52:32,144 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-22 01:52:32,144 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2022-11-22 01:52:32,144 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2022-11-22 01:52:32,144 INFO L902 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: true [2022-11-22 01:52:32,145 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2022-11-22 01:52:32,145 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-22 01:52:32,145 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2022-11-22 01:52:32,145 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2022-11-22 01:52:32,145 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-22 01:52:32,146 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2022-11-22 01:52:32,146 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2022-11-22 01:52:32,146 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2022-11-22 01:52:32,146 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-22 01:52:32,146 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2022-11-22 01:52:32,146 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-22 01:52:32,147 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2022-11-22 01:52:32,147 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-22 01:52:32,147 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2022-11-22 01:52:32,147 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-22 01:52:32,147 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2022-11-22 01:52:32,148 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-22 01:52:32,148 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-22 01:52:32,148 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-22 01:52:32,148 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-22 01:52:32,148 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-22 01:52:32,149 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2022-11-22 01:52:32,149 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-22 01:52:32,149 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2022-11-22 01:52:32,149 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-22 01:52:32,149 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2022-11-22 01:52:32,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-11-22 01:52:32,150 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2022-11-22 01:52:32,150 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2022-11-22 01:52:32,150 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2022-11-22 01:52:32,150 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2022-11-22 01:52:32,151 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-22 01:52:32,151 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2022-11-22 01:52:32,151 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2022-11-22 01:52:32,151 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-22 01:52:32,151 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-11-22 01:52:32,151 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2022-11-22 01:52:32,152 INFO L899 garLoopResultBuilder]: For program point L143-1(line 143) no Hoare annotation was computed. [2022-11-22 01:52:32,152 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2022-11-22 01:52:32,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-11-22 01:52:32,152 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-11-22 01:52:32,152 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2022-11-22 01:52:32,152 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-22 01:52:32,153 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2022-11-22 01:52:32,153 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-22 01:52:32,153 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2022-11-22 01:52:32,153 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2022-11-22 01:52:32,153 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2022-11-22 01:52:32,153 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-22 01:52:32,154 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-22 01:52:32,154 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-11-22 01:52:32,154 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2022-11-22 01:52:32,154 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-22 01:52:32,154 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2022-11-22 01:52:32,155 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2022-11-22 01:52:32,155 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-11-22 01:52:32,155 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-22 01:52:32,155 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-22 01:52:32,155 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2022-11-22 01:52:32,156 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-22 01:52:32,156 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2022-11-22 01:52:32,156 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-11-22 01:52:32,156 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-22 01:52:32,156 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-22 01:52:32,157 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2022-11-22 01:52:32,157 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2022-11-22 01:52:32,157 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-22 01:52:32,157 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-11-22 01:52:32,157 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2022-11-22 01:52:32,157 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2022-11-22 01:52:32,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 01:52:32,158 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-22 01:52:32,158 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2022-11-22 01:52:32,158 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2022-11-22 01:52:32,158 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-22 01:52:32,158 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2022-11-22 01:52:32,159 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-22 01:52:32,159 INFO L902 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: true [2022-11-22 01:52:32,159 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2022-11-22 01:52:32,159 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-22 01:52:32,160 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-22 01:52:32,160 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-22 01:52:32,160 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2022-11-22 01:52:32,160 INFO L902 garLoopResultBuilder]: At program point L1345(lines 1167 1350) the Hoare annotation is: true [2022-11-22 01:52:32,160 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-22 01:52:32,161 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-22 01:52:32,161 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-22 01:52:32,161 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2022-11-22 01:52:32,161 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-22 01:52:32,161 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-22 01:52:32,162 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2022-11-22 01:52:32,162 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2022-11-22 01:52:32,162 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-11-22 01:52:32,162 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-22 01:52:32,162 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2022-11-22 01:52:32,162 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2022-11-22 01:52:32,162 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2022-11-22 01:52:32,163 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2022-11-22 01:52:32,163 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-11-22 01:52:32,163 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-22 01:52:32,163 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-11-22 01:52:32,163 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-11-22 01:52:32,163 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-22 01:52:32,164 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-22 01:52:32,164 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2022-11-22 01:52:32,164 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2022-11-22 01:52:32,164 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-11-22 01:52:32,164 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-22 01:52:32,165 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-22 01:52:32,165 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-22 01:52:32,165 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2022-11-22 01:52:32,165 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2022-11-22 01:52:32,165 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-22 01:52:32,165 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-22 01:52:32,166 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-22 01:52:32,166 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-22 01:52:32,166 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2022-11-22 01:52:32,166 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2022-11-22 01:52:32,166 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2022-11-22 01:52:32,166 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2022-11-22 01:52:32,167 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2022-11-22 01:52:32,167 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2022-11-22 01:52:32,167 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-22 01:52:32,167 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-11-22 01:52:32,167 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2022-11-22 01:52:32,170 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-22 01:52:32,173 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:52:32,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:52:32 BoogieIcfgContainer [2022-11-22 01:52:32,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:52:32,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:52:32,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:52:32,245 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:52:32,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:49:53" (3/4) ... [2022-11-22 01:52:32,248 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 01:52:32,254 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-22 01:52:32,266 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2022-11-22 01:52:32,268 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-22 01:52:32,269 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 01:52:32,270 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 01:52:32,406 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:52:32,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:52:32,407 INFO L158 Benchmark]: Toolchain (without parser) took 161259.65ms. Allocated memory was 151.0MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 123.3MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 848.8MB. Max. memory is 16.1GB. [2022-11-22 01:52:32,412 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:52:32,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.57ms. Allocated memory is still 151.0MB. Free memory was 123.3MB in the beginning and 102.6MB in the end (delta: 20.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-22 01:52:32,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.53ms. Allocated memory is still 151.0MB. Free memory was 102.6MB in the beginning and 99.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:52:32,413 INFO L158 Benchmark]: Boogie Preprocessor took 79.85ms. Allocated memory is still 151.0MB. Free memory was 99.2MB in the beginning and 95.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:52:32,413 INFO L158 Benchmark]: RCFGBuilder took 1334.78ms. Allocated memory is still 151.0MB. Free memory was 95.7MB in the beginning and 88.5MB in the end (delta: 7.2MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2022-11-22 01:52:32,414 INFO L158 Benchmark]: TraceAbstraction took 159013.11ms. Allocated memory was 151.0MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 87.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-11-22 01:52:32,414 INFO L158 Benchmark]: Witness Printer took 162.66ms. Allocated memory is still 3.1GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-22 01:52:32,423 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.18ms. Allocated memory is still 121.6MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.57ms. Allocated memory is still 151.0MB. Free memory was 123.3MB in the beginning and 102.6MB in the end (delta: 20.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.53ms. Allocated memory is still 151.0MB. Free memory was 102.6MB in the beginning and 99.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.85ms. Allocated memory is still 151.0MB. Free memory was 99.2MB in the beginning and 95.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1334.78ms. Allocated memory is still 151.0MB. Free memory was 95.7MB in the beginning and 88.5MB in the end (delta: 7.2MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * TraceAbstraction took 159013.11ms. Allocated memory was 151.0MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 87.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 162.66ms. Allocated memory is still 3.1GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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: 158.9s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 126.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9421 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9421 mSDsluCounter, 17469 SdHoareTripleChecker+Invalid, 3.8s 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.2s 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: 9.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 29982 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 103 LocationsWithAnnotation, 117 PreInvPairs, 1140 NumberOfFragments, 7912 HoareAnnotationTreeSize, 117 FomulaSimplifications, 1035312 FormulaSimplificationTreeSizeReduction, 74.2s HoareSimplificationTime, 103 FomulaSimplificationsInter, 1685249 FormulaSimplificationTreeSizeReductionInter, 52.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s 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-22 01:52:32,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f050805c-6f0c-407a-97ea-37530e337e2b/bin/utaipan-g80aRyZoba/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