./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/uthash-2.0.2/uthash_JEN_nondet_test4-1.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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:54:20,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:54:21,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:54:21,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:54:21,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:54:21,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:54:21,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:54:21,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:54:21,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:54:21,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:54:21,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:54:21,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:54:21,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:54:21,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:54:21,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:54:21,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:54:21,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:54:21,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:54:21,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:54:21,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:54:21,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:54:21,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:54:21,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:54:21,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:54:21,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:54:21,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:54:21,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:54:21,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:54:21,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:54:21,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:54:21,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:54:21,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:54:21,052 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2025-03-04 14:54:21,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:54:21,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:54:21,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:54:21,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:54:21,316 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:54:21,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2025-03-04 14:54:22,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25228f496/ed4fc640e08743d397031a1171377008/FLAGc361700f7 [2025-03-04 14:54:22,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:54:22,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2025-03-04 14:54:22,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25228f496/ed4fc640e08743d397031a1171377008/FLAGc361700f7 [2025-03-04 14:54:23,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25228f496/ed4fc640e08743d397031a1171377008 [2025-03-04 14:54:23,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:54:23,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:54:23,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:54:23,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:54:23,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:54:23,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a374779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23, skipping insertion in model container [2025-03-04 14:54:23,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:54:23,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:54:23,365 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:54:23,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:54:23,474 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:54:23,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23 WrapperNode [2025-03-04 14:54:23,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:54:23,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:54:23,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:54:23,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:54:23,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,546 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1509 [2025-03-04 14:54:23,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:54:23,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:54:23,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:54:23,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:54:23,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,633 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-03-04 14:54:23,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:54:23,678 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:54:23,678 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:54:23,678 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:54:23,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (1/1) ... [2025-03-04 14:54:23,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:54:23,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:54:23,701 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-04 14:54:23,703 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-04 14:54:23,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:54:23,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:54:23,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:54:23,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:54:23,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:54:23,719 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:54:23,719 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:54:23,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:54:23,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:54:23,878 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:54:23,879 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:54:25,106 INFO L? ?]: Removed 381 outVars from TransFormulas that were not future-live. [2025-03-04 14:54:25,107 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:54:25,142 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:54:25,142 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 14:54:25,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:25 BoogieIcfgContainer [2025-03-04 14:54:25,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:54:25,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:54:25,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:54:25,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:54:25,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:54:23" (1/3) ... [2025-03-04 14:54:25,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f583e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:25, skipping insertion in model container [2025-03-04 14:54:25,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:23" (2/3) ... [2025-03-04 14:54:25,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f583e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:25, skipping insertion in model container [2025-03-04 14:54:25,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:25" (3/3) ... [2025-03-04 14:54:25,148 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-1.i [2025-03-04 14:54:25,157 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:54:25,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test4-1.i that has 3 procedures, 407 locations, 1 initial locations, 34 loop locations, and 4 error locations. [2025-03-04 14:54:25,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:54:25,216 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;@2cdf73e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:54:25,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 14:54:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 403 states, 391 states have (on average 1.6138107416879794) internal successors, (631), 395 states have internal predecessors, (631), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:54:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:54:25,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:25,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:25,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:25,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash -235831506, now seen corresponding path program 1 times [2025-03-04 14:54:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860476959] [2025-03-04 14:54:25,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:25,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:54:25,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:54:25,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:25,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:25,328 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-04 14:54:25,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:25,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860476959] [2025-03-04 14:54:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860476959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:54:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143470205] [2025-03-04 14:54:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:25,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:54:25,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:25,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:54:25,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:54:25,349 INFO L87 Difference]: Start difference. First operand has 403 states, 391 states have (on average 1.6138107416879794) internal successors, (631), 395 states have internal predecessors, (631), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) 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-04 14:54:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:25,460 INFO L93 Difference]: Finished difference Result 801 states and 1281 transitions. [2025-03-04 14:54:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:54:25,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) 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-04 14:54:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:25,469 INFO L225 Difference]: With dead ends: 801 [2025-03-04 14:54:25,469 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 14:54:25,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:54:25,476 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:25,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 14:54:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-04 14:54:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 382 states have (on average 1.450261780104712) internal successors, (554), 384 states have internal predecessors, (554), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:54:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 566 transitions. [2025-03-04 14:54:25,526 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 566 transitions. Word has length 7 [2025-03-04 14:54:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:25,527 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 566 transitions. [2025-03-04 14:54:25,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) 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-04 14:54:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 566 transitions. [2025-03-04 14:54:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:54:25,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:25,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:25,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:54:25,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:25,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1279188344, now seen corresponding path program 1 times [2025-03-04 14:54:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:25,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957939339] [2025-03-04 14:54:25,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:25,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:25,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:54:25,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:54:25,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:25,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 14:54:25,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129306625] [2025-03-04 14:54:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:25,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:54:25,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:54:25,582 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-04 14:54:25,586 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-04 14:54:25,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:54:25,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:54:25,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:25,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:25,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:54:25,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:54:25,729 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-04 14:54:25,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:54:25,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957939339] [2025-03-04 14:54:25,730 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 14:54:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129306625] [2025-03-04 14:54:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129306625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:25,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:25,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:54:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761154455] [2025-03-04 14:54:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:25,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:54:25,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:25,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:54:25,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:54:25,732 INFO L87 Difference]: Start difference. First operand 392 states and 566 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-04 14:54:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:25,897 INFO L93 Difference]: Finished difference Result 773 states and 1121 transitions. [2025-03-04 14:54:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:54:25,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-04 14:54:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:25,905 INFO L225 Difference]: With dead ends: 773 [2025-03-04 14:54:25,905 INFO L226 Difference]: Without dead ends: 772 [2025-03-04 14:54:25,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-04 14:54:25,907 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 537 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:25,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1108 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-04 14:54:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 397. [2025-03-04 14:54:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 387 states have (on average 1.4444444444444444) internal successors, (559), 389 states have internal predecessors, (559), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:54:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 571 transitions. [2025-03-04 14:54:25,931 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 571 transitions. Word has length 8 [2025-03-04 14:54:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:25,931 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 571 transitions. [2025-03-04 14:54:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-04 14:54:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 571 transitions. [2025-03-04 14:54:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 14:54:25,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:25,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:25,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:54:26,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:54:26,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:26,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:26,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1961729167, now seen corresponding path program 1 times [2025-03-04 14:54:26,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:26,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550986980] [2025-03-04 14:54:26,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:26,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:26,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 14:54:26,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 14:54:26,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:26,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:26,664 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-04 14:54:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550986980] [2025-03-04 14:54:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550986980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:54:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142265238] [2025-03-04 14:54:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:26,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:54:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:26,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:54:26,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:54:26,666 INFO L87 Difference]: Start difference. First operand 397 states and 571 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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-04 14:54:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:26,818 INFO L93 Difference]: Finished difference Result 789 states and 1137 transitions. [2025-03-04 14:54:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:54:26,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-03-04 14:54:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:26,820 INFO L225 Difference]: With dead ends: 789 [2025-03-04 14:54:26,820 INFO L226 Difference]: Without dead ends: 400 [2025-03-04 14:54:26,821 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-04 14:54:26,821 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 105 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:26,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1401 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-04 14:54:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2025-03-04 14:54:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 387 states have (on average 1.426356589147287) internal successors, (552), 389 states have internal predecessors, (552), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:54:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 564 transitions. [2025-03-04 14:54:26,831 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 564 transitions. Word has length 148 [2025-03-04 14:54:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:26,832 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 564 transitions. [2025-03-04 14:54:26,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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-04 14:54:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 564 transitions. [2025-03-04 14:54:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 14:54:26,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:26,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:26,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:54:26,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:26,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash -215224904, now seen corresponding path program 1 times [2025-03-04 14:54:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317428664] [2025-03-04 14:54:26,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:26,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 14:54:26,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 14:54:26,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:26,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:27,077 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-04 14:54:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317428664] [2025-03-04 14:54:27,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317428664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:27,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:27,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:54:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620142760] [2025-03-04 14:54:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:27,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:54:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:27,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:54:27,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:54:27,081 INFO L87 Difference]: Start difference. First operand 397 states and 564 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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-04 14:54:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:27,216 INFO L93 Difference]: Finished difference Result 911 states and 1305 transitions. [2025-03-04 14:54:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:54:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-03-04 14:54:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:27,219 INFO L225 Difference]: With dead ends: 911 [2025-03-04 14:54:27,219 INFO L226 Difference]: Without dead ends: 522 [2025-03-04 14:54:27,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:54:27,222 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 134 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1020 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-04 14:54:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-04 14:54:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 512 states have (on average 1.4375) internal successors, (736), 514 states have internal predecessors, (736), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:54:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 748 transitions. [2025-03-04 14:54:27,237 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 748 transitions. Word has length 148 [2025-03-04 14:54:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:27,239 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 748 transitions. [2025-03-04 14:54:27,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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-04 14:54:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 748 transitions. [2025-03-04 14:54:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 14:54:27,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:27,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:27,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:54:27,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:27,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:27,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1098602317, now seen corresponding path program 1 times [2025-03-04 14:54:27,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:27,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657646814] [2025-03-04 14:54:27,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:27,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 14:54:27,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 14:54:27,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:27,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:54:27,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657646814] [2025-03-04 14:54:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657646814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:27,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:54:27,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15473360] [2025-03-04 14:54:27,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:27,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:54:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:27,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:54:27,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:54:27,636 INFO L87 Difference]: Start difference. First operand 522 states and 748 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:54:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:27,763 INFO L93 Difference]: Finished difference Result 869 states and 1238 transitions. [2025-03-04 14:54:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:54:27,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 163 [2025-03-04 14:54:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:27,766 INFO L225 Difference]: With dead ends: 869 [2025-03-04 14:54:27,766 INFO L226 Difference]: Without dead ends: 480 [2025-03-04 14:54:27,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:54:27,767 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 30 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:27,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1250 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-04 14:54:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-04 14:54:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 470 states have (on average 1.402127659574468) internal successors, (659), 472 states have internal predecessors, (659), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:54:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 671 transitions. [2025-03-04 14:54:27,776 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 671 transitions. Word has length 163 [2025-03-04 14:54:27,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:27,777 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 671 transitions. [2025-03-04 14:54:27,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:54:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 671 transitions. [2025-03-04 14:54:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 14:54:27,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:27,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:27,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:54:27,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:27,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1790083885, now seen corresponding path program 1 times [2025-03-04 14:54:27,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389933459] [2025-03-04 14:54:27,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:27,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 14:54:27,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 14:54:27,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:27,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:54:27,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389933459] [2025-03-04 14:54:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389933459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:27,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:27,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:54:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771307323] [2025-03-04 14:54:27,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:27,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:54:27,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:27,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:54:27,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:54:27,977 INFO L87 Difference]: Start difference. First operand 480 states and 671 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:54:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:28,088 INFO L93 Difference]: Finished difference Result 970 states and 1345 transitions. [2025-03-04 14:54:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:54:28,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 163 [2025-03-04 14:54:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:28,092 INFO L225 Difference]: With dead ends: 970 [2025-03-04 14:54:28,092 INFO L226 Difference]: Without dead ends: 623 [2025-03-04 14:54:28,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:54:28,095 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 242 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:28,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 872 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-04 14:54:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2025-03-04 14:54:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 610 states have (on average 1.3885245901639345) internal successors, (847), 612 states have internal predecessors, (847), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 14:54:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 865 transitions. [2025-03-04 14:54:28,122 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 865 transitions. Word has length 163 [2025-03-04 14:54:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:28,122 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 865 transitions. [2025-03-04 14:54:28,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:54:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 865 transitions. [2025-03-04 14:54:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 14:54:28,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:28,125 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:28,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:54:28,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:28,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash -660852123, now seen corresponding path program 1 times [2025-03-04 14:54:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983329554] [2025-03-04 14:54:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:28,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 14:54:28,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 14:54:28,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:28,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:54:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983329554] [2025-03-04 14:54:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983329554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:54:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789480002] [2025-03-04 14:54:28,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:54:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:28,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:54:28,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:54:28,419 INFO L87 Difference]: Start difference. First operand 623 states and 865 transitions. Second operand has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:28,535 INFO L93 Difference]: Finished difference Result 688 states and 950 transitions. [2025-03-04 14:54:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:54:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 178 [2025-03-04 14:54:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:28,538 INFO L225 Difference]: With dead ends: 688 [2025-03-04 14:54:28,538 INFO L226 Difference]: Without dead ends: 686 [2025-03-04 14:54:28,538 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-04 14:54:28,539 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 293 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:28,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1374 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-04 14:54:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-04 14:54:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 670 states have (on average 1.3791044776119403) internal successors, (924), 672 states have internal predecessors, (924), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:54:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 948 transitions. [2025-03-04 14:54:28,558 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 948 transitions. Word has length 178 [2025-03-04 14:54:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:28,558 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 948 transitions. [2025-03-04 14:54:28,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 948 transitions. [2025-03-04 14:54:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 14:54:28,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:28,560 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:28,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:54:28,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:28,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash -510653321, now seen corresponding path program 1 times [2025-03-04 14:54:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:28,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660054118] [2025-03-04 14:54:28,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:28,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:54:29,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:54:29,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:29,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:54:29,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:29,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660054118] [2025-03-04 14:54:29,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660054118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:54:29,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436958313] [2025-03-04 14:54:29,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:54:29,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:54:29,368 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-04 14:54:29,369 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-04 14:54:29,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:54:29,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:54:29,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:29,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:29,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 14:54:29,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:54:29,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 14:54:29,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 14:54:30,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 14:54:30,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-04 14:54:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:54:30,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:54:30,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436958313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:30,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:54:30,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 14:54:30,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583711848] [2025-03-04 14:54:30,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:30,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 14:54:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:30,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 14:54:30,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:54:30,404 INFO L87 Difference]: Start difference. First operand 686 states and 948 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:32,746 INFO L93 Difference]: Finished difference Result 1336 states and 1840 transitions. [2025-03-04 14:54:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 14:54:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-04 14:54:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:32,752 INFO L225 Difference]: With dead ends: 1336 [2025-03-04 14:54:32,752 INFO L226 Difference]: Without dead ends: 736 [2025-03-04 14:54:32,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:54:32,754 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 737 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:32,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 2607 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 14:54:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-04 14:54:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 715. [2025-03-04 14:54:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 699 states have (on average 1.3733905579399142) internal successors, (960), 701 states have internal predecessors, (960), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:54:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 984 transitions. [2025-03-04 14:54:32,773 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 984 transitions. Word has length 184 [2025-03-04 14:54:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:32,773 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 984 transitions. [2025-03-04 14:54:32,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 984 transitions. [2025-03-04 14:54:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 14:54:32,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:32,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:32,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:54:32,976 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,SelfDestructingSolverStorable7 [2025-03-04 14:54:32,976 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:32,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash -338239240, now seen corresponding path program 1 times [2025-03-04 14:54:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143329358] [2025-03-04 14:54:32,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:32,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:33,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:54:33,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:54:33,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:33,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:54:33,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:33,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143329358] [2025-03-04 14:54:33,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143329358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:33,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:33,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:54:33,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657345658] [2025-03-04 14:54:33,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:33,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:54:33,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:33,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:54:33,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:54:33,160 INFO L87 Difference]: Start difference. First operand 715 states and 984 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:33,239 INFO L93 Difference]: Finished difference Result 1350 states and 1862 transitions. [2025-03-04 14:54:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:54:33,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-04 14:54:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:33,241 INFO L225 Difference]: With dead ends: 1350 [2025-03-04 14:54:33,242 INFO L226 Difference]: Without dead ends: 731 [2025-03-04 14:54:33,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 14:54:33,243 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 2 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:33,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 848 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-03-04 14:54:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2025-03-04 14:54:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 713 states have (on average 1.3632538569424966) internal successors, (972), 715 states have internal predecessors, (972), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:54:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 996 transitions. [2025-03-04 14:54:33,256 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 996 transitions. Word has length 184 [2025-03-04 14:54:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:33,256 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 996 transitions. [2025-03-04 14:54:33,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 996 transitions. [2025-03-04 14:54:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 14:54:33,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:33,257 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:33,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:54:33,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:33,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2142935353, now seen corresponding path program 1 times [2025-03-04 14:54:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:33,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396173359] [2025-03-04 14:54:33,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:33,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:54:33,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:54:33,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:33,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:54:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396173359] [2025-03-04 14:54:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396173359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:33,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:54:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117115505] [2025-03-04 14:54:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:33,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:54:33,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:33,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:54:33,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:54:33,409 INFO L87 Difference]: Start difference. First operand 729 states and 996 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:33,492 INFO L93 Difference]: Finished difference Result 1291 states and 1757 transitions. [2025-03-04 14:54:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:54:33,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-04 14:54:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:33,495 INFO L225 Difference]: With dead ends: 1291 [2025-03-04 14:54:33,495 INFO L226 Difference]: Without dead ends: 590 [2025-03-04 14:54:33,496 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-04 14:54:33,496 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 9 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:33,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1046 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-04 14:54:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-04 14:54:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 574 states have (on average 1.329268292682927) internal successors, (763), 576 states have internal predecessors, (763), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:54:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 787 transitions. [2025-03-04 14:54:33,508 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 787 transitions. Word has length 184 [2025-03-04 14:54:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:33,508 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 787 transitions. [2025-03-04 14:54:33,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 787 transitions. [2025-03-04 14:54:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 14:54:33,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:33,509 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:33,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:54:33,509 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -6473068, now seen corresponding path program 1 times [2025-03-04 14:54:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516175517] [2025-03-04 14:54:33,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:33,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 14:54:33,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 14:54:33,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:33,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:54:34,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:34,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516175517] [2025-03-04 14:54:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516175517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:54:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176985326] [2025-03-04 14:54:34,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:34,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:54:34,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:54:34,057 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-04 14:54:34,065 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-04 14:54:34,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 14:54:34,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 14:54:34,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:34,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:34,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 14:54:34,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:54:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:54:34,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:54:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176985326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:34,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:54:34,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 14:54:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088676154] [2025-03-04 14:54:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:34,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:54:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:34,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:54:34,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:54:34,563 INFO L87 Difference]: Start difference. First operand 590 states and 787 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:34,696 INFO L93 Difference]: Finished difference Result 1142 states and 1534 transitions. [2025-03-04 14:54:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:54:34,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-04 14:54:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:34,699 INFO L225 Difference]: With dead ends: 1142 [2025-03-04 14:54:34,699 INFO L226 Difference]: Without dead ends: 590 [2025-03-04 14:54:34,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:54:34,700 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 13 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:34,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 972 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-04 14:54:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-04 14:54:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 574 states have (on average 1.3257839721254356) internal successors, (761), 576 states have internal predecessors, (761), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:54:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 785 transitions. [2025-03-04 14:54:34,714 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 785 transitions. Word has length 185 [2025-03-04 14:54:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:34,714 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 785 transitions. [2025-03-04 14:54:34,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 785 transitions. [2025-03-04 14:54:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 14:54:34,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:34,716 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:34,726 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-04 14:54:34,916 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-04 14:54:34,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:34,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1317435340, now seen corresponding path program 1 times [2025-03-04 14:54:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:34,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244012072] [2025-03-04 14:54:34,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:34,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:34,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:54:35,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:54:35,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:35,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:54:35,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:35,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244012072] [2025-03-04 14:54:35,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244012072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:35,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:54:35,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:54:35,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398253050] [2025-03-04 14:54:35,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:35,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:54:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:35,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:54:35,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:54:35,399 INFO L87 Difference]: Start difference. First operand 590 states and 785 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:35,628 INFO L93 Difference]: Finished difference Result 1145 states and 1536 transitions. [2025-03-04 14:54:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:54:35,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-04 14:54:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:35,630 INFO L225 Difference]: With dead ends: 1145 [2025-03-04 14:54:35,630 INFO L226 Difference]: Without dead ends: 596 [2025-03-04 14:54:35,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:54:35,631 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 4 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:35,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1266 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:54:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-04 14:54:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-04 14:54:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 580 states have (on average 1.3224137931034483) internal successors, (767), 582 states have internal predecessors, (767), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:54:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 791 transitions. [2025-03-04 14:54:35,644 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 791 transitions. Word has length 186 [2025-03-04 14:54:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:35,644 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 791 transitions. [2025-03-04 14:54:35,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:54:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 791 transitions. [2025-03-04 14:54:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 14:54:35,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:35,646 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:35,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:54:35,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash -248963459, now seen corresponding path program 1 times [2025-03-04 14:54:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402048524] [2025-03-04 14:54:35,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:35,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 14:54:35,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 14:54:35,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:35,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:54:36,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:36,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402048524] [2025-03-04 14:54:36,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402048524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:54:36,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901140570] [2025-03-04 14:54:36,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:36,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:54:36,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:54:36,155 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-04 14:54:36,156 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-04 14:54:36,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 14:54:36,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 14:54:36,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:36,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:36,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 14:54:36,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:54:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:54:36,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:54:36,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901140570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:54:36,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:54:36,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-03-04 14:54:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563698469] [2025-03-04 14:54:36,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:54:36,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:54:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:54:36,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:54:36,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:54:36,826 INFO L87 Difference]: Start difference. First operand 596 states and 791 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:54:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:54:36,964 INFO L93 Difference]: Finished difference Result 1104 states and 1480 transitions. [2025-03-04 14:54:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:54:36,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 187 [2025-03-04 14:54:36,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:54:36,968 INFO L225 Difference]: With dead ends: 1104 [2025-03-04 14:54:36,968 INFO L226 Difference]: Without dead ends: 599 [2025-03-04 14:54:36,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:54:36,971 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 363 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:54:36,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1429 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:54:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-04 14:54:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-04 14:54:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 582 states have (on average 1.3230240549828178) internal successors, (770), 585 states have internal predecessors, (770), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-04 14:54:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 798 transitions. [2025-03-04 14:54:36,989 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 798 transitions. Word has length 187 [2025-03-04 14:54:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:54:36,990 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 798 transitions. [2025-03-04 14:54:36,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:54:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 798 transitions. [2025-03-04 14:54:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 14:54:36,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:54:36,992 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:54:37,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:54:37,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:54:37,193 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 14:54:37,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:54:37,193 INFO L85 PathProgramCache]: Analyzing trace with hash -792763387, now seen corresponding path program 1 times [2025-03-04 14:54:37,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:54:37,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203160955] [2025-03-04 14:54:37,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:54:37,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 14:54:37,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 14:54:37,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:37,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 14:54:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:54:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203160955] [2025-03-04 14:54:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203160955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:54:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745417637] [2025-03-04 14:54:37,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:54:37,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:54:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:54:37,806 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-04 14:54:37,807 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-04 14:54:38,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 14:54:38,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 14:54:38,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:54:38,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:54:38,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-03-04 14:54:38,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:54:38,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 14:54:38,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 14:54:38,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2025-03-04 14:54:38,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2025-03-04 14:54:38,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-04 14:54:38,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 14:54:38,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 14:54:38,857 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 14:54:38,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 14:54:38,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 14:54:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 14:54:38,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 14:54:38,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 14:54:39,118 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 14:54:39,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-03-04 14:54:39,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 14:54:39,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16