./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:52:06,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:52:06,865 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-28 23:52:06,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:52:06,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:52:06,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:52:06,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:52:06,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:52:06,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:52:06,897 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:52:06,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:52:06,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:52:06,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:52:06,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:52:06,900 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:52:06,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:52:06,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:52:06,901 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:52:06,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:52:06,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:52:06,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:52:06,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:52:06,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:52:06,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:52:06,905 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-28 23:52:06,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:52:06,906 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:52:06,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:52:06,907 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:52:06,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:52:06,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:52:06,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:52:06,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:52:06,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:52:06,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:52:06,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:52:06,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:52:06,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:52:06,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:52:06,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:52:06,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:52:06,910 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:52:06,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:52:06,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:52:06,911 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/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_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer 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 [2023-11-28 23:52:07,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:52:07,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:52:07,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:52:07,192 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:52:07,192 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:52:07,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2023-11-28 23:52:09,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:52:10,154 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:52:10,154 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2023-11-28 23:52:10,167 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/data/4e1a56d1e/bd1007744a3240039c90221b9892010d/FLAGce7ea5a43 [2023-11-28 23:52:10,181 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/data/4e1a56d1e/bd1007744a3240039c90221b9892010d [2023-11-28 23:52:10,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:52:10,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:52:10,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:52:10,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:52:10,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:52:10,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1621547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10, skipping insertion in model container [2023-11-28 23:52:10,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,252 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:52:10,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:52:10,502 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:52:10,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:52:10,594 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:52:10,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10 WrapperNode [2023-11-28 23:52:10,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:52:10,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:52:10,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:52:10,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:52:10,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,656 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 860 [2023-11-28 23:52:10,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:52:10,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:52:10,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:52:10,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:52:10,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,685 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 23:52:10,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:52:10,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:52:10,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:52:10,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:52:10,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (1/1) ... [2023-11-28 23:52:10,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:52:10,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:52:10,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:52:10,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:52:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:52:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:52:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-28 23:52:10,792 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-28 23:52:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:52:10,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:52:10,891 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:52:10,893 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:52:11,481 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:52:11,542 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:52:11,542 INFO L309 CfgBuilder]: Removed 13 assume(true) statements. [2023-11-28 23:52:11,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:11 BoogieIcfgContainer [2023-11-28 23:52:11,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:52:11,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:52:11,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:52:11,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:52:11,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:52:10" (1/3) ... [2023-11-28 23:52:11,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445bcbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:52:11, skipping insertion in model container [2023-11-28 23:52:11,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:10" (2/3) ... [2023-11-28 23:52:11,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445bcbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:52:11, skipping insertion in model container [2023-11-28 23:52:11,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:11" (3/3) ... [2023-11-28 23:52:11,552 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2023-11-28 23:52:11,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:52:11,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-28 23:52:11,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:52:11,624 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4a232a42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:52:11,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-28 23:52:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 246 states have (on average 1.9390243902439024) internal successors, (477), 259 states have internal predecessors, (477), 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) [2023-11-28 23:52:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-28 23:52:11,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:11,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:11,638 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)] === [2023-11-28 23:52:11,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1819186772, now seen corresponding path program 1 times [2023-11-28 23:52:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235155133] [2023-11-28 23:52:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235155133] [2023-11-28 23:52:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235155133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:11,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:52:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23798075] [2023-11-28 23:52:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:11,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:11,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:11,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:11,933 INFO L87 Difference]: Start difference. First operand has 261 states, 246 states have (on average 1.9390243902439024) internal successors, (477), 259 states have internal predecessors, (477), 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.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2023-11-28 23:52:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:12,274 INFO L93 Difference]: Finished difference Result 692 states and 1285 transitions. [2023-11-28 23:52:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2023-11-28 23:52:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:12,289 INFO L225 Difference]: With dead ends: 692 [2023-11-28 23:52:12,289 INFO L226 Difference]: Without dead ends: 419 [2023-11-28 23:52:12,294 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 [2023-11-28 23:52:12,297 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 253 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:12,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 724 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 23:52:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-11-28 23:52:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2023-11-28 23:52:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 403 states have (on average 1.6277915632754343) internal successors, (656), 410 states have internal predecessors, (656), 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) [2023-11-28 23:52:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 656 transitions. [2023-11-28 23:52:12,358 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 656 transitions. Word has length 17 [2023-11-28 23:52:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:12,359 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 656 transitions. [2023-11-28 23:52:12,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2023-11-28 23:52:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 656 transitions. [2023-11-28 23:52:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-28 23:52:12,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:12,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:12,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:52:12,361 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)] === [2023-11-28 23:52:12,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1559094643, now seen corresponding path program 1 times [2023-11-28 23:52:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:12,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177653932] [2023-11-28 23:52:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177653932] [2023-11-28 23:52:12,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177653932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:12,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:12,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:52:12,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11379080] [2023-11-28 23:52:12,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:12,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:12,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:12,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:12,434 INFO L87 Difference]: Start difference. First operand 411 states and 656 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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) [2023-11-28 23:52:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:12,535 INFO L93 Difference]: Finished difference Result 1050 states and 1684 transitions. [2023-11-28 23:52:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2023-11-28 23:52:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:12,540 INFO L225 Difference]: With dead ends: 1050 [2023-11-28 23:52:12,540 INFO L226 Difference]: Without dead ends: 652 [2023-11-28 23:52:12,542 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 [2023-11-28 23:52:12,543 INFO L413 NwaCegarLoop]: 606 mSDtfsCounter, 237 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:12,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 992 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-11-28 23:52:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2023-11-28 23:52:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 641 states have (on average 1.606864274570983) internal successors, (1030), 648 states have internal predecessors, (1030), 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) [2023-11-28 23:52:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1030 transitions. [2023-11-28 23:52:12,582 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1030 transitions. Word has length 21 [2023-11-28 23:52:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:12,582 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1030 transitions. [2023-11-28 23:52:12,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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) [2023-11-28 23:52:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1030 transitions. [2023-11-28 23:52:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-28 23:52:12,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:12,586 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] [2023-11-28 23:52:12,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:52:12,587 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)] === [2023-11-28 23:52:12,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1818365021, now seen corresponding path program 1 times [2023-11-28 23:52:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466562658] [2023-11-28 23:52:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466562658] [2023-11-28 23:52:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466562658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:12,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:12,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012073720] [2023-11-28 23:52:12,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:12,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:12,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:12,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:12,699 INFO L87 Difference]: Start difference. First operand 649 states and 1030 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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) [2023-11-28 23:52:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:13,250 INFO L93 Difference]: Finished difference Result 1784 states and 2890 transitions. [2023-11-28 23:52:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:52:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2023-11-28 23:52:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:13,258 INFO L225 Difference]: With dead ends: 1784 [2023-11-28 23:52:13,259 INFO L226 Difference]: Without dead ends: 1148 [2023-11-28 23:52:13,260 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 [2023-11-28 23:52:13,262 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 1090 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:13,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1357 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 23:52:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2023-11-28 23:52:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 991. [2023-11-28 23:52:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 983 states have (on average 1.6439471007121058) internal successors, (1616), 990 states have internal predecessors, (1616), 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) [2023-11-28 23:52:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1616 transitions. [2023-11-28 23:52:13,305 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1616 transitions. Word has length 50 [2023-11-28 23:52:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:13,306 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 1616 transitions. [2023-11-28 23:52:13,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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) [2023-11-28 23:52:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1616 transitions. [2023-11-28 23:52:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-28 23:52:13,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:13,310 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, 1, 1] [2023-11-28 23:52:13,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:52:13,310 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)] === [2023-11-28 23:52:13,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:13,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1919318182, now seen corresponding path program 1 times [2023-11-28 23:52:13,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:13,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747362565] [2023-11-28 23:52:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:13,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747362565] [2023-11-28 23:52:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747362565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672570626] [2023-11-28 23:52:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:13,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:13,402 INFO L87 Difference]: Start difference. First operand 991 states and 1616 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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) [2023-11-28 23:52:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:13,635 INFO L93 Difference]: Finished difference Result 2476 states and 4030 transitions. [2023-11-28 23:52:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2023-11-28 23:52:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:13,644 INFO L225 Difference]: With dead ends: 2476 [2023-11-28 23:52:13,645 INFO L226 Difference]: Without dead ends: 1498 [2023-11-28 23:52:13,646 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 [2023-11-28 23:52:13,648 INFO L413 NwaCegarLoop]: 594 mSDtfsCounter, 470 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:13,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1156 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 23:52:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2023-11-28 23:52:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1375. [2023-11-28 23:52:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1367 states have (on average 1.6356986100950988) internal successors, (2236), 1374 states have internal predecessors, (2236), 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) [2023-11-28 23:52:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2236 transitions. [2023-11-28 23:52:13,711 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2236 transitions. Word has length 53 [2023-11-28 23:52:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:13,712 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 2236 transitions. [2023-11-28 23:52:13,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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) [2023-11-28 23:52:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2236 transitions. [2023-11-28 23:52:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-28 23:52:13,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:13,715 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, 1, 1] [2023-11-28 23:52:13,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:52:13,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-28 23:52:13,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1955608190, now seen corresponding path program 1 times [2023-11-28 23:52:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:13,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962525594] [2023-11-28 23:52:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:13,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962525594] [2023-11-28 23:52:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962525594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:13,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690941058] [2023-11-28 23:52:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:13,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:13,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:13,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:13,809 INFO L87 Difference]: Start difference. First operand 1375 states and 2236 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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) [2023-11-28 23:52:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:14,263 INFO L93 Difference]: Finished difference Result 4274 states and 6819 transitions. [2023-11-28 23:52:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2023-11-28 23:52:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:14,280 INFO L225 Difference]: With dead ends: 4274 [2023-11-28 23:52:14,280 INFO L226 Difference]: Without dead ends: 2909 [2023-11-28 23:52:14,283 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 [2023-11-28 23:52:14,284 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 652 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:14,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 966 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 23:52:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2023-11-28 23:52:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2589. [2023-11-28 23:52:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2581 states have (on average 1.6017047655947307) internal successors, (4134), 2588 states have internal predecessors, (4134), 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) [2023-11-28 23:52:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4134 transitions. [2023-11-28 23:52:14,406 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4134 transitions. Word has length 65 [2023-11-28 23:52:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:14,406 INFO L495 AbstractCegarLoop]: Abstraction has 2589 states and 4134 transitions. [2023-11-28 23:52:14,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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) [2023-11-28 23:52:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4134 transitions. [2023-11-28 23:52:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-28 23:52:14,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:14,409 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, 1, 1] [2023-11-28 23:52:14,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:52:14,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-28 23:52:14,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash 8439650, now seen corresponding path program 1 times [2023-11-28 23:52:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:14,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057467759] [2023-11-28 23:52:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057467759] [2023-11-28 23:52:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057467759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:52:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505893661] [2023-11-28 23:52:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:14,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:14,466 INFO L87 Difference]: Start difference. First operand 2589 states and 4134 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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) [2023-11-28 23:52:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:14,638 INFO L93 Difference]: Finished difference Result 5684 states and 9202 transitions. [2023-11-28 23:52:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:14,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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 65 [2023-11-28 23:52:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:14,657 INFO L225 Difference]: With dead ends: 5684 [2023-11-28 23:52:14,658 INFO L226 Difference]: Without dead ends: 3107 [2023-11-28 23:52:14,662 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 [2023-11-28 23:52:14,663 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 345 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:14,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 625 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:52:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2023-11-28 23:52:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2814. [2023-11-28 23:52:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2806 states have (on average 1.636136849607983) internal successors, (4591), 2813 states have internal predecessors, (4591), 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) [2023-11-28 23:52:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 4591 transitions. [2023-11-28 23:52:14,808 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 4591 transitions. Word has length 65 [2023-11-28 23:52:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:14,809 INFO L495 AbstractCegarLoop]: Abstraction has 2814 states and 4591 transitions. [2023-11-28 23:52:14,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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) [2023-11-28 23:52:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 4591 transitions. [2023-11-28 23:52:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-28 23:52:14,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:14,814 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, 1, 1] [2023-11-28 23:52:14,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:52:14,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-28 23:52:14,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash -724114766, now seen corresponding path program 1 times [2023-11-28 23:52:14,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:14,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355752730] [2023-11-28 23:52:14,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:14,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:14,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:14,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355752730] [2023-11-28 23:52:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355752730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:14,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:52:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899264614] [2023-11-28 23:52:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:14,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:14,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:14,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:14,877 INFO L87 Difference]: Start difference. First operand 2814 states and 4591 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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) [2023-11-28 23:52:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:15,127 INFO L93 Difference]: Finished difference Result 6170 states and 10052 transitions. [2023-11-28 23:52:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:15,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 80 [2023-11-28 23:52:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:15,146 INFO L225 Difference]: With dead ends: 6170 [2023-11-28 23:52:15,146 INFO L226 Difference]: Without dead ends: 3367 [2023-11-28 23:52:15,150 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 [2023-11-28 23:52:15,151 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 179 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:15,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 761 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2023-11-28 23:52:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3361. [2023-11-28 23:52:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3361 states, 3353 states have (on average 1.6230241574709217) internal successors, (5442), 3360 states have internal predecessors, (5442), 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) [2023-11-28 23:52:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 5442 transitions. [2023-11-28 23:52:15,308 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 5442 transitions. Word has length 80 [2023-11-28 23:52:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:15,309 INFO L495 AbstractCegarLoop]: Abstraction has 3361 states and 5442 transitions. [2023-11-28 23:52:15,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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) [2023-11-28 23:52:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 5442 transitions. [2023-11-28 23:52:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-28 23:52:15,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:15,316 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 23:52:15,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:52:15,316 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)] === [2023-11-28 23:52:15,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 30332474, now seen corresponding path program 1 times [2023-11-28 23:52:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663278887] [2023-11-28 23:52:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:52:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:15,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663278887] [2023-11-28 23:52:15,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663278887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:15,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:15,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:52:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539971306] [2023-11-28 23:52:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:15,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:15,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:15,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:15,404 INFO L87 Difference]: Start difference. First operand 3361 states and 5442 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2023-11-28 23:52:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:15,859 INFO L93 Difference]: Finished difference Result 6497 states and 10536 transitions. [2023-11-28 23:52:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:52:15,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 90 [2023-11-28 23:52:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:15,879 INFO L225 Difference]: With dead ends: 6497 [2023-11-28 23:52:15,879 INFO L226 Difference]: Without dead ends: 3553 [2023-11-28 23:52:15,883 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 [2023-11-28 23:52:15,884 INFO L413 NwaCegarLoop]: 610 mSDtfsCounter, 552 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:15,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1313 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 23:52:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2023-11-28 23:52:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3499. [2023-11-28 23:52:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3491 states have (on average 1.6181609853910055) internal successors, (5649), 3498 states have internal predecessors, (5649), 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) [2023-11-28 23:52:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5649 transitions. [2023-11-28 23:52:16,038 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 5649 transitions. Word has length 90 [2023-11-28 23:52:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:16,039 INFO L495 AbstractCegarLoop]: Abstraction has 3499 states and 5649 transitions. [2023-11-28 23:52:16,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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) [2023-11-28 23:52:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 5649 transitions. [2023-11-28 23:52:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-28 23:52:16,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:16,045 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] [2023-11-28 23:52:16,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:52:16,046 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)] === [2023-11-28 23:52:16,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -64324492, now seen corresponding path program 1 times [2023-11-28 23:52:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488759] [2023-11-28 23:52:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488759] [2023-11-28 23:52:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:16,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63363324] [2023-11-28 23:52:16,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:16,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:16,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:16,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:16,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:16,111 INFO L87 Difference]: Start difference. First operand 3499 states and 5649 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2023-11-28 23:52:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:16,492 INFO L93 Difference]: Finished difference Result 8155 states and 13216 transitions. [2023-11-28 23:52:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:16,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90 [2023-11-28 23:52:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:16,519 INFO L225 Difference]: With dead ends: 8155 [2023-11-28 23:52:16,520 INFO L226 Difference]: Without dead ends: 4818 [2023-11-28 23:52:16,525 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 [2023-11-28 23:52:16,526 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 235 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:16,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 778 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 23:52:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2023-11-28 23:52:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3840. [2023-11-28 23:52:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3832 states have (on average 1.5443632567849688) internal successors, (5918), 3839 states have internal predecessors, (5918), 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) [2023-11-28 23:52:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 5918 transitions. [2023-11-28 23:52:16,688 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 5918 transitions. Word has length 90 [2023-11-28 23:52:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:16,689 INFO L495 AbstractCegarLoop]: Abstraction has 3840 states and 5918 transitions. [2023-11-28 23:52:16,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2023-11-28 23:52:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 5918 transitions. [2023-11-28 23:52:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-28 23:52:16,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:16,692 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] [2023-11-28 23:52:16,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 23:52:16,693 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)] === [2023-11-28 23:52:16,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -995861156, now seen corresponding path program 1 times [2023-11-28 23:52:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:16,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166880190] [2023-11-28 23:52:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:16,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166880190] [2023-11-28 23:52:16,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166880190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:16,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:16,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:52:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8232994] [2023-11-28 23:52:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:16,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:16,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:16,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:16,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:16,773 INFO L87 Difference]: Start difference. First operand 3840 states and 5918 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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) [2023-11-28 23:52:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:16,918 INFO L93 Difference]: Finished difference Result 7508 states and 11604 transitions. [2023-11-28 23:52:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:16,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 [2023-11-28 23:52:16,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:16,937 INFO L225 Difference]: With dead ends: 7508 [2023-11-28 23:52:16,937 INFO L226 Difference]: Without dead ends: 3840 [2023-11-28 23:52:16,943 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 [2023-11-28 23:52:16,944 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 319 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:16,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 394 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2023-11-28 23:52:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3840. [2023-11-28 23:52:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3832 states have (on average 1.513830897703549) internal successors, (5801), 3839 states have internal predecessors, (5801), 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) [2023-11-28 23:52:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 5801 transitions. [2023-11-28 23:52:17,085 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 5801 transitions. Word has length 98 [2023-11-28 23:52:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:17,085 INFO L495 AbstractCegarLoop]: Abstraction has 3840 states and 5801 transitions. [2023-11-28 23:52:17,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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) [2023-11-28 23:52:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 5801 transitions. [2023-11-28 23:52:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-28 23:52:17,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:17,087 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-11-28 23:52:17,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:52:17,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-28 23:52:17,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1797752544, now seen corresponding path program 1 times [2023-11-28 23:52:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:17,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770605739] [2023-11-28 23:52:17,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:17,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-28 23:52:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770605739] [2023-11-28 23:52:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770605739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929073568] [2023-11-28 23:52:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:17,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:17,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:17,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:17,118 INFO L87 Difference]: Start difference. First operand 3840 states and 5801 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) [2023-11-28 23:52:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:17,342 INFO L93 Difference]: Finished difference Result 9972 states and 15137 transitions. [2023-11-28 23:52:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:17,342 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 98 [2023-11-28 23:52:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:17,354 INFO L225 Difference]: With dead ends: 9972 [2023-11-28 23:52:17,354 INFO L226 Difference]: Without dead ends: 6143 [2023-11-28 23:52:17,360 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 [2023-11-28 23:52:17,361 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 302 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:17,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 931 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2023-11-28 23:52:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5659. [2023-11-28 23:52:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5659 states, 5651 states have (on average 1.51353742700407) internal successors, (8553), 5658 states have internal predecessors, (8553), 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) [2023-11-28 23:52:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5659 states to 5659 states and 8553 transitions. [2023-11-28 23:52:17,608 INFO L78 Accepts]: Start accepts. Automaton has 5659 states and 8553 transitions. Word has length 98 [2023-11-28 23:52:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:17,608 INFO L495 AbstractCegarLoop]: Abstraction has 5659 states and 8553 transitions. [2023-11-28 23:52:17,609 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) [2023-11-28 23:52:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5659 states and 8553 transitions. [2023-11-28 23:52:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-28 23:52:17,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:17,612 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, 1, 1] [2023-11-28 23:52:17,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:52:17,613 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)] === [2023-11-28 23:52:17,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash 800851664, now seen corresponding path program 1 times [2023-11-28 23:52:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597550681] [2023-11-28 23:52:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-28 23:52:17,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:17,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597550681] [2023-11-28 23:52:17,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597550681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:17,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:17,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:52:17,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793089817] [2023-11-28 23:52:17,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:17,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:17,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:17,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:17,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:17,684 INFO L87 Difference]: Start difference. First operand 5659 states and 8553 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) [2023-11-28 23:52:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:18,268 INFO L93 Difference]: Finished difference Result 14902 states and 22342 transitions. [2023-11-28 23:52:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:52:18,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 100 [2023-11-28 23:52:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:18,287 INFO L225 Difference]: With dead ends: 14902 [2023-11-28 23:52:18,287 INFO L226 Difference]: Without dead ends: 9140 [2023-11-28 23:52:18,296 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 [2023-11-28 23:52:18,297 INFO L413 NwaCegarLoop]: 548 mSDtfsCounter, 609 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:18,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1196 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 23:52:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9140 states. [2023-11-28 23:52:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9140 to 8014. [2023-11-28 23:52:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8014 states, 8006 states have (on average 1.4861353984511616) internal successors, (11898), 8013 states have internal predecessors, (11898), 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) [2023-11-28 23:52:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8014 states to 8014 states and 11898 transitions. [2023-11-28 23:52:18,632 INFO L78 Accepts]: Start accepts. Automaton has 8014 states and 11898 transitions. Word has length 100 [2023-11-28 23:52:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:18,632 INFO L495 AbstractCegarLoop]: Abstraction has 8014 states and 11898 transitions. [2023-11-28 23:52:18,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) [2023-11-28 23:52:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8014 states and 11898 transitions. [2023-11-28 23:52:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-28 23:52:18,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:18,636 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] [2023-11-28 23:52:18,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 23:52:18,637 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)] === [2023-11-28 23:52:18,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1073806155, now seen corresponding path program 1 times [2023-11-28 23:52:18,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:18,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651245096] [2023-11-28 23:52:18,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:18,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:18,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651245096] [2023-11-28 23:52:18,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651245096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:18,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:52:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448357581] [2023-11-28 23:52:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:18,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:52:18,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:52:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:18,720 INFO L87 Difference]: Start difference. First operand 8014 states and 11898 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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) [2023-11-28 23:52:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:19,380 INFO L93 Difference]: Finished difference Result 22469 states and 33367 transitions. [2023-11-28 23:52:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:52:19,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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 107 [2023-11-28 23:52:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:19,414 INFO L225 Difference]: With dead ends: 22469 [2023-11-28 23:52:19,414 INFO L226 Difference]: Without dead ends: 14757 [2023-11-28 23:52:19,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:52:19,429 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 608 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:19,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 2062 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14757 states. [2023-11-28 23:52:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14757 to 13062. [2023-11-28 23:52:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13062 states, 13054 states have (on average 1.492186303048874) internal successors, (19479), 13061 states have internal predecessors, (19479), 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) [2023-11-28 23:52:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13062 states to 13062 states and 19479 transitions. [2023-11-28 23:52:19,910 INFO L78 Accepts]: Start accepts. Automaton has 13062 states and 19479 transitions. Word has length 107 [2023-11-28 23:52:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:19,911 INFO L495 AbstractCegarLoop]: Abstraction has 13062 states and 19479 transitions. [2023-11-28 23:52:19,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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) [2023-11-28 23:52:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 13062 states and 19479 transitions. [2023-11-28 23:52:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-28 23:52:19,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:19,914 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] [2023-11-28 23:52:19,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 23:52:19,914 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)] === [2023-11-28 23:52:19,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash -652909232, now seen corresponding path program 1 times [2023-11-28 23:52:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:19,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069038410] [2023-11-28 23:52:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-28 23:52:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069038410] [2023-11-28 23:52:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069038410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984969094] [2023-11-28 23:52:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:19,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:19,955 INFO L87 Difference]: Start difference. First operand 13062 states and 19479 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) 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) [2023-11-28 23:52:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:20,369 INFO L93 Difference]: Finished difference Result 25886 states and 38641 transitions. [2023-11-28 23:52:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:20,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) 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 109 [2023-11-28 23:52:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:20,392 INFO L225 Difference]: With dead ends: 25886 [2023-11-28 23:52:20,392 INFO L226 Difference]: Without dead ends: 12902 [2023-11-28 23:52:20,407 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 [2023-11-28 23:52:20,408 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 330 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:20,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 747 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2023-11-28 23:52:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 12866. [2023-11-28 23:52:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12866 states, 12858 states have (on average 1.446492456058485) internal successors, (18599), 12865 states have internal predecessors, (18599), 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) [2023-11-28 23:52:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12866 states to 12866 states and 18599 transitions. [2023-11-28 23:52:20,969 INFO L78 Accepts]: Start accepts. Automaton has 12866 states and 18599 transitions. Word has length 109 [2023-11-28 23:52:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:20,970 INFO L495 AbstractCegarLoop]: Abstraction has 12866 states and 18599 transitions. [2023-11-28 23:52:20,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) 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) [2023-11-28 23:52:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 12866 states and 18599 transitions. [2023-11-28 23:52:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-28 23:52:20,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:20,973 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] [2023-11-28 23:52:20,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 23:52:20,973 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)] === [2023-11-28 23:52:20,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash -722434754, now seen corresponding path program 1 times [2023-11-28 23:52:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260171316] [2023-11-28 23:52:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:52:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260171316] [2023-11-28 23:52:21,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260171316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:52:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508219299] [2023-11-28 23:52:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:21,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:52:21,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:52:21,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:52:21,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 23:52:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:21,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 23:52:21,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:52:21,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:21,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508219299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:21,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:52:21,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-28 23:52:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832121241] [2023-11-28 23:52:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:21,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:21,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:52:21,321 INFO L87 Difference]: Start difference. First operand 12866 states and 18599 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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) [2023-11-28 23:52:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:21,805 INFO L93 Difference]: Finished difference Result 24320 states and 35235 transitions. [2023-11-28 23:52:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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 [2023-11-28 23:52:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:21,817 INFO L225 Difference]: With dead ends: 24320 [2023-11-28 23:52:21,817 INFO L226 Difference]: Without dead ends: 11407 [2023-11-28 23:52:21,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:52:21,833 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 276 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:21,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 423 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:52:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11407 states. [2023-11-28 23:52:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11407 to 10632. [2023-11-28 23:52:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10632 states, 10624 states have (on average 1.4424887048192772) internal successors, (15325), 10631 states have internal predecessors, (15325), 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) [2023-11-28 23:52:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10632 states to 10632 states and 15325 transitions. [2023-11-28 23:52:22,226 INFO L78 Accepts]: Start accepts. Automaton has 10632 states and 15325 transitions. Word has length 109 [2023-11-28 23:52:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:22,226 INFO L495 AbstractCegarLoop]: Abstraction has 10632 states and 15325 transitions. [2023-11-28 23:52:22,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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) [2023-11-28 23:52:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 15325 transitions. [2023-11-28 23:52:22,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-28 23:52:22,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:22,229 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, 1, 1] [2023-11-28 23:52:22,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 23:52:22,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:52:22,435 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)] === [2023-11-28 23:52:22,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1797485791, now seen corresponding path program 1 times [2023-11-28 23:52:22,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:22,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366536034] [2023-11-28 23:52:22,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:22,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:52:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366536034] [2023-11-28 23:52:22,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366536034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:22,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:22,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595540935] [2023-11-28 23:52:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:22,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:22,544 INFO L87 Difference]: Start difference. First operand 10632 states and 15325 transitions. Second operand has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2023-11-28 23:52:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:23,233 INFO L93 Difference]: Finished difference Result 21839 states and 31435 transitions. [2023-11-28 23:52:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:52:23,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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 111 [2023-11-28 23:52:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:23,251 INFO L225 Difference]: With dead ends: 21839 [2023-11-28 23:52:23,251 INFO L226 Difference]: Without dead ends: 21835 [2023-11-28 23:52:23,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:23,255 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 703 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:23,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1220 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21835 states. [2023-11-28 23:52:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21835 to 19896. [2023-11-28 23:52:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19896 states, 19888 states have (on average 1.4528861625100564) internal successors, (28895), 19895 states have internal predecessors, (28895), 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) [2023-11-28 23:52:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19896 states to 19896 states and 28895 transitions. [2023-11-28 23:52:23,896 INFO L78 Accepts]: Start accepts. Automaton has 19896 states and 28895 transitions. Word has length 111 [2023-11-28 23:52:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:23,897 INFO L495 AbstractCegarLoop]: Abstraction has 19896 states and 28895 transitions. [2023-11-28 23:52:23,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2023-11-28 23:52:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 19896 states and 28895 transitions. [2023-11-28 23:52:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-28 23:52:23,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:23,899 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, 1, 1] [2023-11-28 23:52:23,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 23:52:23,899 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)] === [2023-11-28 23:52:23,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1887959299, now seen corresponding path program 1 times [2023-11-28 23:52:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104290221] [2023-11-28 23:52:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:52:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104290221] [2023-11-28 23:52:24,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104290221] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:52:24,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22167202] [2023-11-28 23:52:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:24,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:52:24,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:52:24,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:52:24,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 23:52:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:24,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:52:24,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-28 23:52:24,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22167202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:52:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2023-11-28 23:52:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081988577] [2023-11-28 23:52:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:24,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:24,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:24,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:52:24,197 INFO L87 Difference]: Start difference. First operand 19896 states and 28895 transitions. Second operand has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2023-11-28 23:52:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:24,844 INFO L93 Difference]: Finished difference Result 20296 states and 29418 transitions. [2023-11-28 23:52:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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 115 [2023-11-28 23:52:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:24,860 INFO L225 Difference]: With dead ends: 20296 [2023-11-28 23:52:24,861 INFO L226 Difference]: Without dead ends: 20295 [2023-11-28 23:52:24,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:52:24,864 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 307 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:24,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 812 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20295 states. [2023-11-28 23:52:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20295 to 19895. [2023-11-28 23:52:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19895 states, 19888 states have (on average 1.451830249396621) internal successors, (28874), 19894 states have internal predecessors, (28874), 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) [2023-11-28 23:52:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19895 states to 19895 states and 28874 transitions. [2023-11-28 23:52:25,431 INFO L78 Accepts]: Start accepts. Automaton has 19895 states and 28874 transitions. Word has length 115 [2023-11-28 23:52:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:25,431 INFO L495 AbstractCegarLoop]: Abstraction has 19895 states and 28874 transitions. [2023-11-28 23:52:25,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2023-11-28 23:52:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 19895 states and 28874 transitions. [2023-11-28 23:52:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 23:52:25,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:25,433 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, 1, 1] [2023-11-28 23:52:25,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 23:52:25,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:52:25,634 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)] === [2023-11-28 23:52:25,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1602803640, now seen corresponding path program 1 times [2023-11-28 23:52:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080231240] [2023-11-28 23:52:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:52:25,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080231240] [2023-11-28 23:52:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080231240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:52:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290896503] [2023-11-28 23:52:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:25,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:52:25,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:52:25,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:52:25,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 23:52:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:25,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 23:52:25,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-28 23:52:25,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:25,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290896503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:25,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:52:25,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-28 23:52:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552587971] [2023-11-28 23:52:25,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:25,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:25,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:25,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:52:25,844 INFO L87 Difference]: Start difference. First operand 19895 states and 28874 transitions. Second operand has 3 states, 2 states have (on average 54.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2023-11-28 23:52:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:26,360 INFO L93 Difference]: Finished difference Result 20263 states and 29365 transitions. [2023-11-28 23:52:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:26,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 54.0) internal successors, (108), 3 states have internal predecessors, (108), 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 116 [2023-11-28 23:52:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:26,376 INFO L225 Difference]: With dead ends: 20263 [2023-11-28 23:52:26,376 INFO L226 Difference]: Without dead ends: 20262 [2023-11-28 23:52:26,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:52:26,380 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 150 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:26,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 820 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:52:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20262 states. [2023-11-28 23:52:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20262 to 19894. [2023-11-28 23:52:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19894 states, 19888 states have (on average 1.4507743362831858) internal successors, (28853), 19893 states have internal predecessors, (28853), 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) [2023-11-28 23:52:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19894 states to 19894 states and 28853 transitions. [2023-11-28 23:52:26,861 INFO L78 Accepts]: Start accepts. Automaton has 19894 states and 28853 transitions. Word has length 116 [2023-11-28 23:52:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:26,861 INFO L495 AbstractCegarLoop]: Abstraction has 19894 states and 28853 transitions. [2023-11-28 23:52:26,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 54.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2023-11-28 23:52:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 19894 states and 28853 transitions. [2023-11-28 23:52:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-28 23:52:26,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:26,868 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, 1, 1] [2023-11-28 23:52:26,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 23:52:27,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:52:27,069 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)] === [2023-11-28 23:52:27,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 179457068, now seen corresponding path program 1 times [2023-11-28 23:52:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299908111] [2023-11-28 23:52:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-28 23:52:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299908111] [2023-11-28 23:52:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299908111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091343792] [2023-11-28 23:52:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:27,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:27,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:27,166 INFO L87 Difference]: Start difference. First operand 19894 states and 28853 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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) [2023-11-28 23:52:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:27,543 INFO L93 Difference]: Finished difference Result 23761 states and 34202 transitions. [2023-11-28 23:52:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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 194 [2023-11-28 23:52:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:27,547 INFO L225 Difference]: With dead ends: 23761 [2023-11-28 23:52:27,547 INFO L226 Difference]: Without dead ends: 3768 [2023-11-28 23:52:27,558 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 [2023-11-28 23:52:27,559 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 155 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:27,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 432 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 23:52:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2023-11-28 23:52:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 2962. [2023-11-28 23:52:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2956 states have (on average 1.1681326116373478) internal successors, (3453), 2961 states have internal predecessors, (3453), 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) [2023-11-28 23:52:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 3453 transitions. [2023-11-28 23:52:27,658 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 3453 transitions. Word has length 194 [2023-11-28 23:52:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:27,658 INFO L495 AbstractCegarLoop]: Abstraction has 2962 states and 3453 transitions. [2023-11-28 23:52:27,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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) [2023-11-28 23:52:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 3453 transitions. [2023-11-28 23:52:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-28 23:52:27,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:27,662 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, 1, 1] [2023-11-28 23:52:27,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 23:52:27,662 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)] === [2023-11-28 23:52:27,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1528977428, now seen corresponding path program 1 times [2023-11-28 23:52:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:27,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997923673] [2023-11-28 23:52:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 23:52:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997923673] [2023-11-28 23:52:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997923673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:52:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473519117] [2023-11-28 23:52:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:27,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:52:27,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:52:27,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:52:27,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-28 23:52:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:27,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:52:27,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 23:52:28,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:28,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473519117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:28,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:52:28,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-28 23:52:28,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824077622] [2023-11-28 23:52:28,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:28,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:52:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:28,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:52:28,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:52:28,117 INFO L87 Difference]: Start difference. First operand 2962 states and 3453 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 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) [2023-11-28 23:52:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:28,221 INFO L93 Difference]: Finished difference Result 3750 states and 4382 transitions. [2023-11-28 23:52:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:52:28,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 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 [2023-11-28 23:52:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:28,223 INFO L225 Difference]: With dead ends: 3750 [2023-11-28 23:52:28,223 INFO L226 Difference]: Without dead ends: 1476 [2023-11-28 23:52:28,224 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 [2023-11-28 23:52:28,224 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 283 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:28,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 561 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:52:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2023-11-28 23:52:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1474. [2023-11-28 23:52:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1472 states have (on average 1.156929347826087) internal successors, (1703), 1473 states have internal predecessors, (1703), 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) [2023-11-28 23:52:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1703 transitions. [2023-11-28 23:52:28,267 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1703 transitions. Word has length 209 [2023-11-28 23:52:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:28,267 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 1703 transitions. [2023-11-28 23:52:28,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 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) [2023-11-28 23:52:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1703 transitions. [2023-11-28 23:52:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-28 23:52:28,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:28,269 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, 1, 1, 1, 1, 1] [2023-11-28 23:52:28,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-28 23:52:28,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:52:28,470 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)] === [2023-11-28 23:52:28,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2026923084, now seen corresponding path program 1 times [2023-11-28 23:52:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:28,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107186180] [2023-11-28 23:52:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-28 23:52:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:28,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107186180] [2023-11-28 23:52:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107186180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:28,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:28,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:52:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863171614] [2023-11-28 23:52:28,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:28,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:52:28,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:28,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:52:28,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:28,585 INFO L87 Difference]: Start difference. First operand 1474 states and 1703 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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) [2023-11-28 23:52:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:28,707 INFO L93 Difference]: Finished difference Result 2057 states and 2387 transitions. [2023-11-28 23:52:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:52:28,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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 214 [2023-11-28 23:52:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:28,710 INFO L225 Difference]: With dead ends: 2057 [2023-11-28 23:52:28,710 INFO L226 Difference]: Without dead ends: 1499 [2023-11-28 23:52:28,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:52:28,711 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 203 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:28,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 953 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:52:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2023-11-28 23:52:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1438. [2023-11-28 23:52:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1436 states have (on average 1.144150417827298) internal successors, (1643), 1437 states have internal predecessors, (1643), 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) [2023-11-28 23:52:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1643 transitions. [2023-11-28 23:52:28,757 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1643 transitions. Word has length 214 [2023-11-28 23:52:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:28,758 INFO L495 AbstractCegarLoop]: Abstraction has 1438 states and 1643 transitions. [2023-11-28 23:52:28,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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) [2023-11-28 23:52:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1643 transitions. [2023-11-28 23:52:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-11-28 23:52:28,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:28,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:28,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 23:52:28,760 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)] === [2023-11-28 23:52:28,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1895039727, now seen corresponding path program 1 times [2023-11-28 23:52:28,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:52:28,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625552669] [2023-11-28 23:52:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:52:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-28 23:52:28,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:52:28,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625552669] [2023-11-28 23:52:28,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625552669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:28,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:28,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:52:28,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27620559] [2023-11-28 23:52:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:28,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:52:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:28,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:52:28,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:28,922 INFO L87 Difference]: Start difference. First operand 1438 states and 1643 transitions. Second operand has 5 states, 4 states have (on average 51.25) internal successors, (205), 5 states have internal predecessors, (205), 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) [2023-11-28 23:52:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:29,046 INFO L93 Difference]: Finished difference Result 1453 states and 1658 transitions. [2023-11-28 23:52:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:52:29,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 51.25) internal successors, (205), 5 states have internal predecessors, (205), 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 215 [2023-11-28 23:52:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:29,049 INFO L225 Difference]: With dead ends: 1453 [2023-11-28 23:52:29,049 INFO L226 Difference]: Without dead ends: 0 [2023-11-28 23:52:29,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:52:29,051 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 267 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:29,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 573 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:52:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-28 23:52:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-28 23:52:29,052 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) [2023-11-28 23:52:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-28 23:52:29,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 215 [2023-11-28 23:52:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:29,052 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-28 23:52:29,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 51.25) internal successors, (205), 5 states have internal predecessors, (205), 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) [2023-11-28 23:52:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-28 23:52:29,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-28 23:52:29,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-28 23:52:29,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-28 23:52:29,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-28 23:52:29,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-28 23:52:29,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-28 23:52:29,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-28 23:52:29,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-28 23:52:29,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-28 23:52:29,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 23:52:29,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-28 23:52:41,265 WARN L293 SmtUtils]: Spent 11.76s on a formula simplification. DAG size of input: 201 DAG size of output: 247 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-28 23:52:48,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2023-11-28 23:52:48,439 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 764 808) no Hoare annotation was computed. [2023-11-28 23:52:48,439 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 772 807) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 780 806) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point L829-2(lines 829 835) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point L829-3(lines 829 835) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 788 805) no Hoare annotation was computed. [2023-11-28 23:52:48,440 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 851 1112) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 796 804) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L902 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: true [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 129) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 364 372) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 818 826) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point $Ultimate##600(lines 1271 1315) no Hoare annotation was computed. [2023-11-28 23:52:48,441 INFO L899 garLoopResultBuilder]: For program point $Ultimate##606(lines 1279 1314) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1287 1313) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1295 1312) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1303 1311) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 85 844) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point L174(lines 144 175) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 128) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point $Ultimate##636(lines 1325 1333) no Hoare annotation was computed. [2023-11-28 23:52:48,442 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2023-11-28 23:52:48,443 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2023-11-28 23:52:48,443 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2023-11-28 23:52:48,443 INFO L895 garLoopResultBuilder]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse10 (not (= ~c_empty_req~0 0))) (.cse12 (= ~a_t~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse11 (= ~m_run_pc~0 6)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse9 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 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 .cse3 .cse4 .cse5 .cse6) (and .cse7 (not .cse3) .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse0 .cse8 .cse9 .cse2 (<= 0 ~a_t~0) .cse4 .cse5 .cse6))) [2023-11-28 23:52:48,443 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2023-11-28 23:52:48,443 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-11-28 23:52:48,443 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 127) no Hoare annotation was computed. [2023-11-28 23:52:48,443 INFO L899 garLoopResultBuilder]: For program point L904(lines 878 905) no Hoare annotation was computed. [2023-11-28 23:52:48,444 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)) (.cse3 (= ~req_tt_a~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse10 (not (= ~s_run_st~0 0))) (.cse2 (= ~s_run_pc~0 0)) (.cse4 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse4 (= 2 ~s_run_pc~0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9))) [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 126) no Hoare annotation was computed. [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2023-11-28 23:52:48,444 INFO L899 garLoopResultBuilder]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L974(lines 974 978) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 125) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L317(lines 287 318) no Hoare annotation was computed. [2023-11-28 23:52:48,445 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 124) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L715(lines 715 719) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 572 616) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2023-11-28 23:52:48,446 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 935 961) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 446 454) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L524(lines 494 525) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 468 476) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2023-11-28 23:52:48,447 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point L131(lines 101 843) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 386 394) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L895 garLoopResultBuilder]: At program point L528-2(lines 528 556) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 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 (not (= ~c_empty_req~0 0))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 414 458) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2023-11-28 23:52:48,448 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 422 457) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 430 456) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 919 963) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L895 garLoopResultBuilder]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse12 (= ~m_run_pc~0 3)) (.cse13 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse14 (= 2 ~s_run_pc~0)) (.cse11 (<= 0 ~a_t~0)) (.cse10 (not (= ~s_run_st~0 0))) (.cse2 (= ~s_run_pc~0 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse1 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12 .cse13) (and (not .cse14) .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12 .cse13) (and .cse0 .cse1 .cse10 .cse3 .cse4 .cse5 .cse14 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 927 962) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 438 455) no Hoare annotation was computed. [2023-11-28 23:52:48,449 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L902 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: true [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 66 69) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 580 615) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 801) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2023-11-28 23:52:48,450 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##550(lines 1041 1085) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 588 614) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 596 613) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point L864(lines 864 872) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##556(lines 1049 1084) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1057 1083) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 604 612) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point L667(lines 637 668) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 943 960) no Hoare annotation was computed. [2023-11-28 23:52:48,451 INFO L899 garLoopResultBuilder]: For program point L867(lines 867 871) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 951 959) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point L207(lines 177 208) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 973 981) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2023-11-28 23:52:48,452 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 1001 1025) the Hoare annotation is: (let ((.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_req_type~0 0)) (.cse10 (= ~m_run_pc~0 6)) (.cse7 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse9 .cse7 .cse0 .cse2 .cse4 .cse8 .cse10 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse10 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse9 .cse7 .cse0 .cse2 .cse3 .cse4 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L737(lines 737 741) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L143-1(line 143) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2023-11-28 23:52:48,453 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 281) no Hoare annotation was computed. [2023-11-28 23:52:48,454 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)) (.cse3 (= ~req_tt_a~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse11 (= ~s_run_pc~0 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 2 ~s_run_pc~0) .cse6 (<= 0 ~a_t~0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) .cse9 .cse10) (and .cse2 .cse11 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10))) [2023-11-28 23:52:48,454 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 74 82) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2023-11-28 23:52:48,454 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2023-11-28 23:52:48,455 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1255 1344) the Hoare annotation is: (let ((.cse14 (= 2 ~s_run_pc~0))) (let ((.cse1 (= ~s_run_pc~0 0)) (.cse13 (not (= ~c_m_lock~0 1))) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (= ~m_run_pc~0 0)) (.cse7 (= ~c_req_type~0 0)) (.cse11 (= ~m_run_pc~0 6)) (.cse16 (not .cse14)) (.cse9 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_empty_req~0 0))) (.cse12 (= ~a_t~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse3 (= ~m_run_st~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12) (and .cse7 .cse8 .cse0 .cse9 .cse13 .cse3 .cse14 .cse2 .cse4 .cse5 .cse12 .cse15) (and .cse7 .cse16 .cse8 .cse9 .cse4 .cse5 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse5 .cse15) (and .cse8 .cse0 .cse9 .cse10 .cse3 .cse14 .cse4 .cse6 .cse12) (and .cse7 .cse8 .cse1 .cse9 .cse13 .cse2 .cse4 .cse5 .cse12 .cse15) (and .cse7 .cse16 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse0 .cse3 .cse14 .cse4 .cse5 .cse11) (and .cse16 .cse8 (= ~c_req_type~0 1) .cse9 .cse10 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse3 .cse14 .cse4 .cse5 .cse6)))) [2023-11-28 23:52:48,455 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2023-11-28 23:52:48,455 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2023-11-28 23:52:48,455 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2023-11-28 23:52:48,455 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 876 1106) the Hoare annotation is: (let ((.cse8 (= ~m_run_pc~0 6)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (not (= 2 ~s_run_pc~0))) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse4 .cse8 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse8 .cse6) (and .cse7 .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse3 (not (= ~c_m_lock~0 1)) (= ~c_empty_req~0 1) .cse4 (= ~c_empty_rsp~0 1) .cse6 (= ~m_run_pc~0 0)) (and .cse1 .cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse4 .cse5 .cse6))) [2023-11-28 23:52:48,455 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2023-11-28 23:52:48,455 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2023-11-28 23:52:48,455 INFO L899 garLoopResultBuilder]: For program point L481(lines 133 482) no Hoare annotation was computed. [2023-11-28 23:52:48,455 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-11-28 23:52:48,456 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2023-11-28 23:52:48,456 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2023-11-28 23:52:48,456 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1167 1350) no Hoare annotation was computed. [2023-11-28 23:52:48,456 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 879 903) the Hoare annotation is: (let ((.cse8 (= ~m_run_pc~0 6)) (.cse4 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse1 (= ~req_tt_a~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse3 (= ~a_t~0 0))) (or (and .cse0 (= ~c_req_type~0 1) .cse1 .cse2 (= ~m_run_pc~0 3) .cse3) (and .cse4 .cse0 .cse5 .cse1 (not .cse6) .cse2 .cse7 .cse8 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse8 .cse3 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse8 .cse3) (and .cse4 .cse0 .cse5 .cse1 (not (= ~c_m_lock~0 1)) .cse6 .cse2 .cse7 .cse3 (= ~m_run_pc~0 0)))) [2023-11-28 23:52:48,456 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2023-11-28 23:52:48,456 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2023-11-28 23:52:48,456 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2023-11-28 23:52:48,456 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1))) (let ((.cse4 (not (= ~c_m_lock~0 1))) (.cse10 (= ~m_run_pc~0 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse16 (not .cse6)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_req_type~0 0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse11 (= ~m_run_pc~0 6)) (.cse17 (not .cse5)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse12 (not (= ~c_empty_req~0 0))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~m_run_pc~0 3)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse5 .cse7 .cse8 .cse11) (and .cse1 .cse2 .cse3 .cse12 .cse5 .cse7 .cse13 .cse9) (and .cse2 .cse14 .cse4 .cse6 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse15 .cse14 .cse3 .cse7 .cse8 .cse13 .cse9) (and .cse1 .cse15 .cse3 .cse16 .cse5 .cse7 .cse8 .cse13 .cse9) (and .cse0 .cse17 .cse1 .cse3 .cse12 .cse7 .cse11 .cse9) (and .cse1 .cse2 .cse5 .cse7 .cse8 .cse13) (and .cse2 .cse14 .cse16 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse3 .cse16 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse7 .cse11 .cse9) (and .cse17 .cse1 .cse15 .cse3 .cse12 .cse7 .cse13 .cse9)))) [2023-11-28 23:52:48,456 INFO L902 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: true [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2023-11-28 23:52:48,457 INFO L895 garLoopResultBuilder]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse0 (not .cse13)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse12 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse9 (<= 0 ~a_t~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|))) (or (and (= ~c_req_type~0 0) .cse0 .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse10 .cse11) (and .cse1 .cse12 .cse3 .cse4 .cse13 .cse9 .cse5 .cse6 .cse7 .cse8)))) [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 332 376) no Hoare annotation was computed. [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2023-11-28 23:52:48,457 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse3 (not (= ~c_empty_req~0 0))) (.cse9 (= ~c_req_type~0 1)) (.cse10 (= ~s_run_pc~0 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse6 (= ~m_run_pc~0 3)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse11 (not (= ~c_empty_req~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (not .cse4) .cse0 .cse9 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse10 .cse11 .cse5 .cse12) (and .cse0 .cse9 .cse2 .cse11 .cse4 (<= 0 ~a_t~0) .cse5 .cse12 .cse8) (and .cse0 .cse9 .cse10 .cse2 .cse11 .cse5 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse5 .cse12 .cse6) (and .cse0 .cse1 .cse11 .cse4 .cse5 .cse12))) [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 340 375) no Hoare annotation was computed. [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 348 374) no Hoare annotation was computed. [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2023-11-28 23:52:48,457 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1244 1252) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 356 373) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 956) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1222 1230) no Hoare annotation was computed. [2023-11-28 23:52:48,458 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1214 1231) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 238 264) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 706 723) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 714 722) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 246 263) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1206 1232) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point L557(lines 527 558) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 254 262) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1198 1233) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 736 744) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-28 23:52:48,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1190 1234) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 276 284) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1065 1082) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1113 1166) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 626 634) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1073 1081) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 631) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 523) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2023-11-28 23:52:48,460 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point $Ultimate##586(lines 1095 1103) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 682 726) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 222 266) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 690 725) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 230 265) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 698 724) no Hoare annotation was computed. [2023-11-28 23:52:48,461 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1000 1027) no Hoare annotation was computed. [2023-11-28 23:52:48,462 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-11-28 23:52:48,462 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-11-28 23:52:48,464 INFO L445 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] [2023-11-28 23:52:48,466 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:52:48,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:52:48 BoogieIcfgContainer [2023-11-28 23:52:48,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:52:48,502 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:52:48,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:52:48,503 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:52:48,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:11" (3/4) ... [2023-11-28 23:52:48,505 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-28 23:52:48,509 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-28 23:52:48,526 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-28 23:52:48,528 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-28 23:52:48,530 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-28 23:52:48,531 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-28 23:52:48,728 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-28 23:52:48,729 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-28 23:52:48,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:52:48,730 INFO L158 Benchmark]: Toolchain (without parser) took 38544.48ms. Allocated memory was 151.0MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 113.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 495.3MB. Max. memory is 16.1GB. [2023-11-28 23:52:48,730 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:52:48,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.37ms. Allocated memory is still 151.0MB. Free memory was 113.1MB in the beginning and 92.4MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-28 23:52:48,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.37ms. Allocated memory is still 151.0MB. Free memory was 92.4MB in the beginning and 88.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:52:48,731 INFO L158 Benchmark]: Boogie Preprocessor took 60.46ms. Allocated memory is still 151.0MB. Free memory was 88.9MB in the beginning and 84.4MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-28 23:52:48,732 INFO L158 Benchmark]: RCFGBuilder took 825.30ms. Allocated memory is still 151.0MB. Free memory was 84.4MB in the beginning and 70.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 23:52:48,732 INFO L158 Benchmark]: TraceAbstraction took 36955.94ms. Allocated memory was 151.0MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 70.1MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-28 23:52:48,732 INFO L158 Benchmark]: Witness Printer took 226.87ms. Allocated memory is still 2.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-28 23:52:48,734 INFO L338 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 109.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.37ms. Allocated memory is still 151.0MB. Free memory was 113.1MB in the beginning and 92.4MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.37ms. Allocated memory is still 151.0MB. Free memory was 92.4MB in the beginning and 88.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.46ms. Allocated memory is still 151.0MB. Free memory was 88.9MB in the beginning and 84.4MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 825.30ms. Allocated memory is still 151.0MB. Free memory was 84.4MB in the beginning and 70.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 36955.94ms. Allocated memory was 151.0MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 70.1MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 226.87ms. Allocated memory is still 2.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 261 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 36.9s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8525 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8525 mSDsluCounter, 19796 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10053 mSDsCounter, 439 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3258 IncrementalHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 439 mSolverCounterUnsat, 9743 mSDtfsCounter, 3258 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19896occurred in iteration=16, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 9634 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 33 PreInvPairs, 269 NumberOfFragments, 2067 HoareAnnotationTreeSize, 33 FomulaSimplifications, 375271 FormulaSimplificationTreeSizeReduction, 14.5s HoareSimplificationTime, 19 FomulaSimplificationsInter, 40911 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2875 NumberOfCodeBlocks, 2875 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2849 ConstructedInterpolants, 0 QuantifiedInterpolants, 5240 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1774 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 617/633 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: 485]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0) && !((2 == s_run_pc))) && (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 == s_run_pc)) && (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))) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 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))) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 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_pc == 6)) && (1 <= a))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: (((((((((((((req_type___0 == 0) && !((2 == s_run_pc))) && (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)) || ((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (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: (((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_empty_req == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) || ((((((((((c_req_type == 0) && !((2 == s_run_pc))) && (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))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (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))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((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))) - 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)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (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)) && (a == 0)) && (m_run_pc == 0))) || ((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: ((((((((((((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_empty_req == 1))) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (m_run_st == 0)) && (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) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 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))) || ((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((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))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((!((2 == s_run_pc)) && (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)) && (a_t == 0))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) || ((((((((!((2 == s_run_pc)) && (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)) && (a_t == 0)) && (a == 0))) || ((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((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)) && (s_run_pc == 0)) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_empty_req == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (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)) && (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))) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) || (((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev) && (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 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || (((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 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: 134]: 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)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 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)) && (1 <= a))) || (((((((((!((2 == s_run_pc)) && (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)) && !((s_run_st == 0))) && (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)) && (a == 0)) && (m_run_pc == 0))) || (((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: ((((((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (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 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || (((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (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))) || (((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (((((((((((((2 <= c_write_req_ev) && (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)) && (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 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (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_pc == 6)) && (a_t == 0)) && (req_type == 0))) || ((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((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_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (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)) || (((((((((((req_type___0 == 0) && !((2 == s_run_pc))) && (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: 1119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((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)) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (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) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((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))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((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)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((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_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-28 23:52:48,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33994828-50ab-49a1-89d4-62fa2cadbf87/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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