./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.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/array-memsafety/openbsd_cstrpbrk-alloca-2.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 d450427152972d80716d02c80706dd3b248a3fc7c05c71ffd29d66e32e1e82f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:25:15,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:25:15,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:25:15,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:25:15,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:25:15,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:25:15,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:25:15,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:25:15,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:25:15,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:25:15,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:25:15,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:25:15,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:25:15,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:25:15,364 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:25:15,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:25:15,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:25:15,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:25:15,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:25:15,368 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:25:15,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:25:15,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:25:15,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:25:15,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:25:15,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:25:15,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:25:15,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:25:15,369 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 -> d450427152972d80716d02c80706dd3b248a3fc7c05c71ffd29d66e32e1e82f2 [2025-03-04 10:25:15,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:25:15,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:25:15,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:25:15,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:25:15,618 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:25:15,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2025-03-04 10:25:16,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe7f800/4c568559ebb9447392527ff0d0b92790/FLAG69f0ae54d [2025-03-04 10:25:17,017 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:25:17,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2025-03-04 10:25:17,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe7f800/4c568559ebb9447392527ff0d0b92790/FLAG69f0ae54d [2025-03-04 10:25:17,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe7f800/4c568559ebb9447392527ff0d0b92790 [2025-03-04 10:25:17,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:25:17,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:25:17,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:25:17,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:25:17,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:25:17,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f46a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17, skipping insertion in model container [2025-03-04 10:25:17,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:25:17,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:25:17,550 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:25:17,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:25:17,610 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:25:17,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17 WrapperNode [2025-03-04 10:25:17,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:25:17,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:25:17,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:25:17,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:25:17,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,643 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-03-04 10:25:17,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:25:17,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:25:17,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:25:17,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:25:17,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,671 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-04 10:25:17,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,676 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:25:17,681 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:25:17,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:25:17,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:25:17,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (1/1) ... [2025-03-04 10:25:17,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:25:17,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:17,707 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 10:25:17,708 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 10:25:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:25:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:25:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:25:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:25:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:25:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:25:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:25:17,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:25:17,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:25:17,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:25:17,894 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L534: call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-03-04 10:25:17,910 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-04 10:25:17,911 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:25:17,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:25:17,920 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:25:17,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:25:17 BoogieIcfgContainer [2025-03-04 10:25:17,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:25:17,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:25:17,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:25:17,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:25:17,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:25:17" (1/3) ... [2025-03-04 10:25:17,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f74227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:25:17, skipping insertion in model container [2025-03-04 10:25:17,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:25:17" (2/3) ... [2025-03-04 10:25:17,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f74227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:25:17, skipping insertion in model container [2025-03-04 10:25:17,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:25:17" (3/3) ... [2025-03-04 10:25:17,929 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-2.i [2025-03-04 10:25:17,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:25:17,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrpbrk-alloca-2.i that has 1 procedures, 33 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-04 10:25:17,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:25:17,989 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;@5e8c9704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:25:17,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:25:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:25:17,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:17,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:17,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:18,000 INFO L85 PathProgramCache]: Analyzing trace with hash 30503880, now seen corresponding path program 1 times [2025-03-04 10:25:18,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:18,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610163734] [2025-03-04 10:25:18,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:18,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:18,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:25:18,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:25:18,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:18,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:18,226 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 10:25:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610163734] [2025-03-04 10:25:18,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610163734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:18,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:25:18,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:25:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576430913] [2025-03-04 10:25:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:25:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:18,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:25:18,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:25:18,246 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 10:25:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:18,276 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2025-03-04 10:25:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:25:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 10:25:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:18,286 INFO L225 Difference]: With dead ends: 48 [2025-03-04 10:25:18,286 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 10:25:18,288 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 10:25:18,289 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:18,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 10:25:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 10:25:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-04 10:25:18,311 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2025-03-04 10:25:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:18,313 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-04 10:25:18,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 10:25:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-04 10:25:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:25:18,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:18,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:25:18,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:18,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash 945615351, now seen corresponding path program 1 times [2025-03-04 10:25:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:18,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052601035] [2025-03-04 10:25:18,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:18,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:25:18,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:25:18,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:18,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:18,416 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 10:25:18,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052601035] [2025-03-04 10:25:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052601035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:18,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:25:18,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:25:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173974661] [2025-03-04 10:25:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:18,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:25:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:18,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:25:18,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:25:18,418 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10:25:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:18,451 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-04 10:25:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:25:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10:25:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:18,452 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:25:18,452 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 10:25:18,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:25:18,452 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:18,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 34 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 10:25:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 10:25:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 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 10:25:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-04 10:25:18,457 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 8 [2025-03-04 10:25:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:18,457 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-04 10:25:18,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10:25:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-04 10:25:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:25:18,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:18,458 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:18,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:25:18,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:18,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:18,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1791973574, now seen corresponding path program 1 times [2025-03-04 10:25:18,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:18,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563677789] [2025-03-04 10:25:18,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:18,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:25:18,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:25:18,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:18,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:25:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:18,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563677789] [2025-03-04 10:25:18,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563677789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:18,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103061614] [2025-03-04 10:25:18,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:18,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:18,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:18,573 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 10:25:18,575 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 10:25:18,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:25:18,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:25:18,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:18,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:18,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:25:18,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:25:18,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:25:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103061614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:18,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:25:18,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2025-03-04 10:25:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827765929] [2025-03-04 10:25:18,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:18,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:25:18,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:18,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:25:18,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:25:18,727 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10:25:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:18,760 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2025-03-04 10:25:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:25:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-04 10:25:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:18,761 INFO L225 Difference]: With dead ends: 55 [2025-03-04 10:25:18,761 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:25:18,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:25:18,762 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:18,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:25:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-04 10:25:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 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 10:25:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-04 10:25:18,766 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 10 [2025-03-04 10:25:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:18,766 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-04 10:25:18,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10:25:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-04 10:25:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:25:18,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:18,767 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:18,774 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 10:25:18,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:18,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:18,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -49163239, now seen corresponding path program 1 times [2025-03-04 10:25:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117594004] [2025-03-04 10:25:18,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:18,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:25:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:25:18,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:18,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:25:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117594004] [2025-03-04 10:25:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117594004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494783835] [2025-03-04 10:25:19,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:19,061 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 10:25:19,062 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 10:25:19,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:25:19,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:25:19,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:19,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:19,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:25:19,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:25:19,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:25:19,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494783835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:19,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:25:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:25:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138223439] [2025-03-04 10:25:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:19,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:25:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:19,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:25:19,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:25:19,134 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10:25:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:19,168 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-03-04 10:25:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:25:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-04 10:25:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:19,169 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:25:19,170 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:25:19,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:25:19,171 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:19,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:25:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 10:25:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-04 10:25:19,177 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 10 [2025-03-04 10:25:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:19,177 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-04 10:25:19,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10:25:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-04 10:25:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:25:19,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:19,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:19,184 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 10:25:19,382 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,SelfDestructingSolverStorable3 [2025-03-04 10:25:19,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:19,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 283389125, now seen corresponding path program 1 times [2025-03-04 10:25:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151747232] [2025-03-04 10:25:19,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:19,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:25:19,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:25:19,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:19,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151747232] [2025-03-04 10:25:19,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151747232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:19,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:25:19,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:25:19,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787967115] [2025-03-04 10:25:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:19,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:25:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:19,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:25:19,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:25:19,426 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 10:25:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:19,443 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2025-03-04 10:25:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:25:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:25:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:19,444 INFO L225 Difference]: With dead ends: 43 [2025-03-04 10:25:19,444 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 10:25:19,446 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 10:25:19,447 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:19,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 10:25:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 10:25:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-04 10:25:19,452 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 11 [2025-03-04 10:25:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:19,453 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-04 10:25:19,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 10:25:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-04 10:25:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:25:19,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:19,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:19,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:25:19,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:19,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1524060405, now seen corresponding path program 1 times [2025-03-04 10:25:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564068466] [2025-03-04 10:25:19,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:19,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:25:19,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:25:19,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:19,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:25:19,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:19,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564068466] [2025-03-04 10:25:19,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564068466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:19,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048681798] [2025-03-04 10:25:19,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:19,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:19,498 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 10:25:19,498 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 10:25:19,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:25:19,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:25:19,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:19,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:19,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:25:19,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:25:19,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:25:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:25:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048681798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:25:19,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:25:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:25:19,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028104254] [2025-03-04 10:25:19,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:25:19,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:25:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:19,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:25:19,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:25:19,594 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:19,637 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2025-03-04 10:25:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:25:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:25:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:19,638 INFO L225 Difference]: With dead ends: 51 [2025-03-04 10:25:19,638 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 10:25:19,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:25:19,639 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:19,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 10:25:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 10:25:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-03-04 10:25:19,648 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 11 [2025-03-04 10:25:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:19,648 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-03-04 10:25:19,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2025-03-04 10:25:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:25:19,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:19,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:19,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:25:19,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:19,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:19,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1390189, now seen corresponding path program 1 times [2025-03-04 10:25:19,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:19,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343122848] [2025-03-04 10:25:19,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:19,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:25:19,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:25:19,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:19,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343122848] [2025-03-04 10:25:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343122848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:25:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:25:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070876925] [2025-03-04 10:25:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:19,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:25:19,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:19,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:25:19,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:25:19,906 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:19,928 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-03-04 10:25:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:25:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:25:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:19,929 INFO L225 Difference]: With dead ends: 58 [2025-03-04 10:25:19,929 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 10:25:19,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:25:19,930 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:19,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 10:25:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 10:25:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-03-04 10:25:19,938 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 12 [2025-03-04 10:25:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:19,939 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-03-04 10:25:19,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-03-04 10:25:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:25:19,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:19,939 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:19,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:25:19,940 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:19,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1460282921, now seen corresponding path program 1 times [2025-03-04 10:25:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117850531] [2025-03-04 10:25:19,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:19,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:25:19,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:25:19,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:19,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:20,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:20,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117850531] [2025-03-04 10:25:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117850531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:20,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837697970] [2025-03-04 10:25:20,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:20,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:20,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:20,006 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 10:25:20,008 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 10:25:20,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:25:20,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:25:20,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:20,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:20,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:25:20,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:20,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:25:20,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837697970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:20,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:25:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:25:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108221818] [2025-03-04 10:25:20,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:20,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:25:20,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:20,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:25:20,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:25:20,079 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:20,095 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-03-04 10:25:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:25:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 10:25:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:20,096 INFO L225 Difference]: With dead ends: 49 [2025-03-04 10:25:20,096 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 10:25:20,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:25:20,097 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:20,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 10:25:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 10:25:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-03-04 10:25:20,100 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 14 [2025-03-04 10:25:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:20,100 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-03-04 10:25:20,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-03-04 10:25:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:25:20,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:20,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:20,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:25:20,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:20,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:20,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1975869703, now seen corresponding path program 1 times [2025-03-04 10:25:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:20,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152793876] [2025-03-04 10:25:20,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:20,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:25:20,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:25:20,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:20,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152793876] [2025-03-04 10:25:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152793876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095662459] [2025-03-04 10:25:20,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:20,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:20,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:20,361 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 10:25:20,363 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 10:25:20,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:25:20,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:25:20,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:20,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:20,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:25:20,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:20,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:25:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095662459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:25:20,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:25:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-03-04 10:25:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097076231] [2025-03-04 10:25:20,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:25:20,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:25:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:20,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:25:20,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:25:20,477 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 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 10:25:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:20,531 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2025-03-04 10:25:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:25:20,531 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 10:25:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:20,532 INFO L225 Difference]: With dead ends: 118 [2025-03-04 10:25:20,532 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 10:25:20,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:25:20,532 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:20,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 10:25:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-04 10:25:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 87 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2025-03-04 10:25:20,539 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 15 [2025-03-04 10:25:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:20,539 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2025-03-04 10:25:20,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 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 10:25:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2025-03-04 10:25:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:25:20,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:20,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:20,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:25:20,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:20,743 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:20,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1682461731, now seen corresponding path program 1 times [2025-03-04 10:25:20,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:20,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93191133] [2025-03-04 10:25:20,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:20,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:25:20,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:25:20,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:20,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:25:20,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:20,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93191133] [2025-03-04 10:25:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93191133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:25:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:25:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118470602] [2025-03-04 10:25:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:20,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:25:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:20,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:25:20,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:25:20,769 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:20,780 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2025-03-04 10:25:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:25:20,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 10:25:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:20,781 INFO L225 Difference]: With dead ends: 88 [2025-03-04 10:25:20,781 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 10:25:20,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:25:20,781 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:20,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 10:25:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2025-03-04 10:25:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 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 10:25:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-03-04 10:25:20,791 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 15 [2025-03-04 10:25:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:20,791 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-03-04 10:25:20,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-03-04 10:25:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:25:20,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:20,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:20,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:25:20,792 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:20,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1071538579, now seen corresponding path program 1 times [2025-03-04 10:25:20,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:20,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82598262] [2025-03-04 10:25:20,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:20,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:25:20,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:25:20,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:20,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:25:20,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:20,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82598262] [2025-03-04 10:25:20,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82598262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:25:20,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:25:20,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:25:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427047324] [2025-03-04 10:25:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:25:20,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:25:20,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:20,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:25:20,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:25:20,829 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:20,837 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-03-04 10:25:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:25:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 10:25:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:20,838 INFO L225 Difference]: With dead ends: 64 [2025-03-04 10:25:20,838 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 10:25:20,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:25:20,838 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:20,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 10:25:20,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 10:25:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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 10:25:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-03-04 10:25:20,843 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 20 [2025-03-04 10:25:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:20,843 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-03-04 10:25:20,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-03-04 10:25:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:25:20,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:20,843 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:20,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:25:20,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:20,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1314177499, now seen corresponding path program 2 times [2025-03-04 10:25:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:20,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3016796] [2025-03-04 10:25:20,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:25:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:20,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:25:20,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-03-04 10:25:20,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:25:20,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:25:20,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3016796] [2025-03-04 10:25:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3016796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929742203] [2025-03-04 10:25:20,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:25:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:20,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:25:20,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:25:20,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:25:20,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-03-04 10:25:20,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:25:20,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:20,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:25:20,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:25:20,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:25:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:25:20,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929742203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:25:20,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:25:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 10:25:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350615582] [2025-03-04 10:25:20,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:25:20,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:25:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:20,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:25:20,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:25:20,976 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 10:25:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:20,991 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-03-04 10:25:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:25:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 20 [2025-03-04 10:25:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:20,992 INFO L225 Difference]: With dead ends: 59 [2025-03-04 10:25:20,992 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 10:25:20,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 1 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 10:25:20,992 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:20,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 10:25:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2025-03-04 10:25:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:25:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-03-04 10:25:20,995 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2025-03-04 10:25:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:20,995 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-03-04 10:25:20,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 10:25:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-03-04 10:25:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:25:20,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:20,999 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:21,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:25:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:21,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:21,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2005400614, now seen corresponding path program 1 times [2025-03-04 10:25:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:21,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034913119] [2025-03-04 10:25:21,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:21,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:25:21,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:25:21,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:21,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034913119] [2025-03-04 10:25:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034913119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706848729] [2025-03-04 10:25:21,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:25:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:21,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:25:21,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:25:21,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:25:21,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:25:21,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:25:21,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:21,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:25:21,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:21,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:25:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:25:21,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706848729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:25:21,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:25:21,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 10:25:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461993434] [2025-03-04 10:25:21,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:25:21,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:25:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:21,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:25:21,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:25:21,570 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:21,621 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-03-04 10:25:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:25:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 10:25:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:21,622 INFO L225 Difference]: With dead ends: 50 [2025-03-04 10:25:21,622 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 10:25:21,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:25:21,623 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:21,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 10:25:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 10:25:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-03-04 10:25:21,628 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 24 [2025-03-04 10:25:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:21,628 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-03-04 10:25:21,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-03-04 10:25:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:25:21,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:25:21,629 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:21,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:25:21,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:21,830 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:25:21,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 39514458, now seen corresponding path program 2 times [2025-03-04 10:25:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021806998] [2025-03-04 10:25:21,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:25:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:21,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 10:25:21,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 42 statements. [2025-03-04 10:25:21,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:25:21,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 10:25:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:21,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021806998] [2025-03-04 10:25:21,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021806998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:21,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782417253] [2025-03-04 10:25:21,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:25:21,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:21,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:21,872 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:25:21,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:25:21,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 10:25:21,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 42 statements. [2025-03-04 10:25:21,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:25:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:21,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:25:21,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 10:25:21,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:25:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 10:25:22,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782417253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:25:22,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:25:22,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 10:25:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999345214] [2025-03-04 10:25:22,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:25:22,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:25:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:22,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:25:22,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:25:22,016 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:22,029 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-03-04 10:25:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:25:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-04 10:25:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:22,029 INFO L225 Difference]: With dead ends: 49 [2025-03-04 10:25:22,029 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:25:22,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 1 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 10:25:22,030 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:22,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:25:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:25:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:25:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:25:22,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2025-03-04 10:25:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:22,031 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:25:22,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:25:22,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:25:22,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 10:25:22,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 10:25:22,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 10:25:22,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 10:25:22,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 10:25:22,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 10:25:22,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 10:25:22,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 10:25:22,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:25:22,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:25:22,236 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:22,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:25:22,444 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:25:22,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:25:22 BoogieIcfgContainer [2025-03-04 10:25:22,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:25:22,453 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:25:22,453 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:25:22,453 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:25:22,454 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:25:17" (3/4) ... [2025-03-04 10:25:22,455 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:25:22,461 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 10:25:22,461 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:25:22,461 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:25:22,461 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:25:22,513 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:25:22,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:25:22,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:25:22,514 INFO L158 Benchmark]: Toolchain (without parser) took 5214.69ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 97.1MB in the end (delta: 6.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2025-03-04 10:25:22,514 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:25:22,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.61ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 87.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:25:22,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.82ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:25:22,515 INFO L158 Benchmark]: Boogie Preprocessor took 34.82ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:25:22,515 INFO L158 Benchmark]: IcfgBuilder took 239.02ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 69.0MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:25:22,515 INFO L158 Benchmark]: TraceAbstraction took 4530.83ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 104.0MB in the end (delta: -35.1MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2025-03-04 10:25:22,515 INFO L158 Benchmark]: Witness Printer took 60.30ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 97.1MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:25:22,516 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.61ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 87.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.82ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.82ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 239.02ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 69.0MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4530.83ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 104.0MB in the end (delta: -35.1MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * Witness Printer took 60.30ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 97.1MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 546]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 546]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 541]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 541]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 537]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 537]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 801 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 564 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 237 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=9, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 365 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 1152 SizeOfPredicates, 4 NumberOfNonLiveVariables, 619 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 27 InterpolantComputations, 9 PerfectInterpolantSequences, 530/726 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 541]: Location Invariant Derived location invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647)) || (((((1 <= length1) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= i)) && (length2 <= 2147483647))) - InvariantResult [Line: 537]: Location Invariant Derived location invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647)) || (((((1 <= i) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:25:22,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE