./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all.i -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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:58:41,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:58:41,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:58:41,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:58:41,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:58:41,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:58:41,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:58:41,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:58:41,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:58:41,357 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:58:41,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:58:41,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:58:41,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:58:41,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:58:41,358 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:58:41,360 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:58:41,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:58:41,360 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:58:41,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:58:41,360 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:58:41,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:58:41,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:58:41,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:58:41,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:58:41,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:58:41,362 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2025-03-17 14:58:41,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:58:41,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:58:41,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:58:41,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:58:41,600 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:58:41,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2025-03-17 14:58:42,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcd907d6/befccfa4d87a4ae78df8d7c498209fa4/FLAG73390351b [2025-03-17 14:58:42,968 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:58:42,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2025-03-17 14:58:42,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcd907d6/befccfa4d87a4ae78df8d7c498209fa4/FLAG73390351b [2025-03-17 14:58:43,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcd907d6/befccfa4d87a4ae78df8d7c498209fa4 [2025-03-17 14:58:43,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:58:43,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:58:43,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:58:43,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:58:43,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:58:43,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cedb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43, skipping insertion in model container [2025-03-17 14:58:43,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:58:43,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:58:43,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:58:43,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:58:43,598 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:58:43,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43 WrapperNode [2025-03-17 14:58:43,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:58:43,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:58:43,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:58:43,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:58:43,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,624 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 113 [2025-03-17 14:58:43,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:58:43,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:58:43,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:58:43,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:58:43,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,647 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-17 14:58:43,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:58:43,658 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:58:43,659 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:58:43,659 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:58:43,659 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (1/1) ... [2025-03-17 14:58:43,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:58:43,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:43,687 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) [2025-03-17 14:58:43,689 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 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-17 14:58:43,706 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:58:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:58:43,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:58:43,792 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:58:43,793 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:58:43,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-17 14:58:44,008 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc dll_get_data_at_#t~mem9#1; [2025-03-17 14:58:44,019 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-03-17 14:58:44,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:58:44,025 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:58:44,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:58:44,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:44 BoogieIcfgContainer [2025-03-17 14:58:44,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:58:44,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:58:44,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:58:44,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:58:44,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:58:43" (1/3) ... [2025-03-17 14:58:44,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758c6e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:44, skipping insertion in model container [2025-03-17 14:58:44,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:43" (2/3) ... [2025-03-17 14:58:44,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758c6e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:44, skipping insertion in model container [2025-03-17 14:58:44,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:44" (3/3) ... [2025-03-17 14:58:44,034 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2025-03-17 14:58:44,047 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:58:44,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_update_all.i that has 2 procedures, 51 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-17 14:58:44,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:58:44,100 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;@3fad3b68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:58:44,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 14:58:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 48 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:58:44,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:44,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:58:44,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:44,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2942323, now seen corresponding path program 1 times [2025-03-17 14:58:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127169175] [2025-03-17 14:58:44,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:44,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:44,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:58:44,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:58:44,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:44,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:44,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:44,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127169175] [2025-03-17 14:58:44,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127169175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:44,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:44,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666348245] [2025-03-17 14:58:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:44,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:44,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:44,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:44,307 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 48 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:44,333 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2025-03-17 14:58:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-17 14:58:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:44,338 INFO L225 Difference]: With dead ends: 92 [2025-03-17 14:58:44,339 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 14:58:44,340 INFO L434 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 [2025-03-17 14:58:44,342 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:44,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 14:58:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-17 14:58:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-17 14:58:44,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 4 [2025-03-17 14:58:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:44,374 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-17 14:58:44,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-17 14:58:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:58:44,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:44,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:44,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:58:44,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:44,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2110387101, now seen corresponding path program 1 times [2025-03-17 14:58:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955675136] [2025-03-17 14:58:44,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:44,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:58:44,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:58:44,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:44,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:44,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955675136] [2025-03-17 14:58:44,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955675136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:44,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:44,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186985162] [2025-03-17 14:58:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:44,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:44,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:44,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:44,460 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:44,476 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2025-03-17 14:58:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:44,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-17 14:58:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:44,478 INFO L225 Difference]: With dead ends: 83 [2025-03-17 14:58:44,478 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 14:58:44,479 INFO L434 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 [2025-03-17 14:58:44,480 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:44,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 14:58:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 14:58:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-17 14:58:44,488 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 7 [2025-03-17 14:58:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:44,488 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-17 14:58:44,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-17 14:58:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:58:44,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:44,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:44,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:58:44,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:44,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2110388062, now seen corresponding path program 1 times [2025-03-17 14:58:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:44,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797158464] [2025-03-17 14:58:44,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:44,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:44,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:58:44,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:58:44,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:44,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797158464] [2025-03-17 14:58:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797158464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:44,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:44,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982955170] [2025-03-17 14:58:44,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:44,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:44,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:44,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:44,575 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:44,601 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-03-17 14:58:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:44,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-17 14:58:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:44,602 INFO L225 Difference]: With dead ends: 49 [2025-03-17 14:58:44,602 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 14:58:44,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:44,602 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:44,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 14:58:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 14:58:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-17 14:58:44,605 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2025-03-17 14:58:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:44,605 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-17 14:58:44,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-17 14:58:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:58:44,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:44,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:44,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:58:44,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash 254696027, now seen corresponding path program 1 times [2025-03-17 14:58:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287234291] [2025-03-17 14:58:44,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:44,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:58:44,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:58:44,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:44,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:44,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:44,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287234291] [2025-03-17 14:58:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287234291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:44,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429261114] [2025-03-17 14:58:44,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:44,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:44,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:44,675 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) [2025-03-17 14:58:44,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:58:44,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:58:44,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:58:44,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:44,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:44,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:58:44,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:44,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:44,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429261114] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:44,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:44,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-17 14:58:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359111456] [2025-03-17 14:58:44,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:44,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:58:44,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:44,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:58:44,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:58:44,844 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:44,880 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2025-03-17 14:58:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:58:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:58:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:44,881 INFO L225 Difference]: With dead ends: 78 [2025-03-17 14:58:44,881 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 14:58:44,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:58:44,882 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:44,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 14:58:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 14:58:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 47 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) [2025-03-17 14:58:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-17 14:58:44,889 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2025-03-17 14:58:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:44,890 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-17 14:58:44,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-17 14:58:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:58:44,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:44,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:44,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:58:45,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:45,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:45,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:45,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1202883147, now seen corresponding path program 1 times [2025-03-17 14:58:45,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:45,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798162607] [2025-03-17 14:58:45,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:45,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:45,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:58:45,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:58:45,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:45,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:58:45,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798162607] [2025-03-17 14:58:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798162607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:45,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:45,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:58:45,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053008343] [2025-03-17 14:58:45,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:45,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:45,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:45,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:45,152 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:45,170 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-17 14:58:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-17 14:58:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:45,172 INFO L225 Difference]: With dead ends: 48 [2025-03-17 14:58:45,172 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 14:58:45,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:45,173 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:45,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 14:58:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 14:58:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-17 14:58:45,178 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 14 [2025-03-17 14:58:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:45,178 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-17 14:58:45,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-17 14:58:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:58:45,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:45,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:58:45,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:58:45,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:45,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1365328131, now seen corresponding path program 1 times [2025-03-17 14:58:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:45,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444456654] [2025-03-17 14:58:45,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:45,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:45,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:58:45,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:58:45,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:45,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444456654] [2025-03-17 14:58:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444456654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721630561] [2025-03-17 14:58:45,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:45,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:45,300 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) [2025-03-17 14:58:45,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:58:45,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:58:45,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:58:45,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:45,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:45,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:58:45,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:45,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:58:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721630561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:45,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:58:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:58:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077575327] [2025-03-17 14:58:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:45,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:58:45,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:45,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:58:45,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:58:45,445 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:45,470 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-03-17 14:58:45,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:58:45,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 14:58:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:45,474 INFO L225 Difference]: With dead ends: 47 [2025-03-17 14:58:45,474 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 14:58:45,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:58:45,474 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:45,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 190 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 14:58:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 14:58:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.5) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-17 14:58:45,477 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 15 [2025-03-17 14:58:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:45,477 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-17 14:58:45,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-17 14:58:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:58:45,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:45,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:45,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:58:45,683 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,SelfDestructingSolverStorable5 [2025-03-17 14:58:45,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:45,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1150080306, now seen corresponding path program 1 times [2025-03-17 14:58:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:45,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49619455] [2025-03-17 14:58:45,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:45,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:58:45,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:58:45,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:45,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:45,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:45,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49619455] [2025-03-17 14:58:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49619455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:45,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046034662] [2025-03-17 14:58:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:45,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:45,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:45,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:45,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:45,741 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:45,773 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2025-03-17 14:58:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:45,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 18 [2025-03-17 14:58:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:45,774 INFO L225 Difference]: With dead ends: 81 [2025-03-17 14:58:45,774 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 14:58:45,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:45,775 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 65 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:45,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 56 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 14:58:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2025-03-17 14:58:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-17 14:58:45,779 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2025-03-17 14:58:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:45,779 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-17 14:58:45,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-17 14:58:45,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:58:45,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:45,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:45,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:58:45,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:45,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1292751136, now seen corresponding path program 1 times [2025-03-17 14:58:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:45,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687850355] [2025-03-17 14:58:45,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:45,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:45,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:58:45,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:58:45,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:45,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687850355] [2025-03-17 14:58:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687850355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713129888] [2025-03-17 14:58:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:45,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:45,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:45,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:45,862 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:45,892 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2025-03-17 14:58:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:45,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 14:58:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:45,893 INFO L225 Difference]: With dead ends: 66 [2025-03-17 14:58:45,893 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 14:58:45,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:45,894 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 56 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 14:58:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2025-03-17 14:58:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.425) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-17 14:58:45,897 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 19 [2025-03-17 14:58:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:45,897 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-17 14:58:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-17 14:58:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 14:58:45,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:45,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:45,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:58:45,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:45,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1088293534, now seen corresponding path program 1 times [2025-03-17 14:58:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216624136] [2025-03-17 14:58:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:45,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:58:45,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:58:45,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:45,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:45,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:45,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216624136] [2025-03-17 14:58:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216624136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:45,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:45,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:58:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970513771] [2025-03-17 14:58:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:45,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:45,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:45,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:45,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:45,965 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:46,000 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-03-17 14:58:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:46,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 14:58:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:46,001 INFO L225 Difference]: With dead ends: 68 [2025-03-17 14:58:46,002 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 14:58:46,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:46,002 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:46,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 14:58:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2025-03-17 14:58:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 56 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) [2025-03-17 14:58:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-03-17 14:58:46,006 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 21 [2025-03-17 14:58:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:46,006 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-03-17 14:58:46,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-03-17 14:58:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 14:58:46,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:46,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:46,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:58:46,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:46,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1088293694, now seen corresponding path program 1 times [2025-03-17 14:58:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:46,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375375291] [2025-03-17 14:58:46,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:46,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:58:46,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:58:46,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:46,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:46,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375375291] [2025-03-17 14:58:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375375291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:46,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:58:46,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681954209] [2025-03-17 14:58:46,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:46,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:46,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:46,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:46,072 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:46,103 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-03-17 14:58:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:46,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 14:58:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:46,103 INFO L225 Difference]: With dead ends: 100 [2025-03-17 14:58:46,104 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 14:58:46,104 INFO L434 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 [2025-03-17 14:58:46,104 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:46,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 14:58:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2025-03-17 14:58:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-03-17 14:58:46,108 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 21 [2025-03-17 14:58:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:46,108 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-03-17 14:58:46,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-03-17 14:58:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 14:58:46,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:46,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:46,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:58:46,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:46,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1355437720, now seen corresponding path program 1 times [2025-03-17 14:58:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605524356] [2025-03-17 14:58:46,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:46,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:46,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:58:46,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:58:46,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:46,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:46,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:46,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605524356] [2025-03-17 14:58:46,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605524356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:46,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204105596] [2025-03-17 14:58:46,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:46,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:46,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:46,192 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) [2025-03-17 14:58:46,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:58:46,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:58:46,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:58:46,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:46,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:46,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:58:46,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:46,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:58:46,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204105596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:46,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:58:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-17 14:58:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839464868] [2025-03-17 14:58:46,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:46,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:58:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:46,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:58:46,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:58:46,362 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:46,402 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2025-03-17 14:58:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:58:46,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 24 [2025-03-17 14:58:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:46,402 INFO L225 Difference]: With dead ends: 62 [2025-03-17 14:58:46,402 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 14:58:46,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:58:46,403 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:46,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 76 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 14:58:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-03-17 14:58:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-03-17 14:58:46,408 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 24 [2025-03-17 14:58:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:46,408 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-03-17 14:58:46,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-03-17 14:58:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 14:58:46,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:46,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:46,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:58:46,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:46,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:46,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash 931103658, now seen corresponding path program 1 times [2025-03-17 14:58:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:46,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321869451] [2025-03-17 14:58:46,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:46,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:46,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:58:46,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:58:46,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:46,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:46,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321869451] [2025-03-17 14:58:46,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321869451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557630440] [2025-03-17 14:58:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:46,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:46,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:46,707 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) [2025-03-17 14:58:46,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:58:46,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:58:46,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:58:46,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:46,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:46,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:58:46,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:46,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557630440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:46,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:58:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263186373] [2025-03-17 14:58:46,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:46,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:58:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:46,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:58:46,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:58:46,908 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:46,978 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-03-17 14:58:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:58:46,978 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 14:58:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:46,979 INFO L225 Difference]: With dead ends: 61 [2025-03-17 14:58:46,979 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 14:58:46,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:58:46,980 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 138 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:46,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 14:58:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-03-17 14:58:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-17 14:58:46,987 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 25 [2025-03-17 14:58:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:46,987 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-17 14:58:46,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-17 14:58:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 14:58:46,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:46,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:46,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:58:47,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:47,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1437418312, now seen corresponding path program 1 times [2025-03-17 14:58:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222822610] [2025-03-17 14:58:47,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:47,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:58:47,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:58:47,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:47,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 14:58:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222822610] [2025-03-17 14:58:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222822610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:47,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:47,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485529322] [2025-03-17 14:58:47,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:47,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:47,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:47,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:47,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:47,230 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:47,239 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-03-17 14:58:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 27 [2025-03-17 14:58:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:47,239 INFO L225 Difference]: With dead ends: 50 [2025-03-17 14:58:47,239 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 14:58:47,240 INFO L434 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 [2025-03-17 14:58:47,241 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:47,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 14:58:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 14:58:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-03-17 14:58:47,247 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 27 [2025-03-17 14:58:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:47,247 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-03-17 14:58:47,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-03-17 14:58:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:58:47,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:47,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:47,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:58:47,249 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:47,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1610289760, now seen corresponding path program 1 times [2025-03-17 14:58:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:47,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833992684] [2025-03-17 14:58:47,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:47,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:58:47,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:58:47,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:47,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:58:47,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833992684] [2025-03-17 14:58:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833992684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:58:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214045655] [2025-03-17 14:58:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:47,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:47,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:47,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:47,330 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:47,351 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-03-17 14:58:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:47,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 28 [2025-03-17 14:58:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:47,351 INFO L225 Difference]: With dead ends: 53 [2025-03-17 14:58:47,352 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 14:58:47,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:47,352 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:47,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 14:58:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-03-17 14:58:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.302325581395349) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-17 14:58:47,355 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2025-03-17 14:58:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:47,355 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-17 14:58:47,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-17 14:58:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:58:47,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:47,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:47,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:58:47,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:47,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1610294725, now seen corresponding path program 1 times [2025-03-17 14:58:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:47,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592842782] [2025-03-17 14:58:47,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:47,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:58:47,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:58:47,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:47,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592842782] [2025-03-17 14:58:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592842782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:47,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805537303] [2025-03-17 14:58:47,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:47,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:47,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:47,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:47,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:58:47,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:58:47,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:58:47,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:47,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:47,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:58:47,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:47,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:58:47,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805537303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:47,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:47,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:58:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034133798] [2025-03-17 14:58:47,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:47,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:58:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:47,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:58:47,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:58:47,626 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:47,745 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-03-17 14:58:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:58:47,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 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 28 [2025-03-17 14:58:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:47,746 INFO L225 Difference]: With dead ends: 67 [2025-03-17 14:58:47,746 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 14:58:47,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:58:47,747 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:47,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:58:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 14:58:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2025-03-17 14:58:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2025-03-17 14:58:47,750 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 28 [2025-03-17 14:58:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:47,751 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-03-17 14:58:47,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2025-03-17 14:58:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:58:47,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:47,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:47,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:58:47,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:58:47,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:47,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1167496229, now seen corresponding path program 1 times [2025-03-17 14:58:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:47,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346448931] [2025-03-17 14:58:47,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:47,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:58:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:58:47,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:47,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:58:48,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:48,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346448931] [2025-03-17 14:58:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346448931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:48,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:48,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:58:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845390490] [2025-03-17 14:58:48,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:48,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:48,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:48,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:48,008 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:48,039 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2025-03-17 14:58:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 28 [2025-03-17 14:58:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:48,040 INFO L225 Difference]: With dead ends: 68 [2025-03-17 14:58:48,040 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 14:58:48,040 INFO L434 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 [2025-03-17 14:58:48,040 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:48,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 14:58:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-17 14:58:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-03-17 14:58:48,045 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2025-03-17 14:58:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:48,045 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-03-17 14:58:48,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-03-17 14:58:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 14:58:48,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:48,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:48,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:58:48,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:48,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash 977256830, now seen corresponding path program 1 times [2025-03-17 14:58:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292814368] [2025-03-17 14:58:48,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:48,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:58:48,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:58:48,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:48,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:58:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292814368] [2025-03-17 14:58:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292814368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:48,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:48,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:58:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255613472] [2025-03-17 14:58:48,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:48,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:58:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:48,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:58:48,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:48,103 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:48,132 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-03-17 14:58:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:58:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 30 [2025-03-17 14:58:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:48,132 INFO L225 Difference]: With dead ends: 57 [2025-03-17 14:58:48,132 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 14:58:48,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:58:48,133 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:48,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 73 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 14:58:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 14:58:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2025-03-17 14:58:48,137 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 30 [2025-03-17 14:58:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:48,137 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2025-03-17 14:58:48,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2025-03-17 14:58:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 14:58:48,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:48,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:58:48,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:48,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1800435301, now seen corresponding path program 1 times [2025-03-17 14:58:48,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:48,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018875346] [2025-03-17 14:58:48,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:48,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:58:48,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:58:48,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:48,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:58:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018875346] [2025-03-17 14:58:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018875346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815699954] [2025-03-17 14:58:48,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:48,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:48,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:48,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:58:48,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:58:48,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:58:48,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:48,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:48,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:58:48,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:58:48,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:58:48,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815699954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:48,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:48,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:58:48,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017527868] [2025-03-17 14:58:48,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:48,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:58:48,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:48,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:58:48,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:58:48,423 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:48,500 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2025-03-17 14:58:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:58:48,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-17 14:58:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:48,502 INFO L225 Difference]: With dead ends: 91 [2025-03-17 14:58:48,502 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 14:58:48,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:58:48,503 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:48,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 180 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:58:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 14:58:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2025-03-17 14:58:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2025-03-17 14:58:48,511 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 31 [2025-03-17 14:58:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:48,511 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2025-03-17 14:58:48,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2025-03-17 14:58:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 14:58:48,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:48,512 INFO L218 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] [2025-03-17 14:58:48,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:58:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:58:48,713 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:48,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2125092240, now seen corresponding path program 1 times [2025-03-17 14:58:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856772409] [2025-03-17 14:58:48,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:48,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:58:48,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:58:48,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:48,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:58:48,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856772409] [2025-03-17 14:58:48,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856772409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547116353] [2025-03-17 14:58:48,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:48,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:48,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:48,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:48,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:58:48,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:58:48,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:58:48,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:48,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:48,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:58:48,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:58:49,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:58:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547116353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:49,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:58:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835952603] [2025-03-17 14:58:49,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:49,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:58:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:49,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:58:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:58:49,060 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:49,117 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-03-17 14:58:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:58:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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 33 [2025-03-17 14:58:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:49,118 INFO L225 Difference]: With dead ends: 102 [2025-03-17 14:58:49,118 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 14:58:49,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:58:49,119 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 69 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:49,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 126 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 14:58:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 14:58:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 78 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) [2025-03-17 14:58:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2025-03-17 14:58:49,124 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 33 [2025-03-17 14:58:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:49,124 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2025-03-17 14:58:49,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2025-03-17 14:58:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 14:58:49,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:49,125 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 14:58:49,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:58:49,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:49,329 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:49,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash -768662662, now seen corresponding path program 2 times [2025-03-17 14:58:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:49,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866545098] [2025-03-17 14:58:49,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:58:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:49,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 14:58:49,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:58:49,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:58:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:58:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866545098] [2025-03-17 14:58:49,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866545098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223204869] [2025-03-17 14:58:49,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:58:49,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:49,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:49,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:49,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:58:49,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 14:58:49,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:58:49,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:58:49,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:49,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:58:49,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:58:49,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:58:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223204869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:49,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2025-03-17 14:58:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781373893] [2025-03-17 14:58:49,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:49,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:58:49,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:49,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:58:49,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:58:49,590 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:49,669 INFO L93 Difference]: Finished difference Result 143 states and 167 transitions. [2025-03-17 14:58:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:58:49,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 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 39 [2025-03-17 14:58:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:49,670 INFO L225 Difference]: With dead ends: 143 [2025-03-17 14:58:49,670 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 14:58:49,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:58:49,670 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:49,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 130 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:58:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 14:58:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2025-03-17 14:58:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 78 states have (on average 1.205128205128205) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2025-03-17 14:58:49,675 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 39 [2025-03-17 14:58:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2025-03-17 14:58:49,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2025-03-17 14:58:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 14:58:49,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:49,675 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 14:58:49,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:58:49,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:49,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:49,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash -453971669, now seen corresponding path program 1 times [2025-03-17 14:58:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112960606] [2025-03-17 14:58:49,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:49,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 14:58:49,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:58:49,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:49,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:58:49,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:49,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112960606] [2025-03-17 14:58:49,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112960606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:49,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:49,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:58:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025668062] [2025-03-17 14:58:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:49,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:58:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:49,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:58:49,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:58:49,918 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:49,928 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2025-03-17 14:58:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:58:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 45 [2025-03-17 14:58:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:49,929 INFO L225 Difference]: With dead ends: 84 [2025-03-17 14:58:49,929 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 14:58:49,929 INFO L434 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 [2025-03-17 14:58:49,930 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:49,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 14:58:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-17 14:58:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 82 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2025-03-17 14:58:49,934 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 45 [2025-03-17 14:58:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:49,935 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2025-03-17 14:58:49,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2025-03-17 14:58:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 14:58:49,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:49,935 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 14:58:49,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:58:49,935 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:49,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1188219854, now seen corresponding path program 1 times [2025-03-17 14:58:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921351369] [2025-03-17 14:58:49,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:49,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 14:58:49,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:58:49,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:49,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:58:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921351369] [2025-03-17 14:58:50,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921351369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535260162] [2025-03-17 14:58:50,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:50,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:50,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:50,027 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:50,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:58:50,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 14:58:50,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:58:50,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:50,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:50,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:58:50,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:58:50,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:58:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535260162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:50,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:50,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:58:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940671036] [2025-03-17 14:58:50,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:50,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:58:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:50,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:58:50,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:58:50,248 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:50,365 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2025-03-17 14:58:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:58:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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 46 [2025-03-17 14:58:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:50,369 INFO L225 Difference]: With dead ends: 89 [2025-03-17 14:58:50,369 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 14:58:50,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:58:50,370 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:50,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 155 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:58:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 14:58:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2025-03-17 14:58:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-03-17 14:58:50,377 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 46 [2025-03-17 14:58:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:50,377 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-03-17 14:58:50,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-03-17 14:58:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 14:58:50,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:50,377 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 14:58:50,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:58:50,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:50,581 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1819735300, now seen corresponding path program 1 times [2025-03-17 14:58:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004249790] [2025-03-17 14:58:50,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:50,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:58:50,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:58:50,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:50,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:58:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004249790] [2025-03-17 14:58:50,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004249790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719713440] [2025-03-17 14:58:50,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:50,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:50,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:50,649 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:50,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:58:50,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:58:50,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:58:50,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:50,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:50,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:58:50,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:58:50,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:58:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719713440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:50,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 14:58:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466274777] [2025-03-17 14:58:50,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:50,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:58:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:50,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:58:50,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:58:50,858 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:50,910 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2025-03-17 14:58:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:58:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 47 [2025-03-17 14:58:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:50,911 INFO L225 Difference]: With dead ends: 95 [2025-03-17 14:58:50,912 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 14:58:50,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:58:50,912 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:50,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 14:58:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 14:58:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-03-17 14:58:50,917 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 47 [2025-03-17 14:58:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:50,917 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-03-17 14:58:50,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-03-17 14:58:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 14:58:50,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:50,919 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 14:58:50,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:58:51,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 14:58:51,123 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:51,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash 201977511, now seen corresponding path program 1 times [2025-03-17 14:58:51,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:51,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349417792] [2025-03-17 14:58:51,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:51,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:58:51,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:58:51,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:51,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:58:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349417792] [2025-03-17 14:58:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349417792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848076613] [2025-03-17 14:58:51,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:51,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:51,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:51,229 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:51,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:58:51,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:58:51,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:58:51,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:51,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:51,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:58:51,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:58:51,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:58:51,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848076613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:51,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:51,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-17 14:58:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192129044] [2025-03-17 14:58:51,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:51,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:58:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:51,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:58:51,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:58:51,458 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:51,528 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2025-03-17 14:58:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:58:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-17 14:58:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:51,529 INFO L225 Difference]: With dead ends: 114 [2025-03-17 14:58:51,529 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 14:58:51,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:58:51,530 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:51,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:58:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 14:58:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 14:58:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 112 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2025-03-17 14:58:51,537 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 51 [2025-03-17 14:58:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:51,538 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2025-03-17 14:58:51,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2025-03-17 14:58:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 14:58:51,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:51,538 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 14:58:51,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:58:51,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 14:58:51,739 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:51,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:51,739 INFO L85 PathProgramCache]: Analyzing trace with hash 826859941, now seen corresponding path program 1 times [2025-03-17 14:58:51,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:51,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634947715] [2025-03-17 14:58:51,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:51,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:51,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 14:58:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 14:58:51,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:58:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634947715] [2025-03-17 14:58:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634947715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667775739] [2025-03-17 14:58:51,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:51,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:51,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:51,837 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:51,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:58:51,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 14:58:51,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 14:58:51,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:51,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:51,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:58:51,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:58:52,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:58:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667775739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:52,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:58:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2025-03-17 14:58:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308228640] [2025-03-17 14:58:52,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:52,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:58:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:52,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:58:52,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:58:52,100 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:52,144 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2025-03-17 14:58:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:58:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 [2025-03-17 14:58:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:52,145 INFO L225 Difference]: With dead ends: 113 [2025-03-17 14:58:52,145 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 14:58:52,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:58:52,145 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:52,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 14:58:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 14:58:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 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) [2025-03-17 14:58:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-17 14:58:52,150 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 53 [2025-03-17 14:58:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:52,150 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-17 14:58:52,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-17 14:58:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 14:58:52,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:52,151 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:58:52,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:58:52,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 14:58:52,351 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 14:58:52,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1780558358, now seen corresponding path program 2 times [2025-03-17 14:58:52,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:52,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338040440] [2025-03-17 14:58:52,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:58:52,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:52,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-17 14:58:52,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 58 statements. [2025-03-17 14:58:52,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:58:52,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 14:58:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338040440] [2025-03-17 14:58:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338040440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986024814] [2025-03-17 14:58:52,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:58:52,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:52,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:52,386 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:52,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:58:52,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-17 14:58:52,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 58 statements. [2025-03-17 14:58:52,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:58:52,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:52,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:58:52,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 14:58:52,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 14:58:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986024814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:52,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:58:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940714022] [2025-03-17 14:58:52,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:52,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:58:52,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:52,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:58:52,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:58:52,679 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:52,706 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-03-17 14:58:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:58:52,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 58 [2025-03-17 14:58:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:52,706 INFO L225 Difference]: With dead ends: 59 [2025-03-17 14:58:52,706 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:58:52,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:58:52,706 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:52,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:58:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:58:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:58:52,707 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) [2025-03-17 14:58:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:58:52,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2025-03-17 14:58:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:52,707 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:58:52,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:58:52,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:58:52,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-03-17 14:58:52,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-03-17 14:58:52,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-03-17 14:58:52,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-03-17 14:58:52,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-03-17 14:58:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-03-17 14:58:52,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 14:58:52,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 14:58:52,915 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-17 14:58:52,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:58:53,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:58:53,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:58:53,103 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:58:53,103 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:58:53,104 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:58:53,108 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-03-17 14:58:53,108 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-03-17 14:58:53,109 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:58:53,111 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:58:53,111 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-17 14:58:53,111 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-17 14:58:53,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:58:53 BoogieIcfgContainer [2025-03-17 14:58:53,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:58:53,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:58:53,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:58:53,114 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:58:53,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:44" (3/4) ... [2025-03-17 14:58:53,116 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:58:53,121 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure myexit [2025-03-17 14:58:53,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 14:58:53,127 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 14:58:53,128 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:58:53,128 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:58:53,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:58:53,204 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:58:53,204 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:58:53,205 INFO L158 Benchmark]: Toolchain (without parser) took 9915.35ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 104.7MB in the beginning and 272.3MB in the end (delta: -167.5MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2025-03-17 14:58:53,205 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:58:53,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.84ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 86.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:58:53,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.04ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:58:53,206 INFO L158 Benchmark]: Boogie Preprocessor took 33.18ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:58:53,206 INFO L158 Benchmark]: IcfgBuilder took 367.75ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 66.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:58:53,207 INFO L158 Benchmark]: TraceAbstraction took 9084.01ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 65.5MB in the beginning and 277.5MB in the end (delta: -212.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-03-17 14:58:53,207 INFO L158 Benchmark]: Witness Printer took 91.38ms. Allocated memory is still 369.1MB. Free memory was 277.5MB in the beginning and 272.3MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:58:53,208 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.35ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.84ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 86.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.04ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.18ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 367.75ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 66.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9084.01ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 65.5MB in the beginning and 277.5MB in the end (delta: -212.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 91.38ms. Allocated memory is still 369.1MB. Free memory was 277.5MB in the beginning and 272.3MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 * 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: 633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 599]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 599]: 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, 51 locations, 61 edges, 14 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 580 mSDsluCounter, 2701 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1913 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1383 IncrementalHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 788 mSDtfsCounter, 1383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 925 GetRequests, 754 SyntacticMatches, 13 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=24, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 108 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1191 NumberOfCodeBlocks, 1091 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1511 ConstructedInterpolants, 0 QuantifiedInterpolants, 3625 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3115 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 49 InterpolantComputations, 16 PerfectInterpolantSequences, 767/992 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 611]: Location Invariant Derived location invariant: ((index == 0) || (index <= 2147483648)) - InvariantResult [Line: 587]: Location Invariant Derived location invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 629]: Location Invariant Derived location invariant: (((i == 0) && (len == 2)) || (((1 <= i) && (i <= 2147483645)) && (len == 2))) - InvariantResult [Line: 618]: Location Invariant Derived location invariant: ((index == 0) || (index <= 2147483648)) - InvariantResult [Line: 633]: Location Invariant Derived location invariant: ((((i == 0) && (len == 2)) || (((i <= 2147483645) && (2 <= i)) && (len == 2))) || ((i == 1) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:58:53,227 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