./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/nla-digbench-scaling/geo1-ll_unwindbound2.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 e090762371efa1a10feb6b828109be17ddc5665dc90c03c64afd7f0f5af02942 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:07:58,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:07:58,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:07:58,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:07:58,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:07:58,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:07:58,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:07:58,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:07:58,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:07:58,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:07:58,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:07:58,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:07:58,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:07:58,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:07:58,730 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:07:58,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:07:58,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:07:58,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:07:58,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:07:58,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:07:58,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:07:58,732 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 -> e090762371efa1a10feb6b828109be17ddc5665dc90c03c64afd7f0f5af02942 [2025-01-10 02:07:58,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:07:58,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:07:58,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:07:58,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:07:58,973 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:07:58,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2025-01-10 02:08:00,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/668a968c1/3034a0da0b8745178d26cc0eb6eb3109/FLAG830d20522 [2025-01-10 02:08:00,346 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:08:00,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2025-01-10 02:08:00,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/668a968c1/3034a0da0b8745178d26cc0eb6eb3109/FLAG830d20522 [2025-01-10 02:08:00,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/668a968c1/3034a0da0b8745178d26cc0eb6eb3109 [2025-01-10 02:08:00,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:08:00,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:08:00,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:08:00,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:08:00,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:08:00,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fa93dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00, skipping insertion in model container [2025-01-10 02:08:00,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:08:00,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:08:00,814 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:08:00,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:08:00,836 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:08:00,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00 WrapperNode [2025-01-10 02:08:00,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:08:00,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:08:00,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:08:00,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:08:00,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,860 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-01-10 02:08:00,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:08:00,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:08:00,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:08:00,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:08:00,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,876 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-01-10 02:08:00,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:08:00,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:08:00,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:08:00,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:08:00,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (1/1) ... [2025-01-10 02:08:00,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:08:00,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:08:00,921 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-01-10 02:08:00,925 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-01-10 02:08:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:08:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:08:00,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:08:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:08:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:08:00,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:08:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:08:00,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:08:00,986 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:08:00,988 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:08:01,077 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-10 02:08:01,077 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:08:01,085 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:08:01,086 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:08:01,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:08:01 BoogieIcfgContainer [2025-01-10 02:08:01,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:08:01,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:08:01,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:08:01,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:08:01,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:08:00" (1/3) ... [2025-01-10 02:08:01,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539d7d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:08:01, skipping insertion in model container [2025-01-10 02:08:01,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:08:00" (2/3) ... [2025-01-10 02:08:01,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539d7d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:08:01, skipping insertion in model container [2025-01-10 02:08:01,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:08:01" (3/3) ... [2025-01-10 02:08:01,093 INFO L128 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound2.c [2025-01-10 02:08:01,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:08:01,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG geo1-ll_unwindbound2.c that has 3 procedures, 32 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-01-10 02:08:01,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:08:01,142 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;@42c331fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:08:01,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 02:08:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:08:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:08:01,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:08:01,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:08:01,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:08:01,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:08:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1143636127, now seen corresponding path program 1 times [2025-01-10 02:08:01,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:08:01,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687850981] [2025-01-10 02:08:01,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:01,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:08:01,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:08:01,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:08:01,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:01,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:08:01,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:08:01,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687850981] [2025-01-10 02:08:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687850981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:08:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884118779] [2025-01-10 02:08:01,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:01,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:08:01,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:08:01,253 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-01-10 02:08:01,255 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-01-10 02:08:01,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:08:01,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:08:01,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:01,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:01,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 02:08:01,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:08:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:08:01,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:08:01,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884118779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:08:01,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:08:01,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-10 02:08:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138599483] [2025-01-10 02:08:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:08:01,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:08:01,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:08:01,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:08:01,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:08:01,350 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:08:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:08:01,362 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2025-01-10 02:08:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:08:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-01-10 02:08:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:08:01,368 INFO L225 Difference]: With dead ends: 60 [2025-01-10 02:08:01,368 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 02:08:01,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:08:01,375 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:08:01,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:08:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 02:08:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-10 02:08:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:08:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-01-10 02:08:01,407 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2025-01-10 02:08:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:08:01,407 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-01-10 02:08:01,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:08:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-01-10 02:08:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:08:01,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:08:01,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:08:01,415 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-01-10 02:08:01,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 02:08:01,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:08:01,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:08:01,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1901959007, now seen corresponding path program 1 times [2025-01-10 02:08:01,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:08:01,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182771162] [2025-01-10 02:08:01,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:08:01,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:08:01,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:08:01,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:01,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:08:01,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:08:01,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182771162] [2025-01-10 02:08:01,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182771162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:08:01,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:08:01,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:08:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392991387] [2025-01-10 02:08:01,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:08:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:08:01,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:08:01,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:08:01,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:08:01,697 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:08:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:08:01,736 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-01-10 02:08:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:08:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-01-10 02:08:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:08:01,737 INFO L225 Difference]: With dead ends: 25 [2025-01-10 02:08:01,737 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 02:08:01,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:08:01,738 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:08:01,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 39 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:08:01,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 02:08:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-10 02:08:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:08:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-01-10 02:08:01,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2025-01-10 02:08:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:08:01,744 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-01-10 02:08:01,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:08:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-01-10 02:08:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:08:01,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:08:01,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:08:01,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:08:01,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:08:01,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:08:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1168812884, now seen corresponding path program 1 times [2025-01-10 02:08:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:08:01,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054944647] [2025-01-10 02:08:01,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:08:01,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:08:01,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:08:01,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:01,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:08:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:08:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054944647] [2025-01-10 02:08:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054944647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:08:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:08:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:08:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953919794] [2025-01-10 02:08:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:08:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:08:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:08:01,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:08:01,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:08:01,831 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:08:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:08:01,856 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-01-10 02:08:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:08:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-01-10 02:08:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:08:01,857 INFO L225 Difference]: With dead ends: 33 [2025-01-10 02:08:01,857 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 02:08:01,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:08:01,858 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:08:01,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:08:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 02:08:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 02:08:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:08:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-01-10 02:08:01,862 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 16 [2025-01-10 02:08:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:08:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-01-10 02:08:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:08:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-01-10 02:08:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:08:01,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:08:01,863 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:08:01,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:08:01,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:08:01,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:08:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash -613002960, now seen corresponding path program 1 times [2025-01-10 02:08:01,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:08:01,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039497092] [2025-01-10 02:08:01,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:01,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:08:01,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:08:01,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:08:01,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:01,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:08:01,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:08:01,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039497092] [2025-01-10 02:08:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039497092] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:08:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812219433] [2025-01-10 02:08:01,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:01,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:08:01,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:08:01,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:08:01,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:08:02,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:08:02,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:08:02,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:02,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:02,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:08:02,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:08:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:08:02,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:08:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:08:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812219433] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:08:02,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:08:02,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-10 02:08:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604283117] [2025-01-10 02:08:02,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:08:02,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:08:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:08:02,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:08:02,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:08:02,158 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:08:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:08:02,197 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-01-10 02:08:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:08:02,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24 [2025-01-10 02:08:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:08:02,198 INFO L225 Difference]: With dead ends: 28 [2025-01-10 02:08:02,198 INFO L226 Difference]: Without dead ends: 27 [2025-01-10 02:08:02,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:08:02,199 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:08:02,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:08:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-10 02:08:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-10 02:08:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:08:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-01-10 02:08:02,207 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2025-01-10 02:08:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:08:02,207 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-10 02:08:02,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:08:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-01-10 02:08:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:08:02,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:08:02,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:08:02,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:08:02,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:08:02,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:08:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:08:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1823222514, now seen corresponding path program 1 times [2025-01-10 02:08:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:08:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237407526] [2025-01-10 02:08:02,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:08:02,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:08:02,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:08:02,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:02,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:08:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:08:02,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237407526] [2025-01-10 02:08:02,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237407526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:08:02,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:08:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:08:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973155240] [2025-01-10 02:08:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:08:02,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:08:02,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:08:02,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:08:02,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:08:02,454 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:08:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:08:02,460 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-01-10 02:08:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:08:02,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-01-10 02:08:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:08:02,461 INFO L225 Difference]: With dead ends: 27 [2025-01-10 02:08:02,461 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 02:08:02,462 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-01-10 02:08:02,462 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:08:02,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:08:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 02:08:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-01-10 02:08:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:08:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-01-10 02:08:02,465 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2025-01-10 02:08:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:08:02,465 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-01-10 02:08:02,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:08:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-01-10 02:08:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:08:02,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:08:02,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:08:02,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:08:02,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:08:02,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:08:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash -685284293, now seen corresponding path program 1 times [2025-01-10 02:08:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:08:02,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163498675] [2025-01-10 02:08:02,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:02,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:08:02,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:08:02,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:08:02,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:02,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:08:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:08:02,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163498675] [2025-01-10 02:08:02,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163498675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:08:02,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896486814] [2025-01-10 02:08:02,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:08:02,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:08:02,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:08:02,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:08:02,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:08:02,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:08:02,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:08:02,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:08:02,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:08:02,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:08:02,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:08:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:08:02,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:08:02,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896486814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:08:02,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:08:02,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:08:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105660177] [2025-01-10 02:08:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:08:02,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:08:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:08:02,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:08:02,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:08:02,627 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:08:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:08:02,669 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-01-10 02:08:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:08:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-01-10 02:08:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:08:02,671 INFO L225 Difference]: With dead ends: 23 [2025-01-10 02:08:02,671 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:08:02,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:08:02,671 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 39 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-01-10 02:08:02,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 39 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:08:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:08:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:08:02,672 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-01-10 02:08:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:08:02,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-01-10 02:08:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:08:02,672 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:08:02,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:08:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:08:02,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:08:02,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 02:08:02,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 02:08:02,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 02:08:02,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 02:08:02,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:08:02,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:08:02,881 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 02:08:02,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:08:02,940 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:08:02,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:08:02 BoogieIcfgContainer [2025-01-10 02:08:02,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:08:02,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:08:02,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:08:02,949 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:08:02,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:08:01" (3/4) ... [2025-01-10 02:08:02,951 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:08:02,954 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-10 02:08:02,955 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 02:08:02,956 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 02:08:02,957 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:08:02,957 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:08:02,957 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:08:03,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:08:03,009 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:08:03,009 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:08:03,010 INFO L158 Benchmark]: Toolchain (without parser) took 2327.34ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 60.7MB in the end (delta: 51.6MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2025-01-10 02:08:03,010 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:08:03,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.98ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 101.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:08:03,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.16ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:08:03,011 INFO L158 Benchmark]: Boogie Preprocessor took 27.99ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.0MB in the end (delta: 891.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:08:03,011 INFO L158 Benchmark]: RCFGBuilder took 196.98ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 87.5MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:08:03,011 INFO L158 Benchmark]: TraceAbstraction took 1860.14ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 66.7MB in the end (delta: 20.3MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2025-01-10 02:08:03,012 INFO L158 Benchmark]: Witness Printer took 59.58ms. Allocated memory is still 142.6MB. Free memory was 66.7MB in the beginning and 60.7MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:08:03,013 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.22ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.98ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 101.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.16ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.99ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.0MB in the end (delta: 891.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 196.98ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 87.5MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1860.14ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 66.7MB in the end (delta: 20.3MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Witness Printer took 59.58ms. Allocated memory is still 142.6MB. Free memory was 66.7MB in the beginning and 60.7MB in the end (delta: 6.1MB). 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: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: 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, 32 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 131 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 1 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 32/46 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 4 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((z <= 2147483647) && (0 <= counter)) && (1 <= z)) && (counter <= 2)) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:08:03,028 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