./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/gcd_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/bitvector/gcd_4.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 679f2fe8d678884423b2dff47bf2c3c7ede0374b3a8bb68f9a9e8a332d8776ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:52:36,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:52:36,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:52:36,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:52:36,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:52:36,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:52:36,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:52:36,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:52:36,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:52:36,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:52:36,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:52:36,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:52:36,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:52:36,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:52:36,867 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:52:36,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:52:36,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:52:36,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:52:36,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:52:36,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:52:36,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:52:36,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:52:36,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:52:36,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:52:36,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:52:36,870 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 -> 679f2fe8d678884423b2dff47bf2c3c7ede0374b3a8bb68f9a9e8a332d8776ef [2025-02-08 08:52:37,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:52:37,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:52:37,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:52:37,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:52:37,191 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:52:37,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2025-02-08 08:52:38,500 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f89f29b8f/2998a0e36c8a4ac2a8e8d9b8eab82d9d/FLAG20a918e20 [2025-02-08 08:52:38,728 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:52:38,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2025-02-08 08:52:38,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f89f29b8f/2998a0e36c8a4ac2a8e8d9b8eab82d9d/FLAG20a918e20 [2025-02-08 08:52:38,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f89f29b8f/2998a0e36c8a4ac2a8e8d9b8eab82d9d [2025-02-08 08:52:38,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:52:38,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:52:38,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:52:38,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:52:38,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:52:38,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:38,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799eed49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38, skipping insertion in model container [2025-02-08 08:52:38,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:38,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:52:38,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:52:38,946 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:52:38,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:52:38,982 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:52:38,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38 WrapperNode [2025-02-08 08:52:38,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:52:38,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:52:38,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:52:38,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:52:38,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:38,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,013 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2025-02-08 08:52:39,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:52:39,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:52:39,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:52:39,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:52:39,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,050 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-08 08:52:39,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:52:39,064 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:52:39,065 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:52:39,065 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:52:39,066 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (1/1) ... [2025-02-08 08:52:39,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:52:39,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:39,100 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-08 08:52:39,104 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-08 08:52:39,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:52:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:52:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:52:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:52:39,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:52:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 08:52:39,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 08:52:39,188 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:52:39,191 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:52:39,362 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-08 08:52:39,362 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:52:39,371 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:52:39,372 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:52:39,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:52:39 BoogieIcfgContainer [2025-02-08 08:52:39,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:52:39,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:52:39,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:52:39,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:52:39,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:52:38" (1/3) ... [2025-02-08 08:52:39,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14564199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:52:39, skipping insertion in model container [2025-02-08 08:52:39,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:38" (2/3) ... [2025-02-08 08:52:39,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14564199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:52:39, skipping insertion in model container [2025-02-08 08:52:39,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:52:39" (3/3) ... [2025-02-08 08:52:39,383 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4.c [2025-02-08 08:52:39,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:52:39,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4.c that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-02-08 08:52:39,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:52:39,454 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;@250385c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:52:39,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:52:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.736842105263158) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:52:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 08:52:39,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:39,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 08:52:39,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:39,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 1 times [2025-02-08 08:52:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013342155] [2025-02-08 08:52:39,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:39,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:52:39,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:52:39,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:39,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:39,652 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-08 08:52:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013342155] [2025-02-08 08:52:39,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013342155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:39,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:39,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228540363] [2025-02-08 08:52:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:39,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:39,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:39,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:39,683 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.736842105263158) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-08 08:52:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:39,748 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2025-02-08 08:52:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-02-08 08:52:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:39,753 INFO L225 Difference]: With dead ends: 65 [2025-02-08 08:52:39,753 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 08:52:39,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:39,758 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:39,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 08:52:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2025-02-08 08:52:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 17 states have internal predecessors, (20), 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-08 08:52:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-02-08 08:52:39,782 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 3 [2025-02-08 08:52:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:39,783 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-02-08 08:52:39,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-08 08:52:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-02-08 08:52:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:52:39,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:39,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:52:39,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:52:39,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1876607, now seen corresponding path program 1 times [2025-02-08 08:52:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057153265] [2025-02-08 08:52:39,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:39,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:52:39,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:52:39,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:39,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:39,889 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-08 08:52:39,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:39,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057153265] [2025-02-08 08:52:39,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057153265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:39,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:39,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:39,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738308444] [2025-02-08 08:52:39,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:39,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:39,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:39,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:39,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:39,892 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-08 08:52:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:39,933 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-02-08 08:52:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-08 08:52:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:39,933 INFO L225 Difference]: With dead ends: 35 [2025-02-08 08:52:39,933 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 08:52:39,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:39,934 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:39,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 08:52:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2025-02-08 08:52:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-02-08 08:52:39,937 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2025-02-08 08:52:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:39,937 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-02-08 08:52:39,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-08 08:52:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-02-08 08:52:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:52:39,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:39,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:39,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:52:39,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:39,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:39,939 INFO L85 PathProgramCache]: Analyzing trace with hash 72243472, now seen corresponding path program 1 times [2025-02-08 08:52:39,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:39,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467333327] [2025-02-08 08:52:39,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:39,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:39,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:52:39,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:52:39,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:39,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:40,060 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-08 08:52:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467333327] [2025-02-08 08:52:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467333327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:40,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090709850] [2025-02-08 08:52:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:40,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:52:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:40,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:52:40,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:40,062 INFO L87 Difference]: Start difference. First operand 14 states and 15 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-08 08:52:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:40,125 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2025-02-08 08:52:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:40,127 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-08 08:52:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:40,128 INFO L225 Difference]: With dead ends: 26 [2025-02-08 08:52:40,128 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 08:52:40,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:40,129 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:40,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:52:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 08:52:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-08 08:52:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.5) internal successors, (27), 21 states have internal predecessors, (27), 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-08 08:52:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-02-08 08:52:40,139 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 7 [2025-02-08 08:52:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:40,139 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-02-08 08:52:40,139 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-08 08:52:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-02-08 08:52:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:52:40,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:40,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:40,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:52:40,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:40,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash 72243507, now seen corresponding path program 1 times [2025-02-08 08:52:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:40,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299127944] [2025-02-08 08:52:40,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:40,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:40,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:52:40,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:52:40,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:40,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:40,234 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-08 08:52:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299127944] [2025-02-08 08:52:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299127944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:40,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:40,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089473217] [2025-02-08 08:52:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:40,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:40,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:40,236 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-08 08:52:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:40,275 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-02-08 08:52:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:40,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-08 08:52:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:40,276 INFO L225 Difference]: With dead ends: 34 [2025-02-08 08:52:40,276 INFO L226 Difference]: Without dead ends: 22 [2025-02-08 08:52:40,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:40,277 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:40,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-08 08:52:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-08 08:52:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 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-08 08:52:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-08 08:52:40,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-02-08 08:52:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:40,281 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-08 08:52:40,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-08 08:52:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-02-08 08:52:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:52:40,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:40,282 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:40,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:52:40,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:40,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash 340769143, now seen corresponding path program 1 times [2025-02-08 08:52:40,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:40,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622331793] [2025-02-08 08:52:40,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:40,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:52:40,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:52:40,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:40,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:52:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622331793] [2025-02-08 08:52:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622331793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:40,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:40,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983144764] [2025-02-08 08:52:40,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:40,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:40,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:40,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:40,313 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:40,334 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-02-08 08:52:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:40,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 08:52:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:40,335 INFO L225 Difference]: With dead ends: 22 [2025-02-08 08:52:40,335 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 08:52:40,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:40,336 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:40,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 08:52:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 08:52:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-02-08 08:52:40,343 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2025-02-08 08:52:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:40,344 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-02-08 08:52:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-02-08 08:52:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:52:40,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:40,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:40,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:52:40,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:40,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1973907731, now seen corresponding path program 1 times [2025-02-08 08:52:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:40,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041795801] [2025-02-08 08:52:40,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:40,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:40,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:52:40,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:52:40,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:40,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041795801] [2025-02-08 08:52:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041795801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137094727] [2025-02-08 08:52:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:40,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:52:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:40,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:52:40,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:40,447 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:40,496 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-02-08 08:52:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 08:52:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:40,497 INFO L225 Difference]: With dead ends: 24 [2025-02-08 08:52:40,497 INFO L226 Difference]: Without dead ends: 23 [2025-02-08 08:52:40,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:40,498 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:40,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-08 08:52:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2025-02-08 08:52:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 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-08 08:52:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-02-08 08:52:40,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2025-02-08 08:52:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:40,503 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-02-08 08:52:40,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-02-08 08:52:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:52:40,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:40,504 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:40,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:52:40,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:40,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1973908820, now seen corresponding path program 1 times [2025-02-08 08:52:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491778155] [2025-02-08 08:52:40,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:40,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:52:40,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:52:40,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:40,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:40,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491778155] [2025-02-08 08:52:40,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491778155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:40,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:40,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:52:40,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177846067] [2025-02-08 08:52:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:40,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:52:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:40,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:52:40,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:52:40,586 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:40,621 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-02-08 08:52:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:40,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 08:52:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:40,622 INFO L225 Difference]: With dead ends: 22 [2025-02-08 08:52:40,622 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 08:52:40,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:52:40,623 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:40,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 08:52:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 08:52:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-02-08 08:52:40,626 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2025-02-08 08:52:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:40,626 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-02-08 08:52:40,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-02-08 08:52:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:52:40,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:40,627 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:40,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:52:40,627 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:40,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1974575177, now seen corresponding path program 1 times [2025-02-08 08:52:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:40,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402520181] [2025-02-08 08:52:40,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:40,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:40,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:52:40,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:52:40,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:40,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:52:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402520181] [2025-02-08 08:52:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402520181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:40,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690595572] [2025-02-08 08:52:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:40,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:40,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:40,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:40,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:40,658 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-08 08:52:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:40,678 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-02-08 08:52:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:40,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 08:52:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:40,679 INFO L225 Difference]: With dead ends: 21 [2025-02-08 08:52:40,679 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 08:52:40,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:40,680 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:40,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 08:52:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 08:52:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-02-08 08:52:40,683 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2025-02-08 08:52:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:40,683 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-02-08 08:52:40,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-08 08:52:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-02-08 08:52:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:52:40,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:40,684 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:40,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:52:40,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:40,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1082288368, now seen corresponding path program 1 times [2025-02-08 08:52:40,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:40,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311640341] [2025-02-08 08:52:40,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:40,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:40,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:52:40,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:52:40,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:40,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:40,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311640341] [2025-02-08 08:52:40,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311640341] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:40,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236283896] [2025-02-08 08:52:40,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:40,770 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-08 08:52:40,772 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-08 08:52:40,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:52:40,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:52:40,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:40,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:52:40,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:40,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:40,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236283896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:40,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:40,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-08 08:52:40,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473274269] [2025-02-08 08:52:40,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:40,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:52:40,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:40,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:52:40,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:52:40,973 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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-08 08:52:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:41,029 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-02-08 08:52:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:52:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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 16 [2025-02-08 08:52:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:41,030 INFO L225 Difference]: With dead ends: 38 [2025-02-08 08:52:41,030 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 08:52:41,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:52:41,031 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:41,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 08:52:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-08 08:52:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-02-08 08:52:41,037 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 16 [2025-02-08 08:52:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:41,037 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-02-08 08:52:41,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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-08 08:52:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-02-08 08:52:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 08:52:41,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:41,038 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:41,046 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-08 08:52:41,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:41,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:41,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1924034952, now seen corresponding path program 2 times [2025-02-08 08:52:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872219595] [2025-02-08 08:52:41,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:41,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 08:52:41,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:52:41,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:52:41,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 08:52:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872219595] [2025-02-08 08:52:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872219595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967651131] [2025-02-08 08:52:41,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:41,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:41,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:41,328 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-08 08:52:41,330 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-08 08:52:41,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 08:52:41,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:52:41,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:52:41,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:41,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:52:41,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:41,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967651131] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:41,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:41,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2025-02-08 08:52:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167059352] [2025-02-08 08:52:41,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:41,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 08:52:41,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:41,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 08:52:41,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:52:41,679 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-08 08:52:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:41,963 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-02-08 08:52:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:52:41,963 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 08:52:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:41,964 INFO L225 Difference]: With dead ends: 74 [2025-02-08 08:52:41,964 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 08:52:41,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=381, Unknown=0, NotChecked=0, Total=600 [2025-02-08 08:52:41,965 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:41,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 2 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:52:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 08:52:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2025-02-08 08:52:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 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-08 08:52:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-02-08 08:52:41,971 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 24 [2025-02-08 08:52:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:41,971 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-02-08 08:52:41,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-08 08:52:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2025-02-08 08:52:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 08:52:41,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:41,971 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:41,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:52:42,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:42,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:42,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1924036041, now seen corresponding path program 1 times [2025-02-08 08:52:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933646298] [2025-02-08 08:52:42,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:42,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:52:42,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:52:42,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:42,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:52:42,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933646298] [2025-02-08 08:52:42,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933646298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634460921] [2025-02-08 08:52:42,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:42,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:42,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:42,266 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-08 08:52:42,269 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-08 08:52:42,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:52:42,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:52:42,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:42,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:42,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:52:42,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:42,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634460921] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:42,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:42,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-02-08 08:52:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102797570] [2025-02-08 08:52:42,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:42,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:52:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:42,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:52:42,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:52:42,604 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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-08 08:52:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:42,892 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2025-02-08 08:52:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:52:42,893 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 08:52:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:42,893 INFO L225 Difference]: With dead ends: 87 [2025-02-08 08:52:42,893 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 08:52:42,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=339, Unknown=0, NotChecked=0, Total=552 [2025-02-08 08:52:42,894 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:42,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:52:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 08:52:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2025-02-08 08:52:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 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-08 08:52:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-02-08 08:52:42,911 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2025-02-08 08:52:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:42,912 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-02-08 08:52:42,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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-08 08:52:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-02-08 08:52:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 08:52:42,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:42,913 INFO L218 NwaCegarLoop]: trace histogram [8, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-08 08:52:42,921 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-08 08:52:43,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:43,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:43,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash 899697854, now seen corresponding path program 3 times [2025-02-08 08:52:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:43,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902938923] [2025-02-08 08:52:43,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:52:43,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:43,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 6 equivalence classes. [2025-02-08 08:52:43,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 36 statements. [2025-02-08 08:52:43,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 08:52:43,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 08:52:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902938923] [2025-02-08 08:52:43,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902938923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942528181] [2025-02-08 08:52:43,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:52:43,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:43,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:43,242 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-08 08:52:43,244 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-08 08:52:43,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 6 equivalence classes. [2025-02-08 08:52:43,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 36 statements. [2025-02-08 08:52:43,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 08:52:43,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:43,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:52:43,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 08:52:43,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:52:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942528181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:43,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:52:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2025-02-08 08:52:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571064438] [2025-02-08 08:52:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:43,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:52:43,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:43,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:52:43,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:52:43,337 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:43,369 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-02-08 08:52:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:43,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 08:52:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:43,370 INFO L225 Difference]: With dead ends: 72 [2025-02-08 08:52:43,370 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 08:52:43,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:52:43,371 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:43,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 08:52:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2025-02-08 08:52:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-02-08 08:52:43,377 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2025-02-08 08:52:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:43,377 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-02-08 08:52:43,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-02-08 08:52:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 08:52:43,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:43,378 INFO L218 NwaCegarLoop]: trace histogram [9, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 08:52:43,385 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-08 08:52:43,579 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,SelfDestructingSolverStorable11 [2025-02-08 08:52:43,579 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:52:43,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:43,579 INFO L85 PathProgramCache]: Analyzing trace with hash -155700740, now seen corresponding path program 2 times [2025-02-08 08:52:43,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:43,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414962237] [2025-02-08 08:52:43,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:43,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-08 08:52:43,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 08:52:43,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:52:43,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:52:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:43,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414962237] [2025-02-08 08:52:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414962237] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:43,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181956380] [2025-02-08 08:52:43,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:43,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:43,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:43,772 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-08 08:52:43,775 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-08 08:52:43,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-08 08:52:43,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 08:52:43,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:52:43,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:43,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:52:43,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 42 proven. 54 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:52:44,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:52:44,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181956380] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:44,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:44,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2025-02-08 08:52:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447282131] [2025-02-08 08:52:44,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:44,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 08:52:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:44,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 08:52:44,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-02-08 08:52:44,222 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 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-08 08:52:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:44,436 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-02-08 08:52:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:52:44,436 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 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 40 [2025-02-08 08:52:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:44,436 INFO L225 Difference]: With dead ends: 59 [2025-02-08 08:52:44,437 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:52:44,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2025-02-08 08:52:44,438 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:44,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:52:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:52:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:52:44,439 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-08 08:52:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:52:44,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-02-08 08:52:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:44,439 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:52:44,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 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-08 08:52:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:52:44,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:52:44,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 08:52:44,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 08:52:44,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 08:52:44,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 08:52:44,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 08:52:44,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 08:52:44,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 08:52:44,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 08:52:44,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:52:44,645 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,SelfDestructingSolverStorable12 [2025-02-08 08:52:44,648 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:44,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:52:44,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:52:44,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:52:44 BoogieIcfgContainer [2025-02-08 08:52:44,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:52:44,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:52:44,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:52:44,780 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:52:44,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:52:39" (3/4) ... [2025-02-08 08:52:44,783 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:52:44,788 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 08:52:44,790 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 08:52:44,791 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 08:52:44,791 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:52:44,791 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:52:44,791 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:52:44,861 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:52:44,861 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:52:44,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:52:44,862 INFO L158 Benchmark]: Toolchain (without parser) took 6098.77ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 95.7MB in the end (delta: 37.7MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2025-02-08 08:52:44,863 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:44,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.97ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 122.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:52:44,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 121.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:44,863 INFO L158 Benchmark]: Boogie Preprocessor took 47.00ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 120.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:44,865 INFO L158 Benchmark]: IcfgBuilder took 308.18ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 107.7MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:52:44,865 INFO L158 Benchmark]: TraceAbstraction took 5404.42ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 102.4MB in the end (delta: 4.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2025-02-08 08:52:44,865 INFO L158 Benchmark]: Witness Printer took 81.20ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 95.7MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:52:44,869 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.45ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.97ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 122.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 121.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.00ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 120.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 308.18ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 107.7MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5404.42ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 102.4MB in the end (delta: 4.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 81.20ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 95.7MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: 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, 33 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 850 IncrementalHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 65 mSDtfsCounter, 850 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=11, InterpolantAutomatonStates: 76, 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, 13 MinimizatonAttempts, 66 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 351 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 433 ConstructedInterpolants, 0 QuantifiedInterpolants, 2367 SizeOfPredicates, 12 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 298/695 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: (((((((a == 9) && (b == 9)) || ((a == 27) && (b == 18))) || (((b == 0) && (a <= 2147483647)) && (9 <= ((long long) b + a)))) || ((a == 63) && (b == 18))) || ((a == 45) && (b == 18))) || ((a == 9) && (b == 18))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:52:44,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE