./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-regression/stateful_check.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/stateful_check.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:36:47,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:36:47,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:36:47,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:36:47,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:36:47,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:36:47,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:36:47,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:36:47,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:36:47,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:36:47,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:36:47,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:36:47,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:36:47,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:36:47,615 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:36:47,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:36:47,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:36:47,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:36:47,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:36:47,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:36:47,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:36:47,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:36:47,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:36:47,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:36:47,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:36:47,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:36:47,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:36:47,618 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-jdk21/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 -> 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e [2025-02-06 13:36:47,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:36:47,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:36:47,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:36:47,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:36:47,782 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:36:47,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/stateful_check.c [2025-02-06 13:36:48,861 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5c16dc8/14f751222a0b4b01b2c3c19a83415817/FLAG1c173fa51 [2025-02-06 13:36:49,082 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:36:49,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2025-02-06 13:36:49,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5c16dc8/14f751222a0b4b01b2c3c19a83415817/FLAG1c173fa51 [2025-02-06 13:36:49,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5c16dc8/14f751222a0b4b01b2c3c19a83415817 [2025-02-06 13:36:49,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:36:49,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:36:49,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:36:49,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:36:49,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:36:49,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418524ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49, skipping insertion in model container [2025-02-06 13:36:49,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:36:49,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:36:49,586 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:36:49,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:36:49,620 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:36:49,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49 WrapperNode [2025-02-06 13:36:49,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:36:49,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:36:49,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:36:49,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:36:49,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,647 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 113 [2025-02-06 13:36:49,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:36:49,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:36:49,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:36:49,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:36:49,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,670 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:36:49,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:36:49,684 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:36:49,684 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:36:49,684 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:36:49,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (1/1) ... [2025-02-06 13:36:49,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:36:49,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:36:49,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:36:49,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:36:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:36:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2025-02-06 13:36:49,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2025-02-06 13:36:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:36:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-02-06 13:36:49,735 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-02-06 13:36:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:36:49,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:36:49,772 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:36:49,773 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:36:49,887 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-06 13:36:49,887 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:36:49,894 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:36:49,894 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:36:49,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:36:49 BoogieIcfgContainer [2025-02-06 13:36:49,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:36:49,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:36:49,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:36:49,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:36:49,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:36:49" (1/3) ... [2025-02-06 13:36:49,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0443d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:36:49, skipping insertion in model container [2025-02-06 13:36:49,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:49" (2/3) ... [2025-02-06 13:36:49,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0443d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:36:49, skipping insertion in model container [2025-02-06 13:36:49,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:36:49" (3/3) ... [2025-02-06 13:36:49,902 INFO L128 eAbstractionObserver]: Analyzing ICFG stateful_check.c [2025-02-06 13:36:49,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:36:49,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stateful_check.c that has 3 procedures, 58 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-02-06 13:36:49,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:36:49,953 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;@79443b57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:36:49,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 13:36:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 53 states have internal predecessors, (65), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:36:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:36:49,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:36:49,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:36:49,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:36:49,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:36:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1687343113, now seen corresponding path program 1 times [2025-02-06 13:36:49,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:36:49,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726417516] [2025-02-06 13:36:49,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:36:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:36:50,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:36:50,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:36:50,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:36:50,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:36:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:36:50,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:36:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726417516] [2025-02-06 13:36:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726417516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:36:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:36:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:36:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579390963] [2025-02-06 13:36:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:36:50,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:36:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:36:50,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:36:50,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:36:50,112 INFO L87 Difference]: Start difference. First operand has 58 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 53 states have internal predecessors, (65), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-06 13:36:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:36:50,172 INFO L93 Difference]: Finished difference Result 127 states and 182 transitions. [2025-02-06 13:36:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:36:50,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-06 13:36:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:36:50,178 INFO L225 Difference]: With dead ends: 127 [2025-02-06 13:36:50,178 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 13:36:50,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:36:50,184 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:36:50,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 115 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:36:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 13:36:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 13:36:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 53 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:36:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2025-02-06 13:36:50,225 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 10 [2025-02-06 13:36:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:36:50,225 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2025-02-06 13:36:50,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-06 13:36:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2025-02-06 13:36:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:36:50,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:36:50,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:36:50,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:36:50,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:36:50,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:36:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1688760172, now seen corresponding path program 1 times [2025-02-06 13:36:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:36:50,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113797004] [2025-02-06 13:36:50,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:36:50,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:36:50,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:36:50,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:36:50,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:36:50,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:36:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:36:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:36:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113797004] [2025-02-06 13:36:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113797004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:36:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:36:50,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:36:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194287174] [2025-02-06 13:36:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:36:50,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:36:50,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:36:50,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:36:50,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:36:50,370 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-02-06 13:36:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:36:50,431 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-02-06 13:36:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:36:50,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-02-06 13:36:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:36:50,433 INFO L225 Difference]: With dead ends: 57 [2025-02-06 13:36:50,433 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 13:36:50,434 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-02-06 13:36:50,434 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:36:50,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 133 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:36:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 13:36:50,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 13:36:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.425531914893617) internal successors, (67), 51 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:36:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-02-06 13:36:50,442 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 10 [2025-02-06 13:36:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:36:50,442 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-02-06 13:36:50,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-02-06 13:36:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-02-06 13:36:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 13:36:50,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:36:50,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:36:50,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:36:50,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:36:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:36:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1616095663, now seen corresponding path program 1 times [2025-02-06 13:36:50,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:36:50,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35452263] [2025-02-06 13:36:50,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:36:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:36:50,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:36:50,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:36:50,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:36:50,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:36:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:36:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:36:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35452263] [2025-02-06 13:36:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35452263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:36:50,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:36:50,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:36:50,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329916414] [2025-02-06 13:36:50,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:36:50,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:36:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:36:50,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:36:50,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:36:50,526 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-06 13:36:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:36:50,583 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2025-02-06 13:36:50,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:36:50,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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 19 [2025-02-06 13:36:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:36:50,584 INFO L225 Difference]: With dead ends: 118 [2025-02-06 13:36:50,584 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 13:36:50,584 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-02-06 13:36:50,585 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:36:50,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 162 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:36:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 13:36:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-06 13:36:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 62 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:36:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-02-06 13:36:50,591 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 19 [2025-02-06 13:36:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:36:50,591 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-02-06 13:36:50,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-06 13:36:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2025-02-06 13:36:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 13:36:50,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:36:50,591 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:36:50,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:36:50,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:36:50,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:36:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1442150442, now seen corresponding path program 1 times [2025-02-06 13:36:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:36:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069900786] [2025-02-06 13:36:50,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:36:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:36:50,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:36:50,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:36:50,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:36:50,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:36:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:36:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:36:50,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069900786] [2025-02-06 13:36:50,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069900786] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:36:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188565798] [2025-02-06 13:36:50,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:36:50,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:36:50,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:36:50,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:36:50,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:36:50,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:36:50,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:36:50,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:36:50,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:36:50,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:36:50,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:36:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:36:50,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:36:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:36:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188565798] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:36:50,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:36:50,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 13:36:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027036674] [2025-02-06 13:36:50,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:36:50,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:36:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:36:50,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:36:50,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:36:50,799 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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-02-06 13:36:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:36:50,846 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2025-02-06 13:36:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:36:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 13:36:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:36:50,847 INFO L225 Difference]: With dead ends: 153 [2025-02-06 13:36:50,847 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 13:36:50,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:36:50,848 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:36:50,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 172 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:36:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 13:36:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-06 13:36:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 86 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:36:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-02-06 13:36:50,853 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 20 [2025-02-06 13:36:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:36:50,854 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-02-06 13:36:50,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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-02-06 13:36:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-02-06 13:36:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 13:36:50,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:36:50,854 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:36:50,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:36:51,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:36:51,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:36:51,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:36:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1440642024, now seen corresponding path program 1 times [2025-02-06 13:36:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:36:51,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135893371] [2025-02-06 13:36:51,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:36:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:36:51,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:36:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:36:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:36:51,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:36:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:36:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:36:51,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135893371] [2025-02-06 13:36:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135893371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:36:51,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:36:51,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:36:51,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311682704] [2025-02-06 13:36:51,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:36:51,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:36:51,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:36:51,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:36:51,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:36:51,091 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:36:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:36:51,116 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2025-02-06 13:36:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:36:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 13:36:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:36:51,117 INFO L225 Difference]: With dead ends: 90 [2025-02-06 13:36:51,117 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 13:36:51,117 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-02-06 13:36:51,118 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:36:51,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:36:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 13:36:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 13:36:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:36:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2025-02-06 13:36:51,123 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 20 [2025-02-06 13:36:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:36:51,123 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2025-02-06 13:36:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:36:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2025-02-06 13:36:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 13:36:51,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:36:51,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:36:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:36:51,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:36:51,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:36:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2081081580, now seen corresponding path program 1 times [2025-02-06 13:36:51,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:36:51,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421902926] [2025-02-06 13:36:51,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:36:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:36:51,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:36:51,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:36:51,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:36:51,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:36:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:36:51,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:36:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421902926] [2025-02-06 13:36:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421902926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:36:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:36:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:36:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362536750] [2025-02-06 13:36:51,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:36:51,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:36:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:36:51,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:36:51,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:36:51,166 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-02-06 13:36:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:36:51,196 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2025-02-06 13:36:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:36:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 29 [2025-02-06 13:36:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:36:51,197 INFO L225 Difference]: With dead ends: 174 [2025-02-06 13:36:51,197 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 13:36:51,198 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-02-06 13:36:51,198 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:36:51,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:36:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 13:36:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 13:36:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 84 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:36:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2025-02-06 13:36:51,203 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 29 [2025-02-06 13:36:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:36:51,203 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2025-02-06 13:36:51,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-02-06 13:36:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2025-02-06 13:36:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 13:36:51,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:36:51,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:36:51,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:36:51,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:36:51,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:36:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash -89019528, now seen corresponding path program 1 times [2025-02-06 13:36:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:36:51,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648385619] [2025-02-06 13:36:51,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:36:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:36:51,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:36:51,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:36:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:36:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:36:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:36:51,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:36:51,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648385619] [2025-02-06 13:36:51,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648385619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:36:51,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:36:51,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:36:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006482740] [2025-02-06 13:36:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:36:51,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:36:51,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:36:51,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:36:51,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:36:51,237 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:36:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:36:51,263 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2025-02-06 13:36:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:36:51,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 13:36:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:36:51,263 INFO L225 Difference]: With dead ends: 88 [2025-02-06 13:36:51,263 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:36:51,264 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-02-06 13:36:51,264 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:36:51,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 117 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:36:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:36:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:36:51,265 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-02-06 13:36:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:36:51,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2025-02-06 13:36:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:36:51,265 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:36:51,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:36:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:36:51,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:36:51,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-06 13:36:51,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 13:36:51,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 13:36:51,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 13:36:51,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 13:36:51,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-06 13:36:51,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:36:51,271 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:36:51,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:36:51,286 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:36:51,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:36:51 BoogieIcfgContainer [2025-02-06 13:36:51,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:36:51,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:36:51,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:36:51,293 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:36:51,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:36:49" (3/4) ... [2025-02-06 13:36:51,295 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:36:51,298 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2025-02-06 13:36:51,298 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2025-02-06 13:36:51,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 13:36:51,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:36:51,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 13:36:51,302 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:36:51,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:36:51,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:36:51,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:36:51,354 INFO L158 Benchmark]: Toolchain (without parser) took 1915.83ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 50.2MB in the end (delta: 55.9MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2025-02-06 13:36:51,355 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:36:51,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.14ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:36:51,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.31ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:36:51,355 INFO L158 Benchmark]: Boogie Preprocessor took 32.21ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:36:51,355 INFO L158 Benchmark]: IcfgBuilder took 210.89ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 78.4MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:36:51,356 INFO L158 Benchmark]: TraceAbstraction took 1396.25ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 56.2MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-02-06 13:36:51,356 INFO L158 Benchmark]: Witness Printer took 60.81ms. Allocated memory is still 142.6MB. Free memory was 56.2MB in the beginning and 50.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:36:51,357 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.14ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.31ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.21ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 210.89ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 78.4MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1396.25ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 56.2MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 60.81ms. Allocated memory is still 142.6MB. Free memory was 56.2MB in the beginning and 50.2MB in the end (delta: 6.0MB). 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: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: 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 3 procedures, 58 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 982 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 609 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 373 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 28/37 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 13:36:51,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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