./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_17_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 7868aeaa5817427d0a3828dfefb1034afcc09d6e3c75f7f026172c6fd79cbf43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 05:30:59,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 05:30:59,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 05:30:59,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 05:30:59,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 05:30:59,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 05:30:59,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 05:30:59,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 05:30:59,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 05:30:59,461 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 05:30:59,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 05:30:59,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 05:30:59,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 05:30:59,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 05:30:59,461 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 05:30:59,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 05:30:59,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 05:30:59,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:30:59,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:30:59,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 05:30:59,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 05:30:59,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 05:30:59,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 05:30:59,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 05:30:59,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 05:30:59,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 05:30:59,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 05:30:59,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 05:30:59,464 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 -> 7868aeaa5817427d0a3828dfefb1034afcc09d6e3c75f7f026172c6fd79cbf43 [2025-01-10 05:30:59,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 05:30:59,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 05:30:59,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 05:30:59,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 05:30:59,771 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 05:30:59,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_17_good.i [2025-01-10 05:31:01,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a61360f6/3ab897af2976428184b6325af1a1526d/FLAG1b63ca6a3 [2025-01-10 05:31:01,528 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 05:31:01,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_17_good.i [2025-01-10 05:31:01,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a61360f6/3ab897af2976428184b6325af1a1526d/FLAG1b63ca6a3 [2025-01-10 05:31:01,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a61360f6/3ab897af2976428184b6325af1a1526d [2025-01-10 05:31:01,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 05:31:01,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 05:31:01,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 05:31:01,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 05:31:01,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 05:31:01,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:31:01" (1/1) ... [2025-01-10 05:31:01,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d5f502c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:01, skipping insertion in model container [2025-01-10 05:31:01,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:31:01" (1/1) ... [2025-01-10 05:31:01,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 05:31:02,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:31:02,304 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 05:31:02,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:31:02,508 INFO L204 MainTranslator]: Completed translation [2025-01-10 05:31:02,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02 WrapperNode [2025-01-10 05:31:02,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 05:31:02,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 05:31:02,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 05:31:02,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 05:31:02,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,579 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-01-10 05:31:02,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 05:31:02,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 05:31:02,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 05:31:02,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 05:31:02,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,614 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 05:31:02,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 05:31:02,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 05:31:02,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 05:31:02,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 05:31:02,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (1/1) ... [2025-01-10 05:31:02,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:31:02,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:31:02,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 05:31:02,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 05:31:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 05:31:02,708 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 05:31:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 05:31:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 05:31:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 05:31:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 05:31:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 05:31:02,849 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 05:31:02,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 05:31:03,008 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-10 05:31:03,008 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 05:31:03,016 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 05:31:03,016 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 05:31:03,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:31:03 BoogieIcfgContainer [2025-01-10 05:31:03,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 05:31:03,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 05:31:03,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 05:31:03,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 05:31:03,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:31:01" (1/3) ... [2025-01-10 05:31:03,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c50d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:31:03, skipping insertion in model container [2025-01-10 05:31:03,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:31:02" (2/3) ... [2025-01-10 05:31:03,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c50d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:31:03, skipping insertion in model container [2025-01-10 05:31:03,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:31:03" (3/3) ... [2025-01-10 05:31:03,028 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_17_good.i [2025-01-10 05:31:03,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 05:31:03,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_sub_17_good.i that has 3 procedures, 54 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-01-10 05:31:03,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 05:31:03,122 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;@54f2842e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 05:31:03,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 05:31:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 47 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:31:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 05:31:03,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:03,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:03,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:03,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash -28944791, now seen corresponding path program 1 times [2025-01-10 05:31:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:03,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835564695] [2025-01-10 05:31:03,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:03,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:03,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 05:31:03,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 05:31:03,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:03,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:31:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835564695] [2025-01-10 05:31:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835564695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:03,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:03,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:31:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568157794] [2025-01-10 05:31:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:03,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:31:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:03,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:31:03,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:31:03,460 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 47 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:03,523 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2025-01-10 05:31:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:31:03,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-01-10 05:31:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:03,531 INFO L225 Difference]: With dead ends: 104 [2025-01-10 05:31:03,535 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 05:31:03,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:31:03,542 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:03,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 05:31:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 05:31:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.53125) internal successors, (49), 44 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 05:31:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-01-10 05:31:03,587 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 10 [2025-01-10 05:31:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:03,589 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-01-10 05:31:03,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-01-10 05:31:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 05:31:03,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:03,592 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:03,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 05:31:03,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:03,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash 994209325, now seen corresponding path program 1 times [2025-01-10 05:31:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:03,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27789890] [2025-01-10 05:31:03,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:03,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:03,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 05:31:03,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 05:31:03,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:03,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:31:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27789890] [2025-01-10 05:31:03,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27789890] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:31:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852282279] [2025-01-10 05:31:03,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:03,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:31:03,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:31:03,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 05:31:03,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 05:31:03,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 05:31:03,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 05:31:03,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:03,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:03,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 05:31:03,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:31:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:31:03,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:31:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852282279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:03,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:31:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 05:31:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80827777] [2025-01-10 05:31:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 05:31:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:03,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 05:31:03,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:31:03,937 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:03,974 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-01-10 05:31:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 05:31:03,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-10 05:31:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:03,976 INFO L225 Difference]: With dead ends: 89 [2025-01-10 05:31:03,976 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 05:31:03,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:31:03,978 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:03,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 05:31:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-10 05:31:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 40 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 05:31:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-01-10 05:31:03,987 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 13 [2025-01-10 05:31:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:03,988 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-01-10 05:31:03,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-01-10 05:31:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 05:31:03,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:03,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:03,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 05:31:04,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:31:04,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:04,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1952610001, now seen corresponding path program 1 times [2025-01-10 05:31:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:04,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203166084] [2025-01-10 05:31:04,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:04,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 05:31:04,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 05:31:04,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:04,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 05:31:04,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:04,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203166084] [2025-01-10 05:31:04,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203166084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:04,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:04,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:31:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127525883] [2025-01-10 05:31:04,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:04,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:31:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:04,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:31:04,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:04,261 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:04,289 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-01-10 05:31:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:31:04,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-10 05:31:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:04,290 INFO L225 Difference]: With dead ends: 91 [2025-01-10 05:31:04,291 INFO L226 Difference]: Without dead ends: 53 [2025-01-10 05:31:04,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:04,292 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:04,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-10 05:31:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-01-10 05:31:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 43 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 05:31:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-01-10 05:31:04,301 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 15 [2025-01-10 05:31:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:04,301 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-01-10 05:31:04,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-01-10 05:31:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 05:31:04,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:04,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:04,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 05:31:04,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:04,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:04,303 INFO L85 PathProgramCache]: Analyzing trace with hash 401982703, now seen corresponding path program 1 times [2025-01-10 05:31:04,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:04,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365617622] [2025-01-10 05:31:04,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:04,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:04,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 05:31:04,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 05:31:04,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:04,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 05:31:04,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365617622] [2025-01-10 05:31:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365617622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:04,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:04,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:31:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090177406] [2025-01-10 05:31:04,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:04,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:31:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:04,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:31:04,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:04,365 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:04,380 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2025-01-10 05:31:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:31:04,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 05:31:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:04,382 INFO L225 Difference]: With dead ends: 80 [2025-01-10 05:31:04,382 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 05:31:04,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:04,383 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 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-01-10 05:31:04,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 05:31:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2025-01-10 05:31:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 44 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 05:31:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-01-10 05:31:04,401 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 16 [2025-01-10 05:31:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:04,401 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-01-10 05:31:04,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-01-10 05:31:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 05:31:04,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:04,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:04,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 05:31:04,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:04,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash 401367952, now seen corresponding path program 1 times [2025-01-10 05:31:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599767336] [2025-01-10 05:31:04,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:04,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:04,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 05:31:04,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 05:31:04,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:04,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:31:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599767336] [2025-01-10 05:31:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599767336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:04,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:04,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:31:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580462070] [2025-01-10 05:31:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:04,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:31:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:04,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:31:04,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:04,463 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:04,483 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-01-10 05:31:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:31:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 05:31:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:04,484 INFO L225 Difference]: With dead ends: 51 [2025-01-10 05:31:04,484 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 05:31:04,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:04,485 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:04,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 05:31:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 05:31:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 43 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 05:31:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-01-10 05:31:04,491 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 16 [2025-01-10 05:31:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:04,491 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-01-10 05:31:04,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:31:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-01-10 05:31:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 05:31:04,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:04,492 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 05:31:04,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:04,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1383466565, now seen corresponding path program 1 times [2025-01-10 05:31:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417260997] [2025-01-10 05:31:04,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:04,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 05:31:04,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 05:31:04,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:04,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 05:31:04,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417260997] [2025-01-10 05:31:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417260997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:04,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:31:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263298337] [2025-01-10 05:31:04,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:04,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:31:04,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:04,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:31:04,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:31:04,569 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 05:31:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:04,609 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2025-01-10 05:31:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:31:04,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-01-10 05:31:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:04,610 INFO L225 Difference]: With dead ends: 64 [2025-01-10 05:31:04,610 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 05:31:04,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:31:04,611 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:04,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 05:31:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 05:31:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 53 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:31:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-01-10 05:31:04,623 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 21 [2025-01-10 05:31:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-01-10 05:31:04,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 05:31:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-01-10 05:31:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 05:31:04,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:04,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:04,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 05:31:04,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:04,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:04,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1976071883, now seen corresponding path program 1 times [2025-01-10 05:31:04,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:04,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364387389] [2025-01-10 05:31:04,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:04,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 05:31:04,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 05:31:04,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:04,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:31:04,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364387389] [2025-01-10 05:31:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364387389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:04,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:31:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052135308] [2025-01-10 05:31:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:31:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:04,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:31:04,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:31:04,732 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:31:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:04,757 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-01-10 05:31:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:31:04,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-10 05:31:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:04,758 INFO L225 Difference]: With dead ends: 81 [2025-01-10 05:31:04,759 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 05:31:04,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:31:04,759 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 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-01-10 05:31:04,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 05:31:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-10 05:31:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 56 states have internal predecessors, (65), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:31:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-01-10 05:31:04,774 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 26 [2025-01-10 05:31:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:04,776 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-01-10 05:31:04,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:31:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2025-01-10 05:31:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 05:31:04,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:04,778 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 05:31:04,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 05:31:04,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:04,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1959347077, now seen corresponding path program 1 times [2025-01-10 05:31:04,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:04,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957343009] [2025-01-10 05:31:04,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:04,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:04,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 05:31:04,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 05:31:04,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:04,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:31:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957343009] [2025-01-10 05:31:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957343009] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:31:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417784932] [2025-01-10 05:31:04,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:04,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:31:04,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:31:04,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 05:31:04,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 05:31:04,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 05:31:04,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 05:31:04,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:04,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:04,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 05:31:04,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:31:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:31:04,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:31:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417784932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:04,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:31:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 05:31:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238970684] [2025-01-10 05:31:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 05:31:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:04,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 05:31:04,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:31:04,996 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:31:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:05,018 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-01-10 05:31:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 05:31:05,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-01-10 05:31:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:05,021 INFO L225 Difference]: With dead ends: 80 [2025-01-10 05:31:05,021 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 05:31:05,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:31:05,022 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:05,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 05:31:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-10 05:31:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:31:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-01-10 05:31:05,035 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 29 [2025-01-10 05:31:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:05,035 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-01-10 05:31:05,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:31:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-01-10 05:31:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 05:31:05,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:05,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:05,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 05:31:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:31:05,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 610223353, now seen corresponding path program 1 times [2025-01-10 05:31:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051692237] [2025-01-10 05:31:05,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:05,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 05:31:05,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 05:31:05,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:05,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:31:05,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:05,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051692237] [2025-01-10 05:31:05,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051692237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:05,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:05,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:31:05,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615773648] [2025-01-10 05:31:05,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:05,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:31:05,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:05,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:31:05,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:05,293 INFO L87 Difference]: Start difference. First operand 61 states and 72 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:31:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:05,308 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2025-01-10 05:31:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:31:05,309 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-10 05:31:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:05,311 INFO L225 Difference]: With dead ends: 61 [2025-01-10 05:31:05,311 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 05:31:05,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:05,312 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:05,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 05:31:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-10 05:31:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 51 states have internal predecessors, (59), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:31:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-01-10 05:31:05,321 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 30 [2025-01-10 05:31:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:05,326 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-01-10 05:31:05,326 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:31:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-01-10 05:31:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 05:31:05,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:05,328 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:05,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 05:31:05,328 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:05,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1765142837, now seen corresponding path program 1 times [2025-01-10 05:31:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942570979] [2025-01-10 05:31:05,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:05,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 05:31:05,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 05:31:05,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:05,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 05:31:05,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:05,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942570979] [2025-01-10 05:31:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942570979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:31:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560896737] [2025-01-10 05:31:05,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:05,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:31:05,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:31:05,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 05:31:05,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 05:31:05,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 05:31:05,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 05:31:05,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:05,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:05,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 05:31:05,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:31:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 05:31:05,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:31:05,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560896737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:05,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:31:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 05:31:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472215757] [2025-01-10 05:31:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:05,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 05:31:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:05,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 05:31:05,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:31:05,517 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 05:31:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:05,544 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2025-01-10 05:31:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 05:31:05,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2025-01-10 05:31:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:05,549 INFO L225 Difference]: With dead ends: 84 [2025-01-10 05:31:05,549 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 05:31:05,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:31:05,549 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:05,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 05:31:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-01-10 05:31:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 05:31:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-01-10 05:31:05,559 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2025-01-10 05:31:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-01-10 05:31:05,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 05:31:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-01-10 05:31:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 05:31:05,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:05,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:05,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 05:31:05,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:31:05,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:05,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1737054857, now seen corresponding path program 1 times [2025-01-10 05:31:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:05,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773384257] [2025-01-10 05:31:05,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:05,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 05:31:05,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 05:31:05,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:05,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:31:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:05,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773384257] [2025-01-10 05:31:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773384257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:31:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006700558] [2025-01-10 05:31:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:05,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:31:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:05,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:31:05,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:05,821 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:31:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:05,830 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-01-10 05:31:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:31:05,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-10 05:31:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:05,832 INFO L225 Difference]: With dead ends: 41 [2025-01-10 05:31:05,832 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 05:31:05,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:31:05,832 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:05,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 05:31:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-10 05:31:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 05:31:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-01-10 05:31:05,837 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2025-01-10 05:31:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:05,838 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-01-10 05:31:05,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:31:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-01-10 05:31:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 05:31:05,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:05,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:05,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 05:31:05,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash -282206869, now seen corresponding path program 1 times [2025-01-10 05:31:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:05,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677843459] [2025-01-10 05:31:05,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:05,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:05,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 05:31:05,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 05:31:05,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:05,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 05:31:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:05,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677843459] [2025-01-10 05:31:05,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677843459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:05,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:31:05,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:31:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965750047] [2025-01-10 05:31:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:05,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:31:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:05,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:31:05,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:31:05,917 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 05:31:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:05,945 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-01-10 05:31:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:31:05,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-01-10 05:31:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:05,946 INFO L225 Difference]: With dead ends: 49 [2025-01-10 05:31:05,947 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 05:31:05,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:31:05,948 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:05,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 05:31:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-10 05:31:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 40 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:31:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-01-10 05:31:05,959 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 37 [2025-01-10 05:31:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:05,960 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-01-10 05:31:05,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 05:31:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-01-10 05:31:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 05:31:05,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:31:05,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-01-10 05:31:05,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 05:31:05,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:31:05,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:31:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash -88548667, now seen corresponding path program 1 times [2025-01-10 05:31:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:31:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760465884] [2025-01-10 05:31:05,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:31:05,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 05:31:05,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 05:31:05,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:05,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 05:31:06,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:31:06,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760465884] [2025-01-10 05:31:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760465884] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:31:06,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141209295] [2025-01-10 05:31:06,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:31:06,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:31:06,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:31:06,074 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-01-10 05:31:06,077 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-01-10 05:31:06,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 05:31:06,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 05:31:06,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:31:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:31:06,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 05:31:06,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:31:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 05:31:06,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:31:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141209295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:31:06,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:31:06,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 05:31:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783178937] [2025-01-10 05:31:06,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:31:06,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 05:31:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:31:06,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 05:31:06,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:31:06,198 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 05:31:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:31:06,216 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-01-10 05:31:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 05:31:06,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2025-01-10 05:31:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:31:06,218 INFO L225 Difference]: With dead ends: 51 [2025-01-10 05:31:06,218 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 05:31:06,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:31:06,220 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:31:06,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:31:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 05:31:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 05:31:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 05:31:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 05:31:06,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2025-01-10 05:31:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:31:06,221 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 05:31:06,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 05:31:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 05:31:06,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 05:31:06,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 05:31:06,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 05:31:06,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 05:31:06,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 05:31:06,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 05:31:06,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 05:31:06,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 05:31:06,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 05:31:06,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 05:31:06,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 05:31:06,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 05:31:06,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 05:31:06,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 05:31:06,429 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,SelfDestructingSolverStorable12 [2025-01-10 05:31:06,432 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:31:06,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 05:31:06,530 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 05:31:06,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:31:06 BoogieIcfgContainer [2025-01-10 05:31:06,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 05:31:06,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 05:31:06,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 05:31:06,547 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 05:31:06,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:31:03" (3/4) ... [2025-01-10 05:31:06,550 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 05:31:06,555 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 05:31:06,556 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 05:31:06,561 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 05:31:06,561 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 05:31:06,561 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 05:31:06,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 05:31:06,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 05:31:06,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 05:31:06,651 INFO L158 Benchmark]: Toolchain (without parser) took 5074.44ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 86.4MB in the end (delta: 35.4MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2025-01-10 05:31:06,651 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:31:06,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 931.93ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 60.1MB in the end (delta: 61.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 05:31:06,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.17ms. Allocated memory is still 167.8MB. Free memory was 59.5MB in the beginning and 57.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:31:06,652 INFO L158 Benchmark]: Boogie Preprocessor took 54.15ms. Allocated memory is still 167.8MB. Free memory was 57.3MB in the beginning and 55.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:31:06,652 INFO L158 Benchmark]: RCFGBuilder took 380.53ms. Allocated memory is still 167.8MB. Free memory was 55.6MB in the beginning and 41.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 05:31:06,652 INFO L158 Benchmark]: TraceAbstraction took 3526.66ms. Allocated memory is still 167.8MB. Free memory was 41.0MB in the beginning and 92.8MB in the end (delta: -51.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:31:06,653 INFO L158 Benchmark]: Witness Printer took 103.74ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 86.4MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 05:31:06,655 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.40ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 931.93ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 60.1MB in the end (delta: 61.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.17ms. Allocated memory is still 167.8MB. Free memory was 59.5MB in the beginning and 57.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.15ms. Allocated memory is still 167.8MB. Free memory was 57.3MB in the beginning and 55.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 380.53ms. Allocated memory is still 167.8MB. Free memory was 55.6MB in the beginning and 41.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3526.66ms. Allocated memory is still 167.8MB. Free memory was 41.0MB in the beginning and 92.8MB in the end (delta: -51.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 103.74ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 86.4MB in the end (delta: 6.4MB). 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: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1575]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1575]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 1542 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 948 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 594 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 425 ConstructedInterpolants, 0 QuantifiedInterpolants, 611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 119/123 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 12 specifications checked. All of them hold - InvariantResult [Line: 1575]: Loop Invariant Derived loop invariant: (((1 <= h) && (((long) data + 2) == 0)) || ((h == 0) && (0 <= ((long) data + 2)))) - InvariantResult [Line: 1579]: Loop Invariant Derived loop invariant: (((j == 0) && (((long) data + 2) == 0)) || ((1 <= j) && (((long) data + 2) == 0))) - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: ((((0 <= ((long) 2147483647 + data)) && (i == 0)) && (data <= 2147483647)) || ((1 <= i) && (data <= 2147483647))) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((1 <= k) && (data <= 2147483647)) || ((k == 0) && (data <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-01-10 05:31:06,675 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