./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.5-dev-4a390ef-m [2024-10-24 20:46:30,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:46:30,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:46:30,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:46:30,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:46:30,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:46:30,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:46:30,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:46:30,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:46:30,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:46:30,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:46:30,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:46:30,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:46:30,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:46:30,795 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:46:30,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:46:30,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:46:30,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:46:30,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:46:30,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:46:30,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:46:30,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:46:30,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:46:30,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:46:30,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:46:30,804 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:46:30,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:46:30,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:46:30,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:46:30,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:46:30,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:46:30,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:46:30,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:46:30,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:46:30,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:46:30,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:46:30,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:46:30,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:46:30,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:46:30,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:46:30,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:46:30,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:46:30,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:46:30,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:46:30,811 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2024-10-24 20:46:31,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:46:31,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:46:31,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:46:31,076 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:46:31,077 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:46:31,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-10-24 20:46:32,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:46:32,701 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:46:32,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-10-24 20:46:32,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a196c700/a6d7044d2109431ab1bb117aa6a0359f/FLAG25aec6786 [2024-10-24 20:46:32,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a196c700/a6d7044d2109431ab1bb117aa6a0359f [2024-10-24 20:46:32,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:46:32,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:46:32,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:46:32,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:46:32,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:46:32,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:46:32" (1/1) ... [2024-10-24 20:46:32,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10387846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:32, skipping insertion in model container [2024-10-24 20:46:32,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:46:32" (1/1) ... [2024-10-24 20:46:32,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:46:33,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:46:33,060 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:46:33,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:46:33,172 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:46:33,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33 WrapperNode [2024-10-24 20:46:33,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:46:33,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:46:33,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:46:33,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:46:33,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,266 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 860 [2024-10-24 20:46:33,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:46:33,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:46:33,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:46:33,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:46:33,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,318 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]. [2024-10-24 20:46:33,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:46:33,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:46:33,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:46:33,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:46:33,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (1/1) ... [2024-10-24 20:46:33,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:46:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:46:33,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 20:46:33,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 20:46:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:46:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:46:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-24 20:46:33,449 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-24 20:46:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:46:33,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:46:33,562 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:46:33,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:46:34,401 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-10-24 20:46:34,401 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:46:34,474 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:46:34,478 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-24 20:46:34,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:46:34 BoogieIcfgContainer [2024-10-24 20:46:34,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:46:34,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:46:34,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:46:34,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:46:34,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:46:32" (1/3) ... [2024-10-24 20:46:34,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73949a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:46:34, skipping insertion in model container [2024-10-24 20:46:34,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:46:33" (2/3) ... [2024-10-24 20:46:34,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73949a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:46:34, skipping insertion in model container [2024-10-24 20:46:34,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:46:34" (3/3) ... [2024-10-24 20:46:34,490 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2024-10-24 20:46:34,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:46:34,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-24 20:46:34,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:46:34,578 INFO L333 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, 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;@66ef3777, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:46:34,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-24 20:46:34,582 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) [2024-10-24 20:46:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 20:46:34,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:34,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:46:34,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:34,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1819186772, now seen corresponding path program 1 times [2024-10-24 20:46:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:34,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433990758] [2024-10-24 20:46:34,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:34,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433990758] [2024-10-24 20:46:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433990758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:34,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:34,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:46:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688889753] [2024-10-24 20:46:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:34,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:34,867 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) [2024-10-24 20:46:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:35,318 INFO L93 Difference]: Finished difference Result 692 states and 1285 transitions. [2024-10-24 20:46:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:35,321 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 [2024-10-24 20:46:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:35,331 INFO L225 Difference]: With dead ends: 692 [2024-10-24 20:46:35,332 INFO L226 Difference]: Without dead ends: 419 [2024-10-24 20:46:35,335 INFO L431 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 [2024-10-24 20:46:35,338 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 253 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:35,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 724 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 20:46:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-24 20:46:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2024-10-24 20:46:35,397 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) [2024-10-24 20:46:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 656 transitions. [2024-10-24 20:46:35,400 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 656 transitions. Word has length 17 [2024-10-24 20:46:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:35,401 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 656 transitions. [2024-10-24 20:46:35,401 INFO L472 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) [2024-10-24 20:46:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 656 transitions. [2024-10-24 20:46:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 20:46:35,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:35,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:46:35,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:46:35,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:35,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1559094643, now seen corresponding path program 1 times [2024-10-24 20:46:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:35,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51840971] [2024-10-24 20:46:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:35,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:35,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51840971] [2024-10-24 20:46:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51840971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:35,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:35,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:46:35,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102885578] [2024-10-24 20:46:35,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:35,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:35,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:35,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:35,513 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) [2024-10-24 20:46:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:35,604 INFO L93 Difference]: Finished difference Result 1049 states and 1683 transitions. [2024-10-24 20:46:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:35,606 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 [2024-10-24 20:46:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:35,610 INFO L225 Difference]: With dead ends: 1049 [2024-10-24 20:46:35,610 INFO L226 Difference]: Without dead ends: 651 [2024-10-24 20:46:35,612 INFO L431 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 [2024-10-24 20:46:35,615 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 231 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:35,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 992 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:46:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-24 20:46:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2024-10-24 20:46:35,644 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) [2024-10-24 20:46:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1030 transitions. [2024-10-24 20:46:35,648 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1030 transitions. Word has length 21 [2024-10-24 20:46:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:35,649 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1030 transitions. [2024-10-24 20:46:35,649 INFO L472 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) [2024-10-24 20:46:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1030 transitions. [2024-10-24 20:46:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 20:46:35,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:35,653 INFO L215 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] [2024-10-24 20:46:35,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 20:46:35,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:35,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1818365021, now seen corresponding path program 1 times [2024-10-24 20:46:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:35,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918675219] [2024-10-24 20:46:35,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918675219] [2024-10-24 20:46:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918675219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:35,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:35,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:46:35,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642916394] [2024-10-24 20:46:35,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:35,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:46:35,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:35,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:46:35,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:46:35,782 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) [2024-10-24 20:46:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:36,317 INFO L93 Difference]: Finished difference Result 1784 states and 2890 transitions. [2024-10-24 20:46:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:46:36,318 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 [2024-10-24 20:46:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:36,323 INFO L225 Difference]: With dead ends: 1784 [2024-10-24 20:46:36,323 INFO L226 Difference]: Without dead ends: 1148 [2024-10-24 20:46:36,325 INFO L431 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 [2024-10-24 20:46:36,326 INFO L432 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 [2024-10-24 20:46:36,326 INFO L433 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] [2024-10-24 20:46:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-10-24 20:46:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 991. [2024-10-24 20:46:36,353 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) [2024-10-24 20:46:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1616 transitions. [2024-10-24 20:46:36,357 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1616 transitions. Word has length 50 [2024-10-24 20:46:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:36,358 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1616 transitions. [2024-10-24 20:46:36,358 INFO L472 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) [2024-10-24 20:46:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1616 transitions. [2024-10-24 20:46:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 20:46:36,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:36,362 INFO L215 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] [2024-10-24 20:46:36,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 20:46:36,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:36,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1919318182, now seen corresponding path program 1 times [2024-10-24 20:46:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058351242] [2024-10-24 20:46:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:36,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:36,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:36,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058351242] [2024-10-24 20:46:36,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058351242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:36,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:36,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:46:36,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698552700] [2024-10-24 20:46:36,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:36,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:46:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:46:36,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:46:36,481 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) [2024-10-24 20:46:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:36,795 INFO L93 Difference]: Finished difference Result 2476 states and 4030 transitions. [2024-10-24 20:46:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:46:36,796 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 [2024-10-24 20:46:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:36,803 INFO L225 Difference]: With dead ends: 2476 [2024-10-24 20:46:36,804 INFO L226 Difference]: Without dead ends: 1498 [2024-10-24 20:46:36,805 INFO L431 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 [2024-10-24 20:46:36,807 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 405 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:36,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1391 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 20:46:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-24 20:46:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1375. [2024-10-24 20:46:36,851 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) [2024-10-24 20:46:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2236 transitions. [2024-10-24 20:46:36,856 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2236 transitions. Word has length 53 [2024-10-24 20:46:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:36,856 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2236 transitions. [2024-10-24 20:46:36,857 INFO L472 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) [2024-10-24 20:46:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2236 transitions. [2024-10-24 20:46:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 20:46:36,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:36,860 INFO L215 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] [2024-10-24 20:46:36,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 20:46:36,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:36,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1955608190, now seen corresponding path program 1 times [2024-10-24 20:46:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:36,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998927347] [2024-10-24 20:46:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998927347] [2024-10-24 20:46:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998927347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:36,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:36,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:46:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133023502] [2024-10-24 20:46:36,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:36,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:46:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:36,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:46:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:46:36,954 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) [2024-10-24 20:46:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:37,398 INFO L93 Difference]: Finished difference Result 4274 states and 6819 transitions. [2024-10-24 20:46:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:46:37,399 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 [2024-10-24 20:46:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:37,409 INFO L225 Difference]: With dead ends: 4274 [2024-10-24 20:46:37,410 INFO L226 Difference]: Without dead ends: 2909 [2024-10-24 20:46:37,412 INFO L431 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 [2024-10-24 20:46:37,415 INFO L432 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 [2024-10-24 20:46:37,415 INFO L433 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] [2024-10-24 20:46:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2024-10-24 20:46:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2589. [2024-10-24 20:46:37,488 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) [2024-10-24 20:46:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4134 transitions. [2024-10-24 20:46:37,498 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4134 transitions. Word has length 65 [2024-10-24 20:46:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:37,500 INFO L471 AbstractCegarLoop]: Abstraction has 2589 states and 4134 transitions. [2024-10-24 20:46:37,500 INFO L472 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) [2024-10-24 20:46:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4134 transitions. [2024-10-24 20:46:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 20:46:37,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:37,503 INFO L215 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] [2024-10-24 20:46:37,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 20:46:37,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 8439650, now seen corresponding path program 1 times [2024-10-24 20:46:37,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:37,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770069223] [2024-10-24 20:46:37,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:37,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770069223] [2024-10-24 20:46:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770069223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:37,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:46:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329315068] [2024-10-24 20:46:37,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:37,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:37,556 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) [2024-10-24 20:46:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:37,689 INFO L93 Difference]: Finished difference Result 5684 states and 9202 transitions. [2024-10-24 20:46:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:37,692 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 [2024-10-24 20:46:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:37,704 INFO L225 Difference]: With dead ends: 5684 [2024-10-24 20:46:37,704 INFO L226 Difference]: Without dead ends: 3107 [2024-10-24 20:46:37,708 INFO L431 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 [2024-10-24 20:46:37,710 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:37,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 625 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:46:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2024-10-24 20:46:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2814. [2024-10-24 20:46:37,836 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) [2024-10-24 20:46:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 4591 transitions. [2024-10-24 20:46:37,846 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 4591 transitions. Word has length 65 [2024-10-24 20:46:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:37,847 INFO L471 AbstractCegarLoop]: Abstraction has 2814 states and 4591 transitions. [2024-10-24 20:46:37,847 INFO L472 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) [2024-10-24 20:46:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 4591 transitions. [2024-10-24 20:46:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 20:46:37,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:37,852 INFO L215 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] [2024-10-24 20:46:37,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 20:46:37,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:37,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash -724114766, now seen corresponding path program 1 times [2024-10-24 20:46:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:37,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159804110] [2024-10-24 20:46:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:37,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:37,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:37,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159804110] [2024-10-24 20:46:37,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159804110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:37,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:46:37,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801107131] [2024-10-24 20:46:37,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:37,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:37,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:37,920 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) [2024-10-24 20:46:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:38,097 INFO L93 Difference]: Finished difference Result 6170 states and 10052 transitions. [2024-10-24 20:46:38,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:38,098 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 [2024-10-24 20:46:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:38,110 INFO L225 Difference]: With dead ends: 6170 [2024-10-24 20:46:38,110 INFO L226 Difference]: Without dead ends: 3367 [2024-10-24 20:46:38,115 INFO L431 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 [2024-10-24 20:46:38,116 INFO L432 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 [2024-10-24 20:46:38,117 INFO L433 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] [2024-10-24 20:46:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-10-24 20:46:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3361. [2024-10-24 20:46:38,209 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) [2024-10-24 20:46:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 5442 transitions. [2024-10-24 20:46:38,223 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 5442 transitions. Word has length 80 [2024-10-24 20:46:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:38,224 INFO L471 AbstractCegarLoop]: Abstraction has 3361 states and 5442 transitions. [2024-10-24 20:46:38,224 INFO L472 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) [2024-10-24 20:46:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 5442 transitions. [2024-10-24 20:46:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 20:46:38,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:38,231 INFO L215 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] [2024-10-24 20:46:38,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 20:46:38,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:38,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash 30332474, now seen corresponding path program 1 times [2024-10-24 20:46:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:38,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417753792] [2024-10-24 20:46:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:46:38,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:38,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417753792] [2024-10-24 20:46:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417753792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:38,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:38,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:46:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80058166] [2024-10-24 20:46:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:38,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:46:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:46:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:46:38,351 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) [2024-10-24 20:46:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:38,786 INFO L93 Difference]: Finished difference Result 6497 states and 10536 transitions. [2024-10-24 20:46:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:46:38,787 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 [2024-10-24 20:46:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:38,802 INFO L225 Difference]: With dead ends: 6497 [2024-10-24 20:46:38,802 INFO L226 Difference]: Without dead ends: 3553 [2024-10-24 20:46:38,807 INFO L431 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 [2024-10-24 20:46:38,808 INFO L432 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 [2024-10-24 20:46:38,809 INFO L433 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] [2024-10-24 20:46:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2024-10-24 20:46:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3499. [2024-10-24 20:46:38,905 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) [2024-10-24 20:46:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5649 transitions. [2024-10-24 20:46:38,917 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 5649 transitions. Word has length 90 [2024-10-24 20:46:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:38,918 INFO L471 AbstractCegarLoop]: Abstraction has 3499 states and 5649 transitions. [2024-10-24 20:46:38,918 INFO L472 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) [2024-10-24 20:46:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 5649 transitions. [2024-10-24 20:46:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 20:46:38,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:38,926 INFO L215 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] [2024-10-24 20:46:38,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 20:46:38,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:38,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash -64324492, now seen corresponding path program 1 times [2024-10-24 20:46:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:38,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949352864] [2024-10-24 20:46:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949352864] [2024-10-24 20:46:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949352864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:38,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:46:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595150987] [2024-10-24 20:46:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:38,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:38,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:38,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:38,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:38,985 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) [2024-10-24 20:46:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:39,343 INFO L93 Difference]: Finished difference Result 8155 states and 13216 transitions. [2024-10-24 20:46:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:39,344 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 [2024-10-24 20:46:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:39,361 INFO L225 Difference]: With dead ends: 8155 [2024-10-24 20:46:39,361 INFO L226 Difference]: Without dead ends: 4818 [2024-10-24 20:46:39,366 INFO L431 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 [2024-10-24 20:46:39,367 INFO L432 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 [2024-10-24 20:46:39,367 INFO L433 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] [2024-10-24 20:46:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2024-10-24 20:46:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3840. [2024-10-24 20:46:39,478 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) [2024-10-24 20:46:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 5918 transitions. [2024-10-24 20:46:39,490 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 5918 transitions. Word has length 90 [2024-10-24 20:46:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:39,490 INFO L471 AbstractCegarLoop]: Abstraction has 3840 states and 5918 transitions. [2024-10-24 20:46:39,490 INFO L472 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) [2024-10-24 20:46:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 5918 transitions. [2024-10-24 20:46:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 20:46:39,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:39,493 INFO L215 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] [2024-10-24 20:46:39,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 20:46:39,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:39,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash -995861156, now seen corresponding path program 1 times [2024-10-24 20:46:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634773868] [2024-10-24 20:46:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634773868] [2024-10-24 20:46:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634773868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:39,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:46:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207743689] [2024-10-24 20:46:39,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:39,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:39,557 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) [2024-10-24 20:46:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:39,693 INFO L93 Difference]: Finished difference Result 7508 states and 11604 transitions. [2024-10-24 20:46:39,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:39,693 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 [2024-10-24 20:46:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:39,715 INFO L225 Difference]: With dead ends: 7508 [2024-10-24 20:46:39,719 INFO L226 Difference]: Without dead ends: 3840 [2024-10-24 20:46:39,726 INFO L431 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 [2024-10-24 20:46:39,727 INFO L432 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 [2024-10-24 20:46:39,727 INFO L433 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] [2024-10-24 20:46:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2024-10-24 20:46:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3840. [2024-10-24 20:46:39,859 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) [2024-10-24 20:46:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 5801 transitions. [2024-10-24 20:46:39,873 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 5801 transitions. Word has length 98 [2024-10-24 20:46:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:39,873 INFO L471 AbstractCegarLoop]: Abstraction has 3840 states and 5801 transitions. [2024-10-24 20:46:39,874 INFO L472 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) [2024-10-24 20:46:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 5801 transitions. [2024-10-24 20:46:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 20:46:39,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:39,876 INFO L215 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] [2024-10-24 20:46:39,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 20:46:39,876 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:39,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1797752544, now seen corresponding path program 1 times [2024-10-24 20:46:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:39,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863867136] [2024-10-24 20:46:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 20:46:39,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:39,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863867136] [2024-10-24 20:46:39,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863867136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:39,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:39,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:46:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348718195] [2024-10-24 20:46:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:39,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:39,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:39,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:39,914 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) [2024-10-24 20:46:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:40,122 INFO L93 Difference]: Finished difference Result 9972 states and 15137 transitions. [2024-10-24 20:46:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:40,122 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 [2024-10-24 20:46:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:40,142 INFO L225 Difference]: With dead ends: 9972 [2024-10-24 20:46:40,142 INFO L226 Difference]: Without dead ends: 6143 [2024-10-24 20:46:40,150 INFO L431 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 [2024-10-24 20:46:40,151 INFO L432 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 [2024-10-24 20:46:40,151 INFO L433 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] [2024-10-24 20:46:40,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2024-10-24 20:46:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5659. [2024-10-24 20:46:40,315 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) [2024-10-24 20:46:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5659 states to 5659 states and 8553 transitions. [2024-10-24 20:46:40,331 INFO L78 Accepts]: Start accepts. Automaton has 5659 states and 8553 transitions. Word has length 98 [2024-10-24 20:46:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:40,331 INFO L471 AbstractCegarLoop]: Abstraction has 5659 states and 8553 transitions. [2024-10-24 20:46:40,331 INFO L472 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) [2024-10-24 20:46:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5659 states and 8553 transitions. [2024-10-24 20:46:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 20:46:40,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:40,335 INFO L215 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] [2024-10-24 20:46:40,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 20:46:40,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:40,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash 800851664, now seen corresponding path program 1 times [2024-10-24 20:46:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978351727] [2024-10-24 20:46:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 20:46:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978351727] [2024-10-24 20:46:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978351727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:40,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:46:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569419101] [2024-10-24 20:46:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:40,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:46:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:46:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:46:40,395 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) [2024-10-24 20:46:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:40,939 INFO L93 Difference]: Finished difference Result 14902 states and 22342 transitions. [2024-10-24 20:46:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:46:40,940 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 [2024-10-24 20:46:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:40,960 INFO L225 Difference]: With dead ends: 14902 [2024-10-24 20:46:40,960 INFO L226 Difference]: Without dead ends: 9140 [2024-10-24 20:46:40,969 INFO L431 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 [2024-10-24 20:46:40,970 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 609 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2024-10-24 20:46:40,970 INFO L433 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] [2024-10-24 20:46:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9140 states. [2024-10-24 20:46:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9140 to 8014. [2024-10-24 20:46:41,214 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) [2024-10-24 20:46:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8014 states to 8014 states and 11898 transitions. [2024-10-24 20:46:41,234 INFO L78 Accepts]: Start accepts. Automaton has 8014 states and 11898 transitions. Word has length 100 [2024-10-24 20:46:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:41,234 INFO L471 AbstractCegarLoop]: Abstraction has 8014 states and 11898 transitions. [2024-10-24 20:46:41,235 INFO L472 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) [2024-10-24 20:46:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8014 states and 11898 transitions. [2024-10-24 20:46:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 20:46:41,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:41,239 INFO L215 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] [2024-10-24 20:46:41,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 20:46:41,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:41,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1073806155, now seen corresponding path program 1 times [2024-10-24 20:46:41,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:41,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441849579] [2024-10-24 20:46:41,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441849579] [2024-10-24 20:46:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441849579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:41,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:41,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 20:46:41,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342617573] [2024-10-24 20:46:41,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:41,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:46:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:46:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:46:41,311 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) [2024-10-24 20:46:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:41,789 INFO L93 Difference]: Finished difference Result 22400 states and 33298 transitions. [2024-10-24 20:46:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:46:41,789 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 [2024-10-24 20:46:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:41,821 INFO L225 Difference]: With dead ends: 22400 [2024-10-24 20:46:41,822 INFO L226 Difference]: Without dead ends: 14688 [2024-10-24 20:46:41,834 INFO L431 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 [2024-10-24 20:46:41,835 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 598 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:41,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 2063 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:46:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2024-10-24 20:46:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 13062. [2024-10-24 20:46:42,240 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) [2024-10-24 20:46:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13062 states to 13062 states and 19479 transitions. [2024-10-24 20:46:42,271 INFO L78 Accepts]: Start accepts. Automaton has 13062 states and 19479 transitions. Word has length 107 [2024-10-24 20:46:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:42,271 INFO L471 AbstractCegarLoop]: Abstraction has 13062 states and 19479 transitions. [2024-10-24 20:46:42,272 INFO L472 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) [2024-10-24 20:46:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 13062 states and 19479 transitions. [2024-10-24 20:46:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 20:46:42,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:42,275 INFO L215 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] [2024-10-24 20:46:42,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 20:46:42,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:42,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash -652909232, now seen corresponding path program 1 times [2024-10-24 20:46:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:42,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316832012] [2024-10-24 20:46:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 20:46:42,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:42,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316832012] [2024-10-24 20:46:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316832012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:42,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:42,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:46:42,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181099644] [2024-10-24 20:46:42,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:42,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:42,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:42,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:42,324 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) [2024-10-24 20:46:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:42,884 INFO L93 Difference]: Finished difference Result 25886 states and 38641 transitions. [2024-10-24 20:46:42,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:42,884 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 [2024-10-24 20:46:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:42,917 INFO L225 Difference]: With dead ends: 25886 [2024-10-24 20:46:42,917 INFO L226 Difference]: Without dead ends: 12902 [2024-10-24 20:46:42,939 INFO L431 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 [2024-10-24 20:46:42,940 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:42,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 747 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 20:46:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2024-10-24 20:46:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 12866. [2024-10-24 20:46:43,294 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) [2024-10-24 20:46:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12866 states to 12866 states and 18599 transitions. [2024-10-24 20:46:43,319 INFO L78 Accepts]: Start accepts. Automaton has 12866 states and 18599 transitions. Word has length 109 [2024-10-24 20:46:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:43,320 INFO L471 AbstractCegarLoop]: Abstraction has 12866 states and 18599 transitions. [2024-10-24 20:46:43,320 INFO L472 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) [2024-10-24 20:46:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 12866 states and 18599 transitions. [2024-10-24 20:46:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 20:46:43,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:43,322 INFO L215 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] [2024-10-24 20:46:43,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 20:46:43,322 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:43,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash -722434754, now seen corresponding path program 1 times [2024-10-24 20:46:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871160444] [2024-10-24 20:46:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:46:43,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:43,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871160444] [2024-10-24 20:46:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871160444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:46:43,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023386477] [2024-10-24 20:46:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:43,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:46:43,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:46:43,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:46:43,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 20:46:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:43,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 20:46:43,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:46:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:46:43,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:46:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023386477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:43,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:46:43,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-24 20:46:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883000796] [2024-10-24 20:46:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:43,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:43,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:46:43,644 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) [2024-10-24 20:46:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:43,971 INFO L93 Difference]: Finished difference Result 24320 states and 35235 transitions. [2024-10-24 20:46:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:43,972 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 [2024-10-24 20:46:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:43,992 INFO L225 Difference]: With dead ends: 24320 [2024-10-24 20:46:43,993 INFO L226 Difference]: Without dead ends: 11407 [2024-10-24 20:46:44,010 INFO L431 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 [2024-10-24 20:46:44,011 INFO L432 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 [2024-10-24 20:46:44,011 INFO L433 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] [2024-10-24 20:46:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11407 states. [2024-10-24 20:46:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11407 to 10632. [2024-10-24 20:46:44,331 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) [2024-10-24 20:46:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10632 states to 10632 states and 15325 transitions. [2024-10-24 20:46:44,350 INFO L78 Accepts]: Start accepts. Automaton has 10632 states and 15325 transitions. Word has length 109 [2024-10-24 20:46:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:44,350 INFO L471 AbstractCegarLoop]: Abstraction has 10632 states and 15325 transitions. [2024-10-24 20:46:44,350 INFO L472 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) [2024-10-24 20:46:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 15325 transitions. [2024-10-24 20:46:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 20:46:44,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:44,352 INFO L215 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] [2024-10-24 20:46:44,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 20:46:44,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 20:46:44,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:44,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1797485791, now seen corresponding path program 1 times [2024-10-24 20:46:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303417742] [2024-10-24 20:46:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:44,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:46:44,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303417742] [2024-10-24 20:46:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303417742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:44,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:44,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:46:44,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520436639] [2024-10-24 20:46:44,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:44,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:46:44,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:44,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:46:44,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:46:44,643 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) [2024-10-24 20:46:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:45,258 INFO L93 Difference]: Finished difference Result 21823 states and 31419 transitions. [2024-10-24 20:46:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:46:45,258 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 [2024-10-24 20:46:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:45,295 INFO L225 Difference]: With dead ends: 21823 [2024-10-24 20:46:45,295 INFO L226 Difference]: Without dead ends: 21819 [2024-10-24 20:46:45,301 INFO L431 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 [2024-10-24 20:46:45,302 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 692 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 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 [2024-10-24 20:46:45,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1220 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:46:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21819 states. [2024-10-24 20:46:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 19896. [2024-10-24 20:46:46,011 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) [2024-10-24 20:46:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19896 states to 19896 states and 28895 transitions. [2024-10-24 20:46:46,049 INFO L78 Accepts]: Start accepts. Automaton has 19896 states and 28895 transitions. Word has length 111 [2024-10-24 20:46:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:46,049 INFO L471 AbstractCegarLoop]: Abstraction has 19896 states and 28895 transitions. [2024-10-24 20:46:46,049 INFO L472 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) [2024-10-24 20:46:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19896 states and 28895 transitions. [2024-10-24 20:46:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 20:46:46,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:46,051 INFO L215 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] [2024-10-24 20:46:46,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 20:46:46,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:46,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1887959299, now seen corresponding path program 1 times [2024-10-24 20:46:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:46,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316937341] [2024-10-24 20:46:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:46:46,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:46,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316937341] [2024-10-24 20:46:46,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316937341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:46:46,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250396867] [2024-10-24 20:46:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:46,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:46:46,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:46:46,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:46:46,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 20:46:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:46,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:46:46,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:46:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 20:46:46,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:46:46,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250396867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:46,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:46:46,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-24 20:46:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527182613] [2024-10-24 20:46:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:46,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:46:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:46:46,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:46:46,314 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) [2024-10-24 20:46:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:46,793 INFO L93 Difference]: Finished difference Result 20226 states and 29348 transitions. [2024-10-24 20:46:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:46:46,794 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 [2024-10-24 20:46:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:46,833 INFO L225 Difference]: With dead ends: 20226 [2024-10-24 20:46:46,833 INFO L226 Difference]: Without dead ends: 20225 [2024-10-24 20:46:46,844 INFO L431 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 [2024-10-24 20:46:46,845 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 289 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:46,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 812 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:46:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states. [2024-10-24 20:46:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 19895. [2024-10-24 20:46:47,492 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) [2024-10-24 20:46:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19895 states to 19895 states and 28874 transitions. [2024-10-24 20:46:47,526 INFO L78 Accepts]: Start accepts. Automaton has 19895 states and 28874 transitions. Word has length 115 [2024-10-24 20:46:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:47,527 INFO L471 AbstractCegarLoop]: Abstraction has 19895 states and 28874 transitions. [2024-10-24 20:46:47,527 INFO L472 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) [2024-10-24 20:46:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 19895 states and 28874 transitions. [2024-10-24 20:46:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 20:46:47,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:47,529 INFO L215 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] [2024-10-24 20:46:47,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 20:46:47,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 20:46:47,730 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:47,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1602803640, now seen corresponding path program 1 times [2024-10-24 20:46:47,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:47,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166469165] [2024-10-24 20:46:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:46:47,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:47,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166469165] [2024-10-24 20:46:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166469165] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:46:47,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798514530] [2024-10-24 20:46:47,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:47,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:46:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:46:47,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:46:47,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 20:46:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:47,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 20:46:47,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:46:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:46:47,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:46:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798514530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:47,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:46:47,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-24 20:46:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021559279] [2024-10-24 20:46:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:47,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:47,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:46:47,963 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) [2024-10-24 20:46:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:48,341 INFO L93 Difference]: Finished difference Result 20225 states and 29327 transitions. [2024-10-24 20:46:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:48,342 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 [2024-10-24 20:46:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:48,375 INFO L225 Difference]: With dead ends: 20225 [2024-10-24 20:46:48,375 INFO L226 Difference]: Without dead ends: 20224 [2024-10-24 20:46:48,385 INFO L431 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 [2024-10-24 20:46:48,386 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 145 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:48,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 820 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:46:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20224 states. [2024-10-24 20:46:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20224 to 19894. [2024-10-24 20:46:48,884 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) [2024-10-24 20:46:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19894 states to 19894 states and 28853 transitions. [2024-10-24 20:46:48,913 INFO L78 Accepts]: Start accepts. Automaton has 19894 states and 28853 transitions. Word has length 116 [2024-10-24 20:46:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:48,914 INFO L471 AbstractCegarLoop]: Abstraction has 19894 states and 28853 transitions. [2024-10-24 20:46:48,914 INFO L472 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) [2024-10-24 20:46:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 19894 states and 28853 transitions. [2024-10-24 20:46:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 20:46:48,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:48,923 INFO L215 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] [2024-10-24 20:46:48,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 20:46:49,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 20:46:49,124 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:49,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:49,125 INFO L85 PathProgramCache]: Analyzing trace with hash 179457068, now seen corresponding path program 1 times [2024-10-24 20:46:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:49,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542567673] [2024-10-24 20:46:49,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:49,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:46:49,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:49,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542567673] [2024-10-24 20:46:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542567673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:49,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:49,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:46:49,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638737707] [2024-10-24 20:46:49,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:49,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:46:49,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:49,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:46:49,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:46:49,205 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) [2024-10-24 20:46:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:49,502 INFO L93 Difference]: Finished difference Result 23761 states and 34202 transitions. [2024-10-24 20:46:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:46:49,503 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 [2024-10-24 20:46:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:49,513 INFO L225 Difference]: With dead ends: 23761 [2024-10-24 20:46:49,513 INFO L226 Difference]: Without dead ends: 3768 [2024-10-24 20:46:49,530 INFO L431 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 [2024-10-24 20:46:49,531 INFO L432 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 [2024-10-24 20:46:49,531 INFO L433 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] [2024-10-24 20:46:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2024-10-24 20:46:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 2962. [2024-10-24 20:46:49,607 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) [2024-10-24 20:46:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 3453 transitions. [2024-10-24 20:46:49,614 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 3453 transitions. Word has length 194 [2024-10-24 20:46:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:49,614 INFO L471 AbstractCegarLoop]: Abstraction has 2962 states and 3453 transitions. [2024-10-24 20:46:49,614 INFO L472 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) [2024-10-24 20:46:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 3453 transitions. [2024-10-24 20:46:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-24 20:46:49,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:49,651 INFO L215 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] [2024-10-24 20:46:49,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 20:46:49,651 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:49,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1528977428, now seen corresponding path program 1 times [2024-10-24 20:46:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927141831] [2024-10-24 20:46:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 20:46:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927141831] [2024-10-24 20:46:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927141831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:46:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154743852] [2024-10-24 20:46:49,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:49,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:46:49,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:46:49,829 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:46:49,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 20:46:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:49,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:46:49,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:46:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 20:46:50,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:46:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154743852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:50,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:46:50,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-24 20:46:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440462462] [2024-10-24 20:46:50,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:50,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:46:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:46:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:46:50,156 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) [2024-10-24 20:46:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:50,285 INFO L93 Difference]: Finished difference Result 3748 states and 4380 transitions. [2024-10-24 20:46:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:46:50,286 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 [2024-10-24 20:46:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:50,290 INFO L225 Difference]: With dead ends: 3748 [2024-10-24 20:46:50,290 INFO L226 Difference]: Without dead ends: 1474 [2024-10-24 20:46:50,291 INFO L431 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 [2024-10-24 20:46:50,292 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 279 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:50,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 560 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:46:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-10-24 20:46:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2024-10-24 20:46:50,346 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) [2024-10-24 20:46:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1703 transitions. [2024-10-24 20:46:50,350 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1703 transitions. Word has length 209 [2024-10-24 20:46:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:50,350 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 1703 transitions. [2024-10-24 20:46:50,351 INFO L472 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) [2024-10-24 20:46:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1703 transitions. [2024-10-24 20:46:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 20:46:50,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:50,353 INFO L215 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] [2024-10-24 20:46:50,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 20:46:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:46:50,554 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:50,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2026923084, now seen corresponding path program 1 times [2024-10-24 20:46:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:50,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827552164] [2024-10-24 20:46:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:46:50,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827552164] [2024-10-24 20:46:50,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827552164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:50,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:50,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 20:46:50,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298227527] [2024-10-24 20:46:50,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:50,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:46:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:50,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:46:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:46:50,685 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) [2024-10-24 20:46:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:50,827 INFO L93 Difference]: Finished difference Result 2050 states and 2380 transitions. [2024-10-24 20:46:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:46:50,828 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 [2024-10-24 20:46:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:50,833 INFO L225 Difference]: With dead ends: 2050 [2024-10-24 20:46:50,834 INFO L226 Difference]: Without dead ends: 1492 [2024-10-24 20:46:50,835 INFO L431 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 [2024-10-24 20:46:50,835 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 200 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 951 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:46:50,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 951 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:46:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2024-10-24 20:46:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1438. [2024-10-24 20:46:50,906 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) [2024-10-24 20:46:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1643 transitions. [2024-10-24 20:46:50,916 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1643 transitions. Word has length 214 [2024-10-24 20:46:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:50,916 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 1643 transitions. [2024-10-24 20:46:50,916 INFO L472 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) [2024-10-24 20:46:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1643 transitions. [2024-10-24 20:46:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 20:46:50,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:46:50,920 INFO L215 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] [2024-10-24 20:46:50,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 20:46:50,920 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:46:50,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:46:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1895039727, now seen corresponding path program 1 times [2024-10-24 20:46:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:46:50,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700087946] [2024-10-24 20:46:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:46:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:46:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:46:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:46:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:46:51,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700087946] [2024-10-24 20:46:51,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700087946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:46:51,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:46:51,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:46:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4229081] [2024-10-24 20:46:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:46:51,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:46:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:46:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:46:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:46:51,102 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) [2024-10-24 20:46:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:46:51,238 INFO L93 Difference]: Finished difference Result 1448 states and 1653 transitions. [2024-10-24 20:46:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:46:51,239 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 [2024-10-24 20:46:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:46:51,245 INFO L225 Difference]: With dead ends: 1448 [2024-10-24 20:46:51,245 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 20:46:51,246 INFO L431 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 [2024-10-24 20:46:51,247 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 258 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 574 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 [2024-10-24 20:46:51,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 574 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:46:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 20:46:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 20:46:51,248 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) [2024-10-24 20:46:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 20:46:51,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 215 [2024-10-24 20:46:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:46:51,252 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 20:46:51,252 INFO L472 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) [2024-10-24 20:46:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 20:46:51,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 20:46:51,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-24 20:46:51,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-24 20:46:51,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-24 20:46:51,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-24 20:46:51,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-24 20:46:51,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-24 20:46:51,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-24 20:46:51,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-24 20:46:51,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 20:46:51,260 INFO L407 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] [2024-10-24 20:46:51,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 20:47:00,590 WARN L286 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 201 DAG size of output: 247 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-24 20:47:06,250 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:47:06,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:47:06 BoogieIcfgContainer [2024-10-24 20:47:06,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:47:06,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:47:06,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:47:06,296 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:47:06,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:46:34" (3/4) ... [2024-10-24 20:47:06,298 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 20:47:06,302 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-10-24 20:47:06,318 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 20:47:06,323 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 20:47:06,325 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 20:47:06,325 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 20:47:06,513 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:47:06,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 20:47:06,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:47:06,514 INFO L158 Benchmark]: Toolchain (without parser) took 33783.07ms. Allocated memory was 176.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 119.6MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 717.4MB. Max. memory is 16.1GB. [2024-10-24 20:47:06,514 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 176.2MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:47:06,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.29ms. Allocated memory is still 176.2MB. Free memory was 119.6MB in the beginning and 97.3MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 20:47:06,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.14ms. Allocated memory is still 176.2MB. Free memory was 97.3MB in the beginning and 93.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:47:06,515 INFO L158 Benchmark]: Boogie Preprocessor took 80.58ms. Allocated memory is still 176.2MB. Free memory was 93.6MB in the beginning and 89.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:47:06,515 INFO L158 Benchmark]: RCFGBuilder took 1126.72ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 89.0MB in the beginning and 189.9MB in the end (delta: -100.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-10-24 20:47:06,516 INFO L158 Benchmark]: TraceAbstraction took 31812.82ms. Allocated memory was 241.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 188.8MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-10-24 20:47:06,516 INFO L158 Benchmark]: Witness Printer took 218.15ms. Allocated memory is still 2.5GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 20:47:06,517 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.95ms. Allocated memory is still 176.2MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.29ms. Allocated memory is still 176.2MB. Free memory was 119.6MB in the beginning and 97.3MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.14ms. Allocated memory is still 176.2MB. Free memory was 97.3MB in the beginning and 93.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.58ms. Allocated memory is still 176.2MB. Free memory was 93.6MB in the beginning and 89.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1126.72ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 89.0MB in the beginning and 189.9MB in the end (delta: -100.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31812.82ms. Allocated memory was 241.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 188.8MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 218.15ms. Allocated memory is still 2.5GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 261 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8394 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8394 mSDsluCounter, 20030 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10290 mSDsCounter, 435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3405 IncrementalHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 435 mSolverCounterUnsat, 9740 mSDtfsCounter, 3405 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: 4.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 9431 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2875 NumberOfCodeBlocks, 2875 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2849 ConstructedInterpolants, 0 QuantifiedInterpolants, 5240 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1762 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_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]: Location Invariant Derived location 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))) - ProcedureContractResult [Line: 16]: Procedure Contract for error Derived contract for procedure error. Ensures: (0 && (((((((((((((((((((((((((((((((((((((((((m_run_st == \old(m_run_st)) && (m_run_i == \old(m_run_i))) && (m_run_pc == \old(m_run_pc))) && (s_memory0 == \old(s_memory0))) && (s_run_st == \old(s_run_st))) && (s_run_i == \old(s_run_i))) && (s_run_pc == \old(s_run_pc))) && (c_m_lock == \old(c_m_lock))) && (c_m_ev == \old(c_m_ev))) && (c_req_type == \old(c_req_type))) && (c_req_a == \old(c_req_a))) && (c_req_d == \old(c_req_d))) && (c_rsp_type == \old(c_rsp_type))) && (c_rsp_status == \old(c_rsp_status))) && (c_rsp_d == \old(c_rsp_d))) && (c_empty_req == \old(c_empty_req))) && (c_empty_rsp == \old(c_empty_rsp))) && (c_read_req_ev == \old(c_read_req_ev))) && (c_write_req_ev == \old(c_write_req_ev))) && (c_read_rsp_ev == \old(c_read_rsp_ev))) && (c_write_rsp_ev == \old(c_write_rsp_ev))) && (d_t == \old(d_t))) && (a_t == \old(a_t))) && (req_t_type == \old(req_t_type))) && (req_t_a == \old(req_t_a))) && (req_t_d == \old(req_t_d))) && (rsp_t_type == \old(rsp_t_type))) && (rsp_t_status == \old(rsp_t_status))) && (rsp_t_d == \old(rsp_t_d))) && (req_tt_type == \old(req_tt_type))) && (req_tt_a == \old(req_tt_a))) && (req_tt_d == \old(req_tt_d))) && (rsp_tt_type == \old(rsp_tt_type))) && (rsp_tt_status == \old(rsp_tt_status))) && (rsp_tt_d == \old(rsp_tt_d))) && (req_t_type___0 == \old(req_t_type___0))) && (req_t_a___0 == \old(req_t_a___0))) && (req_t_d___0 == \old(req_t_d___0))) && (rsp_t_type___0 == \old(rsp_t_type___0))) && (rsp_t_status___0 == \old(rsp_t_status___0))) && (rsp_t_d___0 == \old(rsp_t_d___0)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 20:47:06,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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