./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 7f9c3cc28dda067824ba301477f1c03bcac7a80158bb9362e7546f3bd18e0377 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 11:20:34,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 11:20:34,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 11:20:34,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 11:20:34,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 11:20:34,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 11:20:34,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 11:20:34,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 11:20:34,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 11:20:34,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 11:20:34,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 11:20:34,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 11:20:34,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 11:20:34,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 11:20:34,865 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 11:20:34,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 11:20:34,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 11:20:34,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 11:20:34,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 11:20:34,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 11:20:34,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 11:20:34,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 11:20:34,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 11:20:34,868 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f9c3cc28dda067824ba301477f1c03bcac7a80158bb9362e7546f3bd18e0377 [2025-02-08 11:20:35,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 11:20:35,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 11:20:35,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 11:20:35,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 11:20:35,126 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 11:20:35,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i [2025-02-08 11:20:36,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/006590a54/997fc4d7018a488ca9c469f3a5d072c0/FLAGb8d46cc1b [2025-02-08 11:20:36,645 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 11:20:36,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i [2025-02-08 11:20:36,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/006590a54/997fc4d7018a488ca9c469f3a5d072c0/FLAGb8d46cc1b [2025-02-08 11:20:36,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/006590a54/997fc4d7018a488ca9c469f3a5d072c0 [2025-02-08 11:20:36,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 11:20:36,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 11:20:36,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 11:20:36,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 11:20:36,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 11:20:36,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:20:36" (1/1) ... [2025-02-08 11:20:36,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394d2ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:36, skipping insertion in model container [2025-02-08 11:20:36,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:20:36" (1/1) ... [2025-02-08 11:20:36,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 11:20:37,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 11:20:37,396 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 11:20:37,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 11:20:37,525 INFO L204 MainTranslator]: Completed translation [2025-02-08 11:20:37,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37 WrapperNode [2025-02-08 11:20:37,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 11:20:37,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 11:20:37,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 11:20:37,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 11:20:37,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,562 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2025-02-08 11:20:37,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 11:20:37,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 11:20:37,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 11:20:37,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 11:20:37,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,577 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 11:20:37,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 11:20:37,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 11:20:37,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 11:20:37,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 11:20:37,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (1/1) ... [2025-02-08 11:20:37,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 11:20:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:20:37,620 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 11:20:37,623 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 11:20:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 11:20:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 11:20:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 11:20:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 11:20:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 11:20:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 11:20:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 11:20:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-02-08 11:20:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-02-08 11:20:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-02-08 11:20:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-02-08 11:20:37,724 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 11:20:37,725 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 11:20:37,855 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-08 11:20:37,855 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 11:20:37,868 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 11:20:37,869 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 11:20:37,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:20:37 BoogieIcfgContainer [2025-02-08 11:20:37,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 11:20:37,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 11:20:37,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 11:20:37,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 11:20:37,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:20:36" (1/3) ... [2025-02-08 11:20:37,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600b1235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:20:37, skipping insertion in model container [2025-02-08 11:20:37,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:20:37" (2/3) ... [2025-02-08 11:20:37,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600b1235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:20:37, skipping insertion in model container [2025-02-08 11:20:37,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:20:37" (3/3) ... [2025-02-08 11:20:37,878 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i [2025-02-08 11:20:37,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 11:20:37,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i that has 5 procedures, 82 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-08 11:20:37,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 11:20:37,981 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;@66d5ed05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 11:20:37,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 11:20:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 63 states have internal predecessors, (74), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-08 11:20:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 11:20:37,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:37,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:37,991 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 11:20:37,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1575297657, now seen corresponding path program 1 times [2025-02-08 11:20:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:38,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610282212] [2025-02-08 11:20:38,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:38,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:38,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 11:20:38,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 11:20:38,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:38,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:38,217 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 11:20:38,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:38,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610282212] [2025-02-08 11:20:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610282212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:38,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:20:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 11:20:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207062342] [2025-02-08 11:20:38,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:38,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:38,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:38,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:38,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 11:20:38,235 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 63 states have internal predecessors, (74), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 11:20:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:38,261 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2025-02-08 11:20:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:38,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2025-02-08 11:20:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:38,268 INFO L225 Difference]: With dead ends: 82 [2025-02-08 11:20:38,268 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 11:20:38,270 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 11:20:38,272 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:38,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 203 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 11:20:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 11:20:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 57 states have internal predecessors, (66), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 11:20:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2025-02-08 11:20:38,299 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 22 [2025-02-08 11:20:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:38,300 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-02-08 11:20:38,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 11:20:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2025-02-08 11:20:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 11:20:38,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:38,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:38,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 11:20:38,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 11:20:38,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:38,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1589587151, now seen corresponding path program 1 times [2025-02-08 11:20:38,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:38,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126214284] [2025-02-08 11:20:38,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:38,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 11:20:38,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 11:20:38,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:38,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:38,356 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 11:20:38,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:38,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126214284] [2025-02-08 11:20:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126214284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:38,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:20:38,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 11:20:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584997102] [2025-02-08 11:20:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:38,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:38,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:38,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 11:20:38,358 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 11:20:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:38,390 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2025-02-08 11:20:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:38,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-02-08 11:20:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:38,391 INFO L225 Difference]: With dead ends: 138 [2025-02-08 11:20:38,393 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 11:20:38,393 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 11:20:38,394 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:38,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 180 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 11:20:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-02-08 11:20:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.392156862745098) internal successors, (71), 60 states have internal predecessors, (71), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 11:20:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2025-02-08 11:20:38,406 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 105 transitions. Word has length 23 [2025-02-08 11:20:38,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:38,407 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 105 transitions. [2025-02-08 11:20:38,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 11:20:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 105 transitions. [2025-02-08 11:20:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 11:20:38,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:38,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:38,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 11:20:38,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 11:20:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1621971500, now seen corresponding path program 1 times [2025-02-08 11:20:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:38,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32099705] [2025-02-08 11:20:38,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:38,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:38,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 11:20:38,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 11:20:38,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:38,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 11:20:38,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:38,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32099705] [2025-02-08 11:20:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32099705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:38,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:20:38,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 11:20:38,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713187879] [2025-02-08 11:20:38,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:38,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:38,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:38,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 11:20:38,492 INFO L87 Difference]: Start difference. First operand 78 states and 105 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 11:20:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:38,515 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2025-02-08 11:20:38,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:38,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2025-02-08 11:20:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:38,517 INFO L225 Difference]: With dead ends: 78 [2025-02-08 11:20:38,518 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 11:20:38,518 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 11:20:38,518 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:38,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 11:20:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-08 11:20:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 59 states have internal predecessors, (70), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 11:20:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2025-02-08 11:20:38,530 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 36 [2025-02-08 11:20:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:38,530 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2025-02-08 11:20:38,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 11:20:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2025-02-08 11:20:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 11:20:38,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:38,532 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:38,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 11:20:38,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 11:20:38,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1258491070, now seen corresponding path program 1 times [2025-02-08 11:20:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045620540] [2025-02-08 11:20:38,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:38,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:38,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 11:20:38,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 11:20:38,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:38,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 11:20:38,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045620540] [2025-02-08 11:20:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045620540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 11:20:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 11:20:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304137488] [2025-02-08 11:20:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:38,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:38,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 11:20:38,609 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 11:20:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:38,637 INFO L93 Difference]: Finished difference Result 124 states and 162 transitions. [2025-02-08 11:20:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:38,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2025-02-08 11:20:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:38,638 INFO L225 Difference]: With dead ends: 124 [2025-02-08 11:20:38,638 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 11:20:38,638 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 11:20:38,639 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:38,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 11:20:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-02-08 11:20:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 62 states have internal predecessors, (75), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-08 11:20:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2025-02-08 11:20:38,645 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 37 [2025-02-08 11:20:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:38,645 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2025-02-08 11:20:38,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 11:20:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2025-02-08 11:20:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 11:20:38,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:38,646 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:38,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 11:20:38,647 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 11:20:38,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash -144508953, now seen corresponding path program 1 times [2025-02-08 11:20:38,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:38,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365933504] [2025-02-08 11:20:38,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:38,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:38,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 11:20:38,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 11:20:38,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:38,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 11:20:38,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:38,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365933504] [2025-02-08 11:20:38,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365933504] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 11:20:38,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172640842] [2025-02-08 11:20:38,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:38,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:38,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:20:38,727 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 11:20:38,728 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 11:20:38,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 11:20:38,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 11:20:38,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:38,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:38,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 11:20:38,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:20:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 11:20:38,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:20:38,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172640842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:38,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 11:20:38,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 11:20:38,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882986009] [2025-02-08 11:20:38,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:38,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:38,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:38,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:38,872 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 11:20:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:38,900 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2025-02-08 11:20:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:38,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2025-02-08 11:20:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:38,905 INFO L225 Difference]: With dead ends: 104 [2025-02-08 11:20:38,905 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 11:20:38,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:38,906 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:38,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 177 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 11:20:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-02-08 11:20:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 65 states have internal predecessors, (80), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-08 11:20:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-02-08 11:20:38,915 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 48 [2025-02-08 11:20:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:38,915 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-02-08 11:20:38,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 11:20:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-02-08 11:20:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 11:20:38,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:38,917 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:38,927 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 11:20:39,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:39,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 11:20:39,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:39,118 INFO L85 PathProgramCache]: Analyzing trace with hash -184810247, now seen corresponding path program 1 times [2025-02-08 11:20:39,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:39,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648713859] [2025-02-08 11:20:39,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:39,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 11:20:39,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 11:20:39,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:39,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 11:20:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648713859] [2025-02-08 11:20:39,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648713859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 11:20:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612010237] [2025-02-08 11:20:39,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:39,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:20:39,215 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 11:20:39,216 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 11:20:39,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 11:20:39,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 11:20:39,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:39,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:39,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 11:20:39,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:20:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 11:20:39,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:20:39,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612010237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:39,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 11:20:39,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 11:20:39,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383179373] [2025-02-08 11:20:39,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:39,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:39,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:39,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:39,305 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 11:20:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:39,319 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2025-02-08 11:20:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:39,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2025-02-08 11:20:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:39,320 INFO L225 Difference]: With dead ends: 87 [2025-02-08 11:20:39,321 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 11:20:39,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:39,321 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:39,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 11:20:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-02-08 11:20:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 64 states have internal predecessors, (79), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-08 11:20:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2025-02-08 11:20:39,330 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 49 [2025-02-08 11:20:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:39,330 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2025-02-08 11:20:39,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 11:20:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2025-02-08 11:20:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 11:20:39,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:39,332 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:39,342 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 11:20:39,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:39,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 11:20:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash -365658144, now seen corresponding path program 1 times [2025-02-08 11:20:39,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:39,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839890653] [2025-02-08 11:20:39,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:39,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 11:20:39,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 11:20:39,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:39,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 11:20:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839890653] [2025-02-08 11:20:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839890653] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 11:20:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154751175] [2025-02-08 11:20:39,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:39,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:39,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:20:39,603 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 11:20:39,605 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 11:20:39,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 11:20:39,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 11:20:39,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:39,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:39,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 11:20:39,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:20:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 11:20:39,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:20:39,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154751175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:39,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 11:20:39,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-08 11:20:39,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548563359] [2025-02-08 11:20:39,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:39,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:39,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:39,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:39,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:39,686 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 11:20:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:39,697 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2025-02-08 11:20:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:39,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2025-02-08 11:20:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:39,698 INFO L225 Difference]: With dead ends: 107 [2025-02-08 11:20:39,698 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 11:20:39,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:39,699 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:39,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 11:20:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2025-02-08 11:20:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 62 states have internal predecessors, (76), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-08 11:20:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2025-02-08 11:20:39,719 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 53 [2025-02-08 11:20:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:39,719 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2025-02-08 11:20:39,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 11:20:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2025-02-08 11:20:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 11:20:39,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:39,720 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:39,726 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 11:20:39,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:39,920 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 11:20:39,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1334960915, now seen corresponding path program 1 times [2025-02-08 11:20:39,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:39,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261450794] [2025-02-08 11:20:39,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:39,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 11:20:39,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 11:20:39,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:39,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 11:20:39,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261450794] [2025-02-08 11:20:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261450794] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 11:20:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676121766] [2025-02-08 11:20:39,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:39,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:20:39,988 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 11:20:39,988 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 11:20:40,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 11:20:40,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 11:20:40,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:40,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:40,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 11:20:40,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:20:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 11:20:40,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:20:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676121766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:40,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 11:20:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 11:20:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762984356] [2025-02-08 11:20:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:40,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:40,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:40,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:40,060 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 11:20:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:40,070 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-02-08 11:20:40,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-02-08 11:20:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:40,071 INFO L225 Difference]: With dead ends: 90 [2025-02-08 11:20:40,071 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 11:20:40,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:40,071 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:40,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 11:20:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-02-08 11:20:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 66 states have internal predecessors, (80), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 11:20:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2025-02-08 11:20:40,077 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 61 [2025-02-08 11:20:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:40,077 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2025-02-08 11:20:40,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 11:20:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2025-02-08 11:20:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 11:20:40,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:40,078 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:40,083 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 11:20:40,278 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,SelfDestructingSolverStorable7 [2025-02-08 11:20:40,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 11:20:40,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:40,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1152551918, now seen corresponding path program 1 times [2025-02-08 11:20:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043090613] [2025-02-08 11:20:40,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:40,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 11:20:40,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 11:20:40,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:40,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 11:20:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043090613] [2025-02-08 11:20:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043090613] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 11:20:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584333437] [2025-02-08 11:20:40,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:20:40,343 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 11:20:40,344 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 11:20:40,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 11:20:40,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 11:20:40,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:40,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:40,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 11:20:40,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:20:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 11:20:40,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:20:40,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584333437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:40,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 11:20:40,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-08 11:20:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231722054] [2025-02-08 11:20:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:40,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:40,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:40,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:40,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:40,424 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 11:20:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:40,431 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2025-02-08 11:20:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:40,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-02-08 11:20:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:40,432 INFO L225 Difference]: With dead ends: 90 [2025-02-08 11:20:40,432 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 11:20:40,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:40,433 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:40,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 11:20:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-08 11:20:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 61 states have internal predecessors, (74), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-08 11:20:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2025-02-08 11:20:40,437 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 61 [2025-02-08 11:20:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:40,437 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2025-02-08 11:20:40,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 11:20:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2025-02-08 11:20:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 11:20:40,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 11:20:40,438 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:40,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 11:20:40,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:40,639 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 11:20:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 11:20:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1565884578, now seen corresponding path program 1 times [2025-02-08 11:20:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 11:20:40,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516426314] [2025-02-08 11:20:40,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 11:20:40,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 11:20:40,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 11:20:40,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:40,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 11:20:40,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 11:20:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516426314] [2025-02-08 11:20:40,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516426314] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 11:20:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876966217] [2025-02-08 11:20:40,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 11:20:40,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 11:20:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 11:20:40,683 INFO L229 MonitoredProcess]: Starting monitored process 7 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 11:20:40,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 11:20:40,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 11:20:40,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 11:20:40,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 11:20:40,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 11:20:40,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 11:20:40,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 11:20:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 11:20:40,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 11:20:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876966217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 11:20:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 11:20:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 11:20:40,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034704392] [2025-02-08 11:20:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 11:20:40,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 11:20:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 11:20:40,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 11:20:40,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:40,756 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 11:20:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 11:20:40,761 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2025-02-08 11:20:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 11:20:40,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-02-08 11:20:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 11:20:40,762 INFO L225 Difference]: With dead ends: 82 [2025-02-08 11:20:40,762 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 11:20:40,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 11:20:40,763 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 11:20:40,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 169 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 11:20:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 11:20:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 11:20:40,763 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 11:20:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 11:20:40,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2025-02-08 11:20:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 11:20:40,764 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 11:20:40,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 11:20:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 11:20:40,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 11:20:40,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 11:20:40,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 11:20:40,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 11:20:40,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 11:20:40,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 11:20:40,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 11:20:40,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 11:20:40,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 11:20:40,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 11:20:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 11:20:40,969 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 11:20:40,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 11:20:41,010 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 11:20:41,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:20:41 BoogieIcfgContainer [2025-02-08 11:20:41,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 11:20:41,016 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 11:20:41,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 11:20:41,017 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 11:20:41,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 11:20:37" (3/4) ... [2025-02-08 11:20:41,018 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 11:20:41,022 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 11:20:41,022 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-02-08 11:20:41,022 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 11:20:41,022 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-02-08 11:20:41,025 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 11:20:41,025 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 11:20:41,025 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 11:20:41,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 11:20:41,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 11:20:41,093 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 11:20:41,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 11:20:41,093 INFO L158 Benchmark]: Toolchain (without parser) took 4268.35ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 76.0MB in the end (delta: 55.1MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2025-02-08 11:20:41,093 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:20:41,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.71ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 70.0MB in the end (delta: 61.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 11:20:41,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.42ms. Allocated memory is still 167.8MB. Free memory was 70.0MB in the beginning and 67.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:20:41,094 INFO L158 Benchmark]: Boogie Preprocessor took 21.40ms. Allocated memory is still 167.8MB. Free memory was 67.1MB in the beginning and 65.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:20:41,094 INFO L158 Benchmark]: IcfgBuilder took 284.41ms. Allocated memory is still 167.8MB. Free memory was 65.4MB in the beginning and 49.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 11:20:41,094 INFO L158 Benchmark]: TraceAbstraction took 3145.50ms. Allocated memory is still 167.8MB. Free memory was 48.5MB in the beginning and 82.9MB in the end (delta: -34.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 11:20:41,094 INFO L158 Benchmark]: Witness Printer took 76.18ms. Allocated memory is still 167.8MB. Free memory was 82.9MB in the beginning and 76.0MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 11:20:41,095 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.71ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 70.0MB in the end (delta: 61.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.42ms. Allocated memory is still 167.8MB. Free memory was 70.0MB in the beginning and 67.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.40ms. Allocated memory is still 167.8MB. Free memory was 67.1MB in the beginning and 65.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 284.41ms. Allocated memory is still 167.8MB. Free memory was 65.4MB in the beginning and 49.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3145.50ms. Allocated memory is still 167.8MB. Free memory was 48.5MB in the beginning and 82.9MB in the end (delta: -34.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 76.18ms. Allocated memory is still 167.8MB. Free memory was 82.9MB in the beginning and 76.0MB in the end (delta: 6.9MB). 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: 1641]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1641]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: 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 5 procedures, 82 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 1792 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 855 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 937 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=8, InterpolantAutomatonStates: 30, 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, 10 MinimizatonAttempts, 8 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 908 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1064 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 416/440 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 RESULT: Ultimate proved your program to be correct! [2025-02-08 11:20:41,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE