./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound50.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/nla-digbench-scaling/hard-u_unwindbound50.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 9692f5b55a240b01d2d0c222255869fb052ffe02a605ab1c8e72ef46a070f8cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:13:05,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:13:05,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:13:05,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:13:05,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:13:05,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:13:05,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:13:05,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:13:05,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:13:05,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:13:05,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:13:05,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:13:05,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:13:05,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:13:05,724 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:13:05,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:13:05,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:13:05,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:13:05,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:13:05,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:13:05,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:13:05,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:13:05,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:13:05,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:13:05,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:13:05,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:13:05,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:13:05,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:13:05,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:13:05,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:13:05,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:13:05,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:13:05,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:13:05,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:13:05,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:13:05,727 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 -> 9692f5b55a240b01d2d0c222255869fb052ffe02a605ab1c8e72ef46a070f8cd [2025-02-06 14:13:05,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:13:05,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:13:05,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:13:05,937 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:13:05,938 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:13:05,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound50.c [2025-02-06 14:13:07,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65330233d/9e3f0db198d54ef78904ad331629cf15/FLAG890465477 [2025-02-06 14:13:07,365 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:13:07,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound50.c [2025-02-06 14:13:07,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65330233d/9e3f0db198d54ef78904ad331629cf15/FLAG890465477 [2025-02-06 14:13:07,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65330233d/9e3f0db198d54ef78904ad331629cf15 [2025-02-06 14:13:07,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:13:07,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:13:07,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:13:07,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:13:07,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:13:07,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e10fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07, skipping insertion in model container [2025-02-06 14:13:07,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:13:07,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:13:07,789 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:13:07,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:13:07,807 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:13:07,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07 WrapperNode [2025-02-06 14:13:07,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:13:07,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:13:07,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:13:07,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:13:07,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,828 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-02-06 14:13:07,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:13:07,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:13:07,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:13:07,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:13:07,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,851 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 14:13:07,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:13:07,867 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:13:07,867 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:13:07,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:13:07,868 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (1/1) ... [2025-02-06 14:13:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:13:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:07,901 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 14:13:07,904 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 14:13:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:13:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:13:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:13:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:13:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:13:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:13:07,955 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:13:07,956 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:13:08,058 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 14:13:08,058 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:13:08,064 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:13:08,064 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:13:08,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:13:08 BoogieIcfgContainer [2025-02-06 14:13:08,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:13:08,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:13:08,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:13:08,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:13:08,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:13:07" (1/3) ... [2025-02-06 14:13:08,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657e4563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:13:08, skipping insertion in model container [2025-02-06 14:13:08,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:07" (2/3) ... [2025-02-06 14:13:08,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657e4563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:13:08, skipping insertion in model container [2025-02-06 14:13:08,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:13:08" (3/3) ... [2025-02-06 14:13:08,071 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound50.c [2025-02-06 14:13:08,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:13:08,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-u_unwindbound50.c that has 2 procedures, 36 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 14:13:08,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:13:08,118 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;@5bee7ba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:13:08,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 14:13:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:13:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:13:08,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:08,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:13:08,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:08,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2069824990, now seen corresponding path program 1 times [2025-02-06 14:13:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:08,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401392244] [2025-02-06 14:13:08,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:08,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:13:08,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:13:08,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:08,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:08,202 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 14:13:08,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:08,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401392244] [2025-02-06 14:13:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401392244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:08,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:08,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:13:08,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299654615] [2025-02-06 14:13:08,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:08,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 14:13:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:08,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 14:13:08,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:13:08,219 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 14:13:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:08,230 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2025-02-06 14:13:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 14:13:08,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-06 14:13:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:08,235 INFO L225 Difference]: With dead ends: 68 [2025-02-06 14:13:08,235 INFO L226 Difference]: Without dead ends: 28 [2025-02-06 14:13:08,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:13:08,238 INFO L435 NwaCegarLoop]: 45 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, 45 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-02-06 14:13:08,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:13:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-06 14:13:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-06 14:13:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:13:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-02-06 14:13:08,261 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2025-02-06 14:13:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:08,261 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-02-06 14:13:08,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 14:13:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-02-06 14:13:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:13:08,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:08,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:13:08,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:13:08,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:08,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2069854781, now seen corresponding path program 1 times [2025-02-06 14:13:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:08,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828702928] [2025-02-06 14:13:08,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:08,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:13:08,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:13:08,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:08,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:13:08,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:08,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828702928] [2025-02-06 14:13:08,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828702928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:08,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:08,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:13:08,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302764572] [2025-02-06 14:13:08,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:08,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:13:08,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:08,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:13:08,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:13:08,331 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 14:13:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:08,364 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-02-06 14:13:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:13:08,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-06 14:13:08,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:08,365 INFO L225 Difference]: With dead ends: 37 [2025-02-06 14:13:08,365 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 14:13:08,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-06 14:13:08,365 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 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-02-06 14:13:08,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:13:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 14:13:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-02-06 14:13:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:13:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-06 14:13:08,370 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2025-02-06 14:13:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:08,370 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-06 14:13:08,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 14:13:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-02-06 14:13:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:13:08,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:08,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:08,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:13:08,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash -259011229, now seen corresponding path program 1 times [2025-02-06 14:13:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:08,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549352143] [2025-02-06 14:13:08,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:08,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:13:08,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:13:08,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:08,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:08,424 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 14:13:08,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:08,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549352143] [2025-02-06 14:13:08,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549352143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:08,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:08,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:13:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132221986] [2025-02-06 14:13:08,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:08,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:13:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:08,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:13:08,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:13:08,426 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:13:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:08,452 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-02-06 14:13:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:13:08,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 14:13:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:08,453 INFO L225 Difference]: With dead ends: 50 [2025-02-06 14:13:08,453 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 14:13:08,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-06 14:13:08,454 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:08,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:13:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 14:13:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 14:13:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:13:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-06 14:13:08,458 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2025-02-06 14:13:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:08,458 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-06 14:13:08,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:13:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-02-06 14:13:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 14:13:08,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:08,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:08,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:13:08,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:08,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1106859082, now seen corresponding path program 1 times [2025-02-06 14:13:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330023320] [2025-02-06 14:13:08,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:08,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:13:08,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:13:08,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:08,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:13:08,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:08,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330023320] [2025-02-06 14:13:08,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330023320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:08,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:13:08,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809656915] [2025-02-06 14:13:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:08,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:13:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:08,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:13:08,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:13:08,614 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-02-06 14:13:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:08,697 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-02-06 14:13:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:13:08,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 26 [2025-02-06 14:13:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:08,699 INFO L225 Difference]: With dead ends: 35 [2025-02-06 14:13:08,699 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 14:13:08,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:13:08,700 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:08,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:13:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 14:13:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 14:13:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:13:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-02-06 14:13:08,709 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2025-02-06 14:13:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:08,709 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-02-06 14:13:08,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-02-06 14:13:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-02-06 14:13:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:13:08,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:08,710 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:08,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:13:08,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:08,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash -47106841, now seen corresponding path program 1 times [2025-02-06 14:13:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695158313] [2025-02-06 14:13:08,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:08,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:13:08,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:13:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:13:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:08,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695158313] [2025-02-06 14:13:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695158313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:08,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:08,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:13:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075891342] [2025-02-06 14:13:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:13:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:08,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:13:08,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:13:08,815 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-02-06 14:13:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:08,890 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-02-06 14:13:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:13:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 27 [2025-02-06 14:13:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:08,891 INFO L225 Difference]: With dead ends: 51 [2025-02-06 14:13:08,891 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 14:13:08,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:13:08,892 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:08,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:13:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 14:13:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-02-06 14:13:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 14:13:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-02-06 14:13:08,898 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2025-02-06 14:13:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:08,898 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-02-06 14:13:08,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-02-06 14:13:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-02-06 14:13:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:13:08,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:08,903 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:08,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:13:08,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:08,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash -47032364, now seen corresponding path program 1 times [2025-02-06 14:13:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959391704] [2025-02-06 14:13:08,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:08,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:13:08,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:13:08,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:08,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:13:08,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:08,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959391704] [2025-02-06 14:13:08,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959391704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:08,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360123785] [2025-02-06 14:13:08,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:08,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:08,978 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 14:13:08,979 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 14:13:09,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:13:09,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:13:09,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:09,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:09,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:13:09,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:13:09,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:13:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360123785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:09,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:13:09,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-06 14:13:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617533069] [2025-02-06 14:13:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:09,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:13:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:09,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:13:09,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:13:09,098 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-02-06 14:13:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:09,155 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-02-06 14:13:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:13:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 27 [2025-02-06 14:13:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:09,157 INFO L225 Difference]: With dead ends: 49 [2025-02-06 14:13:09,157 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 14:13:09,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:13:09,158 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:09,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:13:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 14:13:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-02-06 14:13:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 14:13:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-02-06 14:13:09,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 27 [2025-02-06 14:13:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:09,171 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-02-06 14:13:09,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-02-06 14:13:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-02-06 14:13:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:13:09,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:09,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:09,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:13:09,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:09,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:09,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:09,378 INFO L85 PathProgramCache]: Analyzing trace with hash -371609976, now seen corresponding path program 1 times [2025-02-06 14:13:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:09,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431248925] [2025-02-06 14:13:09,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:09,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:09,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:13:09,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:13:09,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:09,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:13:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:09,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431248925] [2025-02-06 14:13:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431248925] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957358833] [2025-02-06 14:13:09,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:09,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:09,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:09,455 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-02-06 14:13:09,456 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-02-06 14:13:09,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:13:09,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:13:09,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:09,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:09,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 14:13:09,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:13:09,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:13:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:13:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957358833] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:13:09,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:13:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-02-06 14:13:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526580809] [2025-02-06 14:13:09,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:13:09,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 14:13:09,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:09,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 14:13:09,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:13:09,645 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 14:13:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:09,765 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2025-02-06 14:13:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 14:13:09,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 31 [2025-02-06 14:13:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:09,766 INFO L225 Difference]: With dead ends: 93 [2025-02-06 14:13:09,766 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 14:13:09,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-02-06 14:13:09,767 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:09,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 177 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:13:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 14:13:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2025-02-06 14:13:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 14:13:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2025-02-06 14:13:09,778 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 31 [2025-02-06 14:13:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:09,779 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2025-02-06 14:13:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 14:13:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2025-02-06 14:13:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 14:13:09,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:09,779 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:09,787 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-02-06 14:13:09,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:09,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:09,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1581940212, now seen corresponding path program 1 times [2025-02-06 14:13:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242541331] [2025-02-06 14:13:09,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:09,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:13:09,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:13:09,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:09,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:13:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242541331] [2025-02-06 14:13:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242541331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056962333] [2025-02-06 14:13:10,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:10,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:10,090 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-02-06 14:13:10,095 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-02-06 14:13:10,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:13:10,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:13:10,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:10,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:10,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:13:10,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 14:13:10,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:13:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:13:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056962333] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:13:10,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:13:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-02-06 14:13:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012865331] [2025-02-06 14:13:10,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:13:10,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 14:13:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:10,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 14:13:10,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-02-06 14:13:10,312 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-02-06 14:13:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:10,619 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2025-02-06 14:13:10,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 14:13:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 43 [2025-02-06 14:13:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:10,621 INFO L225 Difference]: With dead ends: 133 [2025-02-06 14:13:10,621 INFO L226 Difference]: Without dead ends: 132 [2025-02-06 14:13:10,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 14:13:10,622 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 134 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:10,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 171 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:13:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-06 14:13:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-06 14:13:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 14:13:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2025-02-06 14:13:10,632 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 43 [2025-02-06 14:13:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:10,633 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2025-02-06 14:13:10,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-02-06 14:13:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2025-02-06 14:13:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 14:13:10,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:10,635 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:10,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 14:13:10,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:10,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:10,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1550312101, now seen corresponding path program 2 times [2025-02-06 14:13:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:10,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749746579] [2025-02-06 14:13:10,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:13:10,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:10,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-02-06 14:13:10,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 14:13:10,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:13:10,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 14:13:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749746579] [2025-02-06 14:13:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749746579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679212664] [2025-02-06 14:13:11,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:13:11,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:11,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:11,160 INFO L229 MonitoredProcess]: Starting monitored process 5 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 14:13:11,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:13:11,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-02-06 14:13:11,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 14:13:11,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:13:11,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:11,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 14:13:11,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 268 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 14:13:11,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:13:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 14:13:11,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679212664] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:13:11,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:13:11,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2025-02-06 14:13:11,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149192174] [2025-02-06 14:13:11,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:13:11,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 14:13:11,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:11,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 14:13:11,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1023, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 14:13:11,702 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 37 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-02-06 14:13:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:12,118 INFO L93 Difference]: Finished difference Result 234 states and 278 transitions. [2025-02-06 14:13:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 14:13:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 91 [2025-02-06 14:13:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:12,120 INFO L225 Difference]: With dead ends: 234 [2025-02-06 14:13:12,120 INFO L226 Difference]: Without dead ends: 221 [2025-02-06 14:13:12,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=906, Invalid=2516, Unknown=0, NotChecked=0, Total=3422 [2025-02-06 14:13:12,122 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 218 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:12,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 242 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:13:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-06 14:13:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2025-02-06 14:13:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 105 states have internal predecessors, (118), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 14:13:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2025-02-06 14:13:12,140 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 91 [2025-02-06 14:13:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:12,140 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2025-02-06 14:13:12,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-02-06 14:13:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2025-02-06 14:13:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 14:13:12,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:12,141 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:12,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:13:12,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 14:13:12,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:12,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 939646220, now seen corresponding path program 1 times [2025-02-06 14:13:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:12,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645688026] [2025-02-06 14:13:12,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:12,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 14:13:12,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 14:13:12,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:12,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 14:13:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645688026] [2025-02-06 14:13:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645688026] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830087173] [2025-02-06 14:13:12,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:12,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:12,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:12,612 INFO L229 MonitoredProcess]: Starting monitored process 6 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 14:13:12,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:13:12,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 14:13:12,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 14:13:12,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:12,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:12,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 14:13:12,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 389 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:13:12,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:13:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 14:13:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830087173] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:13:13,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:13:13,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-02-06 14:13:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513873965] [2025-02-06 14:13:13,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:13:13,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 14:13:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:13,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 14:13:13,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 14:13:13,348 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2025-02-06 14:13:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:14,291 INFO L93 Difference]: Finished difference Result 370 states and 444 transitions. [2025-02-06 14:13:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-06 14:13:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) Word has length 111 [2025-02-06 14:13:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:14,293 INFO L225 Difference]: With dead ends: 370 [2025-02-06 14:13:14,293 INFO L226 Difference]: Without dead ends: 369 [2025-02-06 14:13:14,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1659, Invalid=4661, Unknown=0, NotChecked=0, Total=6320 [2025-02-06 14:13:14,296 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 293 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:14,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 246 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:13:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-06 14:13:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 252. [2025-02-06 14:13:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 186 states have (on average 1.118279569892473) internal successors, (208), 186 states have internal predecessors, (208), 45 states have call successors, (45), 20 states have call predecessors, (45), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 14:13:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 298 transitions. [2025-02-06 14:13:14,323 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 298 transitions. Word has length 111 [2025-02-06 14:13:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:14,326 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 298 transitions. [2025-02-06 14:13:14,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2025-02-06 14:13:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 298 transitions. [2025-02-06 14:13:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-06 14:13:14,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:14,329 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:14,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 14:13:14,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 14:13:14,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:13:14,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash -203709749, now seen corresponding path program 2 times [2025-02-06 14:13:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:14,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292602142] [2025-02-06 14:13:14,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:13:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:14,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 227 statements into 2 equivalence classes. [2025-02-06 14:13:14,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 227 of 227 statements. [2025-02-06 14:13:14,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:13:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 1963 trivial. 0 not checked. [2025-02-06 14:13:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292602142] [2025-02-06 14:13:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292602142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:13:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281388809] [2025-02-06 14:13:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:13:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:14,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:13:14,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:13:14,847 INFO L87 Difference]: Start difference. First operand 252 states and 298 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:13:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:14,883 INFO L93 Difference]: Finished difference Result 256 states and 302 transitions. [2025-02-06 14:13:14,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:13:14,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 227 [2025-02-06 14:13:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:14,884 INFO L225 Difference]: With dead ends: 256 [2025-02-06 14:13:14,884 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:13:14,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:13:14,886 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:14,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 97 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:13:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:13:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:13:14,886 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 14:13:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:13:14,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2025-02-06 14:13:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:14,887 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:13:14,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:13:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:13:14,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:13:14,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 14:13:14,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 14:13:14,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 14:13:14,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 14:13:14,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:13:14,892 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:14,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:13:15,277 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:13:15,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:13:15 BoogieIcfgContainer [2025-02-06 14:13:15,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:13:15,287 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:13:15,287 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:13:15,287 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:13:15,288 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:13:08" (3/4) ... [2025-02-06 14:13:15,289 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:13:15,293 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 14:13:15,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-06 14:13:15,296 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:13:15,296 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:13:15,296 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:13:15,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:13:15,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:13:15,351 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:13:15,351 INFO L158 Benchmark]: Toolchain (without parser) took 7663.50ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 123.8MB in the beginning and 155.4MB in the end (delta: -31.6MB). Peak memory consumption was 154.1MB. Max. memory is 16.1GB. [2025-02-06 14:13:15,352 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:13:15,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 119.64ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:13:15,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.49ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:13:15,352 INFO L158 Benchmark]: Boogie Preprocessor took 37.08ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:13:15,352 INFO L158 Benchmark]: IcfgBuilder took 197.47ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 97.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:13:15,353 INFO L158 Benchmark]: TraceAbstraction took 7220.42ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 96.8MB in the beginning and 161.8MB in the end (delta: -65.0MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2025-02-06 14:13:15,353 INFO L158 Benchmark]: Witness Printer took 63.82ms. Allocated memory is still 352.3MB. Free memory was 160.1MB in the beginning and 155.4MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:13:15,354 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 119.64ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.49ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.08ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 197.47ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 97.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7220.42ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 96.8MB in the beginning and 161.8MB in the end (delta: -65.0MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. * Witness Printer took 63.82ms. Allocated memory is still 352.3MB. Free memory was 160.1MB in the beginning and 155.4MB in the end (delta: 4.7MB). 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 11, TraceHistogramMax: 29, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 778 mSDsluCounter, 1388 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1083 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 882 IncrementalHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 305 mSDtfsCounter, 882 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=10, InterpolantAutomatonStates: 171, 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, 11 MinimizatonAttempts, 216 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 905 NumberOfCodeBlocks, 905 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1161 ConstructedInterpolants, 0 QuantifiedInterpolants, 2347 SizeOfPredicates, 27 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 3595/4549 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: 23]: Location Invariant Derived location invariant: ((counter <= 51) && (1 <= counter)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: (((counter <= 50) && (1 <= counter)) || (counter == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:13:15,378 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