./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound5.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_unwindbound5.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 082e5acb2a505af9e43ec1a894890509a127a32d8ecd4c5193a456bddcb0f4a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:13:03,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:13:03,943 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:03,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:13:03,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:13:03,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:13:03,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:13:03,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:13:03,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:13:03,962 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:13:03,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:13:03,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:13:03,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:13:03,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:13:03,962 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:13:03,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:13:03,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:13:03,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:13:03,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:13:03,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:13:03,964 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 -> 082e5acb2a505af9e43ec1a894890509a127a32d8ecd4c5193a456bddcb0f4a3 [2025-02-06 14:13:04,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:13:04,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:13:04,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:13:04,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:13:04,204 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:13:04,206 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_unwindbound5.c [2025-02-06 14:13:05,332 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c37f757f9/007b5fb4259d4e5391e01611c106b77e/FLAGbdde488a0 [2025-02-06 14:13:05,526 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:13:05,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound5.c [2025-02-06 14:13:05,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c37f757f9/007b5fb4259d4e5391e01611c106b77e/FLAGbdde488a0 [2025-02-06 14:13:05,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c37f757f9/007b5fb4259d4e5391e01611c106b77e [2025-02-06 14:13:05,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:13:05,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:13:05,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:13:05,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:13:05,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:13:05,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:13:05" (1/1) ... [2025-02-06 14:13:05,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274de6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:05, skipping insertion in model container [2025-02-06 14:13:05,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:13:05" (1/1) ... [2025-02-06 14:13:05,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:13:05,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:13:05,737 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:13:05,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:13:05,765 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:13:05,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:05 WrapperNode [2025-02-06 14:13:05,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:13:05,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:13:05,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:13:05,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:13:05,773 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:05" (1/1) ... [2025-02-06 14:13:05,778 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:05" (1/1) ... [2025-02-06 14:13:05,791 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-02-06 14:13:05,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:13:05,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:13:05,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:13:05,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:13:05,799 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:05" (1/1) ... [2025-02-06 14:13:05,800 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:05" (1/1) ... [2025-02-06 14:13:05,800 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:05" (1/1) ... [2025-02-06 14:13:05,811 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:05,811 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:05" (1/1) ... [2025-02-06 14:13:05,813 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:05" (1/1) ... [2025-02-06 14:13:05,815 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:05" (1/1) ... [2025-02-06 14:13:05,815 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:05" (1/1) ... [2025-02-06 14:13:05,817 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:05" (1/1) ... [2025-02-06 14:13:05,817 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:05" (1/1) ... [2025-02-06 14:13:05,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:13:05,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:13:05,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:13:05,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:13:05,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:05" (1/1) ... [2025-02-06 14:13:05,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:13:05,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:05,850 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:05,852 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:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:13:05,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:13:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:13:05,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:13:05,904 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:13:05,906 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:13:06,016 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 14:13:06,016 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:13:06,022 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:13:06,023 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:13:06,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:13:06 BoogieIcfgContainer [2025-02-06 14:13:06,023 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:13:06,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:13:06,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:13:06,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:13:06,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:13:05" (1/3) ... [2025-02-06 14:13:06,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783cdb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:13:06, skipping insertion in model container [2025-02-06 14:13:06,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:05" (2/3) ... [2025-02-06 14:13:06,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783cdb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:13:06, skipping insertion in model container [2025-02-06 14:13:06,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:13:06" (3/3) ... [2025-02-06 14:13:06,030 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound5.c [2025-02-06 14:13:06,039 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:13:06,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-u_unwindbound5.c that has 2 procedures, 36 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 14:13:06,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:13:06,092 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;@3a40caea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:13:06,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 14:13:06,096 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:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:13:06,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:06,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:13:06,099 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:06,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2069824990, now seen corresponding path program 1 times [2025-02-06 14:13:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:06,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757502949] [2025-02-06 14:13:06,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:06,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:13:06,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:06,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:06,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:06,216 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:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:06,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757502949] [2025-02-06 14:13:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757502949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:13:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704248167] [2025-02-06 14:13:06,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:06,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 14:13:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:06,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 14:13:06,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:13:06,238 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:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:06,256 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2025-02-06 14:13:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 14:13:06,257 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:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:06,261 INFO L225 Difference]: With dead ends: 68 [2025-02-06 14:13:06,261 INFO L226 Difference]: Without dead ends: 28 [2025-02-06 14:13:06,264 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:06,267 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:06,269 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:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-06 14:13:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-06 14:13:06,295 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:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-02-06 14:13:06,299 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2025-02-06 14:13:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:06,300 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-02-06 14:13:06,300 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:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-02-06 14:13:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:13:06,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:06,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:13:06,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:13:06,301 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:06,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2069854781, now seen corresponding path program 1 times [2025-02-06 14:13:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:06,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535775641] [2025-02-06 14:13:06,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:06,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:13:06,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:13:06,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:06,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:06,395 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:06,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:06,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535775641] [2025-02-06 14:13:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535775641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:06,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:06,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:13:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545525111] [2025-02-06 14:13:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:06,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:13:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:06,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:13:06,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:13:06,398 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:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:06,442 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-02-06 14:13:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:13:06,442 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:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:06,443 INFO L225 Difference]: With dead ends: 37 [2025-02-06 14:13:06,443 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 14:13:06,443 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:06,443 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:06,444 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:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 14:13:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-02-06 14:13:06,450 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:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-06 14:13:06,452 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2025-02-06 14:13:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:06,452 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-06 14:13:06,452 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:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-02-06 14:13:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:13:06,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:06,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:06,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:13:06,452 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:06,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash -259011229, now seen corresponding path program 1 times [2025-02-06 14:13:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:06,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127108653] [2025-02-06 14:13:06,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:06,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:13:06,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:13:06,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:06,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:06,510 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:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127108653] [2025-02-06 14:13:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127108653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:06,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:06,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:13:06,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876820642] [2025-02-06 14:13:06,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:06,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:13:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:06,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:13:06,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:13:06,512 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:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:06,544 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-02-06 14:13:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:13:06,545 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:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:06,546 INFO L225 Difference]: With dead ends: 50 [2025-02-06 14:13:06,547 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 14:13:06,547 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:06,548 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:06,549 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:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 14:13:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 14:13:06,552 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:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-06 14:13:06,553 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2025-02-06 14:13:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:06,553 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-06 14:13:06,553 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:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-02-06 14:13:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 14:13:06,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:06,553 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:06,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:13:06,554 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:06,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:06,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1106859082, now seen corresponding path program 1 times [2025-02-06 14:13:06,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:06,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275623009] [2025-02-06 14:13:06,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:06,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:06,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:13:06,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:13:06,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:06,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:06,667 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:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275623009] [2025-02-06 14:13:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275623009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:06,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:13:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553998284] [2025-02-06 14:13:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:06,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:13:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:06,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:13:06,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:13:06,670 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:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:06,727 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-02-06 14:13:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:13:06,728 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:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:06,728 INFO L225 Difference]: With dead ends: 35 [2025-02-06 14:13:06,728 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 14:13:06,728 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:06,729 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:06,729 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:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 14:13:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 14:13:06,733 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:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-02-06 14:13:06,733 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2025-02-06 14:13:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:06,734 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-02-06 14:13:06,734 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:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-02-06 14:13:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:13:06,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:06,734 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:06,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:13:06,735 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:06,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash -47106841, now seen corresponding path program 1 times [2025-02-06 14:13:06,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:06,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356010684] [2025-02-06 14:13:06,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:06,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:13:06,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:13:06,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:06,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:06,846 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:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356010684] [2025-02-06 14:13:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356010684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:06,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:06,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:13:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336134191] [2025-02-06 14:13:06,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:06,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:13:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:06,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:13:06,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:13:06,849 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:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:06,919 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-02-06 14:13:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:13:06,919 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:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:06,920 INFO L225 Difference]: With dead ends: 51 [2025-02-06 14:13:06,920 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 14:13:06,920 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:06,920 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:06,920 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:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 14:13:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-02-06 14:13:06,927 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:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-02-06 14:13:06,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2025-02-06 14:13:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:06,930 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-02-06 14:13:06,930 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:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-02-06 14:13:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:13:06,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:06,931 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:06,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:13:06,931 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:06,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash -47032364, now seen corresponding path program 1 times [2025-02-06 14:13:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:06,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537574477] [2025-02-06 14:13:06,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:06,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:06,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:13:06,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:13:06,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:06,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:07,010 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:07,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537574477] [2025-02-06 14:13:07,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537574477] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352845838] [2025-02-06 14:13:07,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:07,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:07,013 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:07,015 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:07,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:13:07,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:13:07,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:07,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:07,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:13:07,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:07,118 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:07,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:13:07,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352845838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:07,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:13:07,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-06 14:13:07,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129612855] [2025-02-06 14:13:07,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:07,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:13:07,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:07,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:13:07,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:13:07,119 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:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:07,171 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-02-06 14:13:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:13:07,172 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:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:07,172 INFO L225 Difference]: With dead ends: 49 [2025-02-06 14:13:07,172 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 14:13:07,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:13:07,173 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:07,173 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:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 14:13:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-02-06 14:13:07,179 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:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-02-06 14:13:07,182 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 27 [2025-02-06 14:13:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:07,182 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-02-06 14:13:07,182 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:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-02-06 14:13:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:13:07,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:07,183 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:07,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:13:07,388 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:07,388 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:07,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash -371609976, now seen corresponding path program 1 times [2025-02-06 14:13:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:07,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363354661] [2025-02-06 14:13:07,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:07,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:13:07,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:13:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:07,472 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:07,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:07,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363354661] [2025-02-06 14:13:07,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363354661] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855372214] [2025-02-06 14:13:07,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:07,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:07,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:07,475 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:07,477 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:07,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:13:07,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:13:07,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:07,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:07,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 14:13:07,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:07,553 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:07,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:13:07,638 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:07,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855372214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:13:07,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:13:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-02-06 14:13:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311609974] [2025-02-06 14:13:07,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:13:07,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 14:13:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:07,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 14:13:07,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:13:07,639 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:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:07,818 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2025-02-06 14:13:07,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 14:13:07,819 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:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:07,819 INFO L225 Difference]: With dead ends: 93 [2025-02-06 14:13:07,819 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 14:13:07,820 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:07,820 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:07,821 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:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 14:13:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2025-02-06 14:13:07,829 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:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2025-02-06 14:13:07,830 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 31 [2025-02-06 14:13:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:07,831 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2025-02-06 14:13:07,831 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:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2025-02-06 14:13:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 14:13:07,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:07,832 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:07,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:13:08,032 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:08,033 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:08,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1581940212, now seen corresponding path program 1 times [2025-02-06 14:13:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:08,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203676371] [2025-02-06 14:13:08,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:08,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:13:08,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:13:08,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:08,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:08,118 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:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203676371] [2025-02-06 14:13:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203676371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727167818] [2025-02-06 14:13:08,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:08,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:08,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:08,122 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:08,124 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:08,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:13:08,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:13:08,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:08,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:08,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:13:08,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:08,238 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:08,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:13:08,352 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:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727167818] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:13:08,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:13:08,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-02-06 14:13:08,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828801489] [2025-02-06 14:13:08,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:13:08,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 14:13:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:08,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 14:13:08,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-02-06 14:13:08,355 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:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:08,719 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2025-02-06 14:13:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 14:13:08,720 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:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:08,721 INFO L225 Difference]: With dead ends: 133 [2025-02-06 14:13:08,721 INFO L226 Difference]: Without dead ends: 132 [2025-02-06 14:13:08,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 14:13:08,722 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 134 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:08,722 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.2s Time] [2025-02-06 14:13:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-06 14:13:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-06 14:13:08,740 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:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2025-02-06 14:13:08,741 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 43 [2025-02-06 14:13:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:08,742 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2025-02-06 14:13:08,742 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:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2025-02-06 14:13:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 14:13:08,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:08,745 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:08,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 14:13:08,945 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:08,946 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:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1550312101, now seen corresponding path program 2 times [2025-02-06 14:13:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108134582] [2025-02-06 14:13:08,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:13:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:08,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-02-06 14:13:08,973 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:08,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:13:08,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:09,275 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:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108134582] [2025-02-06 14:13:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108134582] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660749516] [2025-02-06 14:13:09,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:13:09,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:09,277 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:09,279 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:09,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-02-06 14:13:09,341 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:09,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:13:09,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:09,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 14:13:09,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:09,560 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:09,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:13:09,821 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:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660749516] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:13:09,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:13:09,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2025-02-06 14:13:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056990018] [2025-02-06 14:13:09,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:13:09,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 14:13:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:09,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 14:13:09,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 14:13:09,824 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 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:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:10,249 INFO L93 Difference]: Finished difference Result 208 states and 247 transitions. [2025-02-06 14:13:10,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 14:13:10,249 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 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:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:10,252 INFO L225 Difference]: With dead ends: 208 [2025-02-06 14:13:10,252 INFO L226 Difference]: Without dead ends: 195 [2025-02-06 14:13:10,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=813, Invalid=2267, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 14:13:10,253 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 173 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:10,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 179 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:13:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-06 14:13:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 144. [2025-02-06 14:13:10,268 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:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2025-02-06 14:13:10,272 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 91 [2025-02-06 14:13:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:10,272 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2025-02-06 14:13:10,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 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:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2025-02-06 14:13:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 14:13:10,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:10,277 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:10,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 14:13:10,477 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:10,478 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:10,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash 939646220, now seen corresponding path program 1 times [2025-02-06 14:13:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222374818] [2025-02-06 14:13:10,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:10,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:10,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 14:13:10,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 14:13:10,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:10,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 14:13:10,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:10,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222374818] [2025-02-06 14:13:10,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222374818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:13:10,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409324735] [2025-02-06 14:13:10,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:13:10,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:13:10,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:13:10,712 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:10,722 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:10,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 14:13:10,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 14:13:10,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:13:10,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:10,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 14:13:10,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:13:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 389 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:13:10,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:13:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 14:13:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409324735] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:13:11,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:13:11,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 14 [2025-02-06 14:13:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203499794] [2025-02-06 14:13:11,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:13:11,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 14:13:11,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:11,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 14:13:11,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-06 14:13:11,021 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2025-02-06 14:13:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:11,239 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2025-02-06 14:13:11,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 14:13:11,239 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 111 [2025-02-06 14:13:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:11,240 INFO L225 Difference]: With dead ends: 238 [2025-02-06 14:13:11,240 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 14:13:11,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 211 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-02-06 14:13:11,241 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:13:11,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 324 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:13:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 14:13:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2025-02-06 14:13:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 135 states have (on average 1.0962962962962963) internal successors, (148), 135 states have internal predecessors, (148), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 14:13:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 214 transitions. [2025-02-06 14:13:11,255 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 214 transitions. Word has length 111 [2025-02-06 14:13:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:11,255 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 214 transitions. [2025-02-06 14:13:11,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2025-02-06 14:13:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 214 transitions. [2025-02-06 14:13:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 14:13:11,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:13:11,261 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:11,270 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:11,461 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:11,462 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:11,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:13:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1446050507, now seen corresponding path program 2 times [2025-02-06 14:13:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:13:11,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574091269] [2025-02-06 14:13:11,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:13:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:13:11,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-02-06 14:13:11,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 14:13:11,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:13:11,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:13:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-02-06 14:13:11,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:13:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574091269] [2025-02-06 14:13:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574091269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:13:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:13:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:13:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158497981] [2025-02-06 14:13:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:13:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:13:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:13:11,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:13:11,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:13:11,594 INFO L87 Difference]: Start difference. First operand 183 states and 214 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:13:11,637 INFO L93 Difference]: Finished difference Result 183 states and 214 transitions. [2025-02-06 14:13:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:13:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 123 [2025-02-06 14:13:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:13:11,638 INFO L225 Difference]: With dead ends: 183 [2025-02-06 14:13:11,638 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:13:11,638 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:11,639 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:11,639 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:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:13:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:13:11,639 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:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:13:11,639 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2025-02-06 14:13:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:13:11,639 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:13:11,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:13:11,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:13:11,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 14:13:11,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 14:13:11,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 14:13:11,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 14:13:11,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:13:11,645 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:13:11,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:13:11,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:13:11,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:13:11 BoogieIcfgContainer [2025-02-06 14:13:11,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:13:11,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:13:11,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:13:11,937 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:13:11,938 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:06" (3/4) ... [2025-02-06 14:13:11,939 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:13:11,943 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 14:13:11,947 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-06 14:13:11,947 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:13:11,948 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:13:11,948 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:13:12,014 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:13:12,014 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:13:12,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:13:12,015 INFO L158 Benchmark]: Toolchain (without parser) took 6445.05ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 65.0MB in the end (delta: 48.3MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-02-06 14:13:12,015 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:13:12,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.74ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 101.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:13:12,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.33ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.9MB in the end (delta: 957.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:13:12,016 INFO L158 Benchmark]: Boogie Preprocessor took 24.67ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:13:12,016 INFO L158 Benchmark]: IcfgBuilder took 204.19ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 86.6MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:13:12,016 INFO L158 Benchmark]: TraceAbstraction took 5912.29ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 70.4MB in the end (delta: 15.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 14:13:12,016 INFO L158 Benchmark]: Witness Printer took 76.54ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 65.0MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:13:12,018 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.55ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.74ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 101.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.33ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.9MB in the end (delta: 957.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.67ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 204.19ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 86.6MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5912.29ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 70.4MB in the end (delta: 15.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 76.54ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 65.0MB in the end (delta: 5.4MB). There was no memory consumed. 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: 5.6s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 1403 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1054 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 766 IncrementalHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 349 mSDtfsCounter, 766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 533 SyntacticMatches, 11 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=10, InterpolantAutomatonStates: 128, 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, 75 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 801 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1057 ConstructedInterpolants, 0 QuantifiedInterpolants, 2203 SizeOfPredicates, 27 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 2628/3069 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: ((((5 <= counter) && (counter <= 2147483646)) || ((1 <= counter) && (counter <= 2))) || ((counter <= 6) && (3 <= counter))) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((((2 <= counter) && (counter <= 5)) || (counter == 0)) || (counter == 1)) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:13:12,031 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