./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/loop-invgen/id_build.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:43:43,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:43:43,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:43:43,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:43:43,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:43:43,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:43:43,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:43:43,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:43:43,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:43:43,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:43:43,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:43:43,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:43:43,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:43:43,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:43:43,156 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:43:43,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:43:43,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:43:43,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:43:43,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:43:43,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:43:43,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:43,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:43,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:43:43,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:43:43,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:43:43,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:43:43,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:43:43,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:43:43,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:43:43,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:43:43,160 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2025-01-10 01:43:43,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:43:43,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:43:43,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:43:43,463 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:43:43,463 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:43:43,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2025-01-10 01:43:44,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff818d6b/f465f9173f634d1aac25f7e4f14ea346/FLAGcd29483c5 [2025-01-10 01:43:45,000 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:43:45,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2025-01-10 01:43:45,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff818d6b/f465f9173f634d1aac25f7e4f14ea346/FLAGcd29483c5 [2025-01-10 01:43:45,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff818d6b/f465f9173f634d1aac25f7e4f14ea346 [2025-01-10 01:43:45,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:43:45,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:43:45,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:43:45,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:43:45,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:43:45,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cc87cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45, skipping insertion in model container [2025-01-10 01:43:45,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:43:45,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:43:45,206 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:43:45,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:43:45,242 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:43:45,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45 WrapperNode [2025-01-10 01:43:45,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:43:45,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:43:45,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:43:45,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:43:45,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,273 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2025-01-10 01:43:45,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:43:45,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:43:45,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:43:45,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:43:45,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,298 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:43:45,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:43:45,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:43:45,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:43:45,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:43:45,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (1/1) ... [2025-01-10 01:43:45,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:45,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:45,357 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 01:43:45,361 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 01:43:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:43:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:43:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:43:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:43:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:43:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:43:45,438 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:43:45,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:43:45,630 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-10 01:43:45,631 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:43:45,640 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:43:45,641 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:43:45,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:45 BoogieIcfgContainer [2025-01-10 01:43:45,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:43:45,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:43:45,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:43:45,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:43:45,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:43:45" (1/3) ... [2025-01-10 01:43:45,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c7e3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:43:45, skipping insertion in model container [2025-01-10 01:43:45,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:45" (2/3) ... [2025-01-10 01:43:45,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c7e3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:43:45, skipping insertion in model container [2025-01-10 01:43:45,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:45" (3/3) ... [2025-01-10 01:43:45,655 INFO L128 eAbstractionObserver]: Analyzing ICFG id_build.i [2025-01-10 01:43:45,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:43:45,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_build.i that has 2 procedures, 41 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-01-10 01:43:45,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:43:45,753 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;@21c44eff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:43:45,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 01:43:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.64) internal successors, (41), 37 states have internal predecessors, (41), 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 01:43:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:43:45,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:45,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:43:45,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:45,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash 28695620, now seen corresponding path program 1 times [2025-01-10 01:43:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:45,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301239929] [2025-01-10 01:43:45,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:43:45,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:43:45,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:45,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:45,954 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 01:43:45,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301239929] [2025-01-10 01:43:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301239929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582745347] [2025-01-10 01:43:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:45,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:45,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:45,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:45,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:45,982 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.64) internal successors, (41), 37 states have internal predecessors, (41), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 01:43:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:46,033 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-01-10 01:43:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:43:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:46,040 INFO L225 Difference]: With dead ends: 99 [2025-01-10 01:43:46,040 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 01:43:46,043 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 01:43:46,045 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 75 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 01:43:46,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 01:43:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2025-01-10 01:43:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.619047619047619) internal successors, (34), 32 states have internal predecessors, (34), 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 01:43:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-01-10 01:43:46,091 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2025-01-10 01:43:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:46,091 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-01-10 01:43:46,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 01:43:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-01-10 01:43:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:43:46,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:46,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:43:46,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:43:46,092 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 01:43:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash 28694820, now seen corresponding path program 1 times [2025-01-10 01:43:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008590899] [2025-01-10 01:43:46,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:46,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:43:46,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:43:46,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:46,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:46,154 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 01:43:46,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:46,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008590899] [2025-01-10 01:43:46,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008590899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:46,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:46,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890019739] [2025-01-10 01:43:46,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:46,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:46,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:46,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:46,159 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 01:43:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:46,275 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2025-01-10 01:43:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:46,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:43:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:46,279 INFO L225 Difference]: With dead ends: 58 [2025-01-10 01:43:46,279 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 01:43:46,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:46,280 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:46,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 01:43:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-01-10 01:43:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 44 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:43:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-01-10 01:43:46,297 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 5 [2025-01-10 01:43:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:46,298 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-01-10 01:43:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 01:43:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-01-10 01:43:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:43:46,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:46,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:43:46,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:43:46,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash 889539464, now seen corresponding path program 1 times [2025-01-10 01:43:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228578734] [2025-01-10 01:43:46,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:46,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:43:46,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:43:46,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:46,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:46,338 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 01:43:46,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:46,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228578734] [2025-01-10 01:43:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228578734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:46,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:46,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414461611] [2025-01-10 01:43:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:46,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:46,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:46,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:46,340 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:46,385 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-01-10 01:43:46,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:43:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:46,386 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:43:46,386 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:43:46,387 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 01:43:46,387 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:46,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:43:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 01:43:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4) internal successors, (49), 42 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:43:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-01-10 01:43:46,399 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 6 [2025-01-10 01:43:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:46,399 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-01-10 01:43:46,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-01-10 01:43:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:43:46,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:46,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:46,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:43:46,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:46,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash 148934474, now seen corresponding path program 1 times [2025-01-10 01:43:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:46,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514041973] [2025-01-10 01:43:46,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:46,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:43:46,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:43:46,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:46,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:46,478 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 01:43:46,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:46,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514041973] [2025-01-10 01:43:46,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514041973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:46,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109814282] [2025-01-10 01:43:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:46,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:46,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:46,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:46,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:46,484 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 01:43:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:46,540 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-01-10 01:43:46,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:46,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:43:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:46,541 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:43:46,541 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:43:46,542 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 01:43:46,542 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:46,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:43:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-01-10 01:43:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:43:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-01-10 01:43:46,550 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 8 [2025-01-10 01:43:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:46,550 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-01-10 01:43:46,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 01:43:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-01-10 01:43:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:43:46,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:46,551 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] [2025-01-10 01:43:46,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:43:46,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:46,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 622403820, now seen corresponding path program 1 times [2025-01-10 01:43:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011487781] [2025-01-10 01:43:46,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:46,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:43:46,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:43:46,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:46,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:46,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:46,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011487781] [2025-01-10 01:43:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011487781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:46,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128628790] [2025-01-10 01:43:46,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:46,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:46,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:46,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:46,648 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 01:43:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:46,687 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-01-10 01:43:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:46,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 24 [2025-01-10 01:43:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:46,690 INFO L225 Difference]: With dead ends: 80 [2025-01-10 01:43:46,690 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:43:46,691 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 01:43:46,691 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:46,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:43:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-01-10 01:43:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.280701754385965) internal successors, (73), 64 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:43:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-01-10 01:43:46,708 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 24 [2025-01-10 01:43:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:46,708 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-01-10 01:43:46,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 01:43:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-01-10 01:43:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 01:43:46,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:46,709 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] [2025-01-10 01:43:46,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:43:46,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:46,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash 658447413, now seen corresponding path program 1 times [2025-01-10 01:43:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084923703] [2025-01-10 01:43:46,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:46,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:43:46,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:43:46,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:46,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:46,814 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 01:43:46,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084923703] [2025-01-10 01:43:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084923703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449285684] [2025-01-10 01:43:46,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:46,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:46,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:46,816 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 01:43:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:46,874 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-01-10 01:43:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 27 [2025-01-10 01:43:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:46,876 INFO L225 Difference]: With dead ends: 80 [2025-01-10 01:43:46,876 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:43:46,876 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 01:43:46,878 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:46,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:43:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-01-10 01:43:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.271186440677966) internal successors, (75), 66 states have internal predecessors, (75), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:43:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2025-01-10 01:43:46,892 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 27 [2025-01-10 01:43:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:46,892 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2025-01-10 01:43:46,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 01:43:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2025-01-10 01:43:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 01:43:46,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:46,894 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 01:43:46,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:43:46,894 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:46,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash 368108408, now seen corresponding path program 1 times [2025-01-10 01:43:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863114893] [2025-01-10 01:43:46,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:46,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:43:46,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:43:46,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:46,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:47,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863114893] [2025-01-10 01:43:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863114893] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503302795] [2025-01-10 01:43:47,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:47,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:47,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:47,010 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 01:43:47,013 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 01:43:47,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:43:47,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:43:47,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:47,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:47,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:43:47,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:43:47,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:43:47,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503302795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:47,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:43:47,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:43:47,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464275189] [2025-01-10 01:43:47,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:47,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:47,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:47,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:47,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:43:47,103 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 01:43:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:47,141 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2025-01-10 01:43:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 33 [2025-01-10 01:43:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:47,145 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:43:47,145 INFO L226 Difference]: Without dead ends: 74 [2025-01-10 01:43:47,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:43:47,146 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 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 01:43:47,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-10 01:43:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-10 01:43:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 64 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:43:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2025-01-10 01:43:47,162 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 33 [2025-01-10 01:43:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:47,162 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2025-01-10 01:43:47,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 01:43:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2025-01-10 01:43:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:43:47,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:47,166 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 01:43:47,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:43:47,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:47,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:47,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1473541192, now seen corresponding path program 1 times [2025-01-10 01:43:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:47,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464675960] [2025-01-10 01:43:47,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:47,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:43:47,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:43:47,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:47,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464675960] [2025-01-10 01:43:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464675960] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417348059] [2025-01-10 01:43:47,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:47,491 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 01:43:47,494 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 01:43:47,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:43:47,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:43:47,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:47,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:47,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:43:47,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:47,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417348059] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:47,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:43:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280419177] [2025-01-10 01:43:47,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:47,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:43:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:47,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:43:47,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:43:47,667 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:43:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:47,746 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2025-01-10 01:43:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:43:47,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2025-01-10 01:43:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:47,749 INFO L225 Difference]: With dead ends: 151 [2025-01-10 01:43:47,749 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 01:43:47,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:43:47,750 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:47,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:47,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 01:43:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-01-10 01:43:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.188235294117647) internal successors, (101), 90 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:43:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-01-10 01:43:47,769 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 34 [2025-01-10 01:43:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:47,769 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-01-10 01:43:47,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:43:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-01-10 01:43:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 01:43:47,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:47,770 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:47,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:43:47,970 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 01:43:47,971 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 01:43:47,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:47,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2081182043, now seen corresponding path program 1 times [2025-01-10 01:43:47,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777285487] [2025-01-10 01:43:47,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 01:43:47,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:43:47,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:47,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:43:48,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:48,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777285487] [2025-01-10 01:43:48,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777285487] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:48,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229145332] [2025-01-10 01:43:48,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:48,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:48,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:48,094 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 01:43:48,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:43:48,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 01:43:48,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:43:48,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:48,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:48,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:43:48,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:43:48,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:43:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229145332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:48,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:43:48,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 01:43:48,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238805534] [2025-01-10 01:43:48,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:48,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:48,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:48,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:43:48,201 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:43:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:48,228 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2025-01-10 01:43:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:48,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-01-10 01:43:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:48,229 INFO L225 Difference]: With dead ends: 104 [2025-01-10 01:43:48,229 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 01:43:48,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:43:48,230 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:48,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 01:43:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-10 01:43:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 89 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:43:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2025-01-10 01:43:48,247 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 46 [2025-01-10 01:43:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:48,248 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2025-01-10 01:43:48,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:43:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2025-01-10 01:43:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 01:43:48,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:48,251 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-01-10 01:43:48,259 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 01:43:48,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:48,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:48,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash 480353525, now seen corresponding path program 1 times [2025-01-10 01:43:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389776668] [2025-01-10 01:43:48,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:48,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 01:43:48,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 01:43:48,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:48,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 01:43:48,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:48,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389776668] [2025-01-10 01:43:48,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389776668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:48,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116615306] [2025-01-10 01:43:48,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:48,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:48,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:48,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:48,549 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:43:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:48,570 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2025-01-10 01:43:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2025-01-10 01:43:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:48,572 INFO L225 Difference]: With dead ends: 103 [2025-01-10 01:43:48,572 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 01:43:48,573 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 01:43:48,573 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:48,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 01:43:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-10 01:43:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 88 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:43:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2025-01-10 01:43:48,616 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 69 [2025-01-10 01:43:48,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:48,616 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2025-01-10 01:43:48,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:43:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2025-01-10 01:43:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-10 01:43:48,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:48,618 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:48,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:43:48,618 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:48,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1791619542, now seen corresponding path program 2 times [2025-01-10 01:43:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:48,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839753374] [2025-01-10 01:43:48,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:48,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:48,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-10 01:43:48,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 01:43:48,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:43:48,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-10 01:43:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839753374] [2025-01-10 01:43:48,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839753374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759189433] [2025-01-10 01:43:48,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:48,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:48,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:48,780 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 01:43:48,783 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 01:43:48,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-10 01:43:48,831 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 01:43:48,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:43:48,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:48,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:43:48,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:43:48,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:43:49,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759189433] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:49,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 19 [2025-01-10 01:43:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314157858] [2025-01-10 01:43:49,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:49,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:43:49,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:49,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:43:49,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:43:49,202 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-10 01:43:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:49,965 INFO L93 Difference]: Finished difference Result 382 states and 462 transitions. [2025-01-10 01:43:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-10 01:43:49,965 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 78 [2025-01-10 01:43:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:49,967 INFO L225 Difference]: With dead ends: 382 [2025-01-10 01:43:49,967 INFO L226 Difference]: Without dead ends: 326 [2025-01-10 01:43:49,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2025-01-10 01:43:49,969 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 136 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:49,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 95 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:43:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-10 01:43:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 314. [2025-01-10 01:43:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 267 states have (on average 1.0711610486891385) internal successors, (286), 270 states have internal predecessors, (286), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-10 01:43:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 370 transitions. [2025-01-10 01:43:49,996 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 370 transitions. Word has length 78 [2025-01-10 01:43:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:49,997 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 370 transitions. [2025-01-10 01:43:49,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-10 01:43:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 370 transitions. [2025-01-10 01:43:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-10 01:43:50,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:50,006 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:43:50,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:43:50,206 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,SelfDestructingSolverStorable10 [2025-01-10 01:43:50,207 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 01:43:50,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:50,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1883433299, now seen corresponding path program 1 times [2025-01-10 01:43:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:50,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523716588] [2025-01-10 01:43:50,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:50,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-10 01:43:50,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-10 01:43:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:50,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2817 backedges. 702 proven. 301 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2025-01-10 01:43:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523716588] [2025-01-10 01:43:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523716588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180440360] [2025-01-10 01:43:50,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:50,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:50,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:43:50,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:43:50,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-10 01:43:50,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-10 01:43:50,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:50,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:50,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:43:50,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2817 backedges. 1486 proven. 301 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-01-10 01:43:51,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2817 backedges. 702 proven. 301 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2025-01-10 01:43:51,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180440360] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:51,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2025-01-10 01:43:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249209902] [2025-01-10 01:43:51,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:51,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:43:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:51,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:43:51,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:43:51,529 INFO L87 Difference]: Start difference. First operand 314 states and 370 transitions. Second operand has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 19 states have internal predecessors, (124), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-10 01:43:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:51,643 INFO L93 Difference]: Finished difference Result 582 states and 676 transitions. [2025-01-10 01:43:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:43:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 19 states have internal predecessors, (124), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 317 [2025-01-10 01:43:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:51,646 INFO L225 Difference]: With dead ends: 582 [2025-01-10 01:43:51,648 INFO L226 Difference]: Without dead ends: 370 [2025-01-10 01:43:51,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 617 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:43:51,652 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:51,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 241 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-10 01:43:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 356. [2025-01-10 01:43:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 303 states have (on average 1.0693069306930694) internal successors, (324), 306 states have internal predecessors, (324), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-10 01:43:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 420 transitions. [2025-01-10 01:43:51,675 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 420 transitions. Word has length 317 [2025-01-10 01:43:51,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:51,676 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 420 transitions. [2025-01-10 01:43:51,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 19 states have internal predecessors, (124), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-10 01:43:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 420 transitions. [2025-01-10 01:43:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-01-10 01:43:51,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:51,680 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:43:51,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:43:51,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:43:51,881 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 01:43:51,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:51,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1492630987, now seen corresponding path program 2 times [2025-01-10 01:43:51,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:51,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429074467] [2025-01-10 01:43:51,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:51,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:51,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 361 statements into 2 equivalence classes. [2025-01-10 01:43:51,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 361 of 361 statements. [2025-01-10 01:43:51,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:43:51,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 0 proven. 915 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-01-10 01:43:52,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429074467] [2025-01-10 01:43:52,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429074467] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409227190] [2025-01-10 01:43:52,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:52,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:52,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:43:52,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:43:52,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 361 statements into 2 equivalence classes. [2025-01-10 01:43:52,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 361 of 361 statements. [2025-01-10 01:43:52,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:43:52,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:52,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:43:52,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 0 proven. 910 refuted. 0 times theorem prover too weak. 2789 trivial. 0 not checked. [2025-01-10 01:43:52,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 0 proven. 910 refuted. 0 times theorem prover too weak. 2789 trivial. 0 not checked. [2025-01-10 01:43:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409227190] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:53,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:53,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 01:43:53,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119675391] [2025-01-10 01:43:53,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:53,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:43:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:53,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:43:53,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:43:53,253 INFO L87 Difference]: Start difference. First operand 356 states and 420 transitions. Second operand has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 14 states have internal predecessors, (102), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-10 01:43:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:53,404 INFO L93 Difference]: Finished difference Result 356 states and 420 transitions. [2025-01-10 01:43:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:43:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 14 states have internal predecessors, (102), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 361 [2025-01-10 01:43:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:53,410 INFO L225 Difference]: With dead ends: 356 [2025-01-10 01:43:53,410 INFO L226 Difference]: Without dead ends: 355 [2025-01-10 01:43:53,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:43:53,412 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:53,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 121 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-10 01:43:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-01-10 01:43:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 303 states have (on average 1.066006600660066) internal successors, (323), 305 states have internal predecessors, (323), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-10 01:43:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 419 transitions. [2025-01-10 01:43:53,447 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 419 transitions. Word has length 361 [2025-01-10 01:43:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:53,448 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 419 transitions. [2025-01-10 01:43:53,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 14 states have internal predecessors, (102), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-10 01:43:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 419 transitions. [2025-01-10 01:43:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-10 01:43:53,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:53,453 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:43:53,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:43:53,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:43:53,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:53,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash 973079728, now seen corresponding path program 1 times [2025-01-10 01:43:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613500763] [2025-01-10 01:43:53,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:53,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-10 01:43:53,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-10 01:43:53,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:53,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3700 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-01-10 01:43:53,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613500763] [2025-01-10 01:43:53,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613500763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052358335] [2025-01-10 01:43:53,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:53,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:53,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:53,962 INFO L229 MonitoredProcess]: Starting monitored process 8 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 01:43:53,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:43:54,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-10 01:43:54,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-10 01:43:54,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:54,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:54,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:43:54,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3700 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-01-10 01:43:54,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3700 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-01-10 01:43:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052358335] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:54,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:43:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834797541] [2025-01-10 01:43:54,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:54,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:43:54,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:54,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:43:54,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:43:54,759 INFO L87 Difference]: Start difference. First operand 355 states and 419 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 01:43:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:54,871 INFO L93 Difference]: Finished difference Result 590 states and 722 transitions. [2025-01-10 01:43:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:43:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 362 [2025-01-10 01:43:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:54,876 INFO L225 Difference]: With dead ends: 590 [2025-01-10 01:43:54,876 INFO L226 Difference]: Without dead ends: 589 [2025-01-10 01:43:54,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:43:54,877 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:54,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-10 01:43:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-10 01:43:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 505 states have (on average 1.106930693069307) internal successors, (559), 507 states have internal predecessors, (559), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-10 01:43:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 719 transitions. [2025-01-10 01:43:54,928 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 719 transitions. Word has length 362 [2025-01-10 01:43:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:54,928 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 719 transitions. [2025-01-10 01:43:54,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 01:43:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 719 transitions. [2025-01-10 01:43:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-10 01:43:54,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:54,937 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 3, 2, 2, 2, 1, 1, 1] [2025-01-10 01:43:54,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:43:55,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:55,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash -252992072, now seen corresponding path program 3 times [2025-01-10 01:43:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:55,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373517450] [2025-01-10 01:43:55,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:43:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:55,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 368 statements into 23 equivalence classes. [2025-01-10 01:43:55,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 368 statements. [2025-01-10 01:43:55,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:43:55,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 3546 trivial. 0 not checked. [2025-01-10 01:43:55,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:55,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373517450] [2025-01-10 01:43:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373517450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:55,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672171410] [2025-01-10 01:43:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:55,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:55,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:55,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:55,196 INFO L87 Difference]: Start difference. First operand 589 states and 719 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:43:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:55,247 INFO L93 Difference]: Finished difference Result 589 states and 719 transitions. [2025-01-10 01:43:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 368 [2025-01-10 01:43:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:55,253 INFO L225 Difference]: With dead ends: 589 [2025-01-10 01:43:55,253 INFO L226 Difference]: Without dead ends: 587 [2025-01-10 01:43:55,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:55,254 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:55,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-01-10 01:43:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-01-10 01:43:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 505 states have (on average 1.011881188118812) internal successors, (511), 505 states have internal predecessors, (511), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-10 01:43:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 671 transitions. [2025-01-10 01:43:55,287 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 671 transitions. Word has length 368 [2025-01-10 01:43:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:55,288 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 671 transitions. [2025-01-10 01:43:55,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:43:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 671 transitions. [2025-01-10 01:43:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2025-01-10 01:43:55,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:55,314 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 5, 5, 5, 4, 1, 1, 1] [2025-01-10 01:43:55,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:43:55,314 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:43:55,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1916993323, now seen corresponding path program 2 times [2025-01-10 01:43:55,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:55,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806138928] [2025-01-10 01:43:55,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:55,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 902 statements into 2 equivalence classes. [2025-01-10 01:43:55,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 902 statements. [2025-01-10 01:43:55,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:43:55,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23800 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 20140 trivial. 0 not checked. [2025-01-10 01:43:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:55,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806138928] [2025-01-10 01:43:55,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806138928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:55,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499897189] [2025-01-10 01:43:55,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:55,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:55,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:55,379 INFO L229 MonitoredProcess]: Starting monitored process 9 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 01:43:55,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:43:55,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 902 statements into 2 equivalence classes. [2025-01-10 01:43:55,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 902 statements. [2025-01-10 01:43:55,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:43:55,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:55,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:43:55,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 23800 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 20140 trivial. 0 not checked. [2025-01-10 01:43:56,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 23800 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 20140 trivial. 0 not checked. [2025-01-10 01:43:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499897189] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:57,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:57,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-10 01:43:57,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707996218] [2025-01-10 01:43:57,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:57,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:57,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:57,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:57,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:57,173 INFO L87 Difference]: Start difference. First operand 587 states and 671 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:43:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:57,229 INFO L93 Difference]: Finished difference Result 587 states and 671 transitions. [2025-01-10 01:43:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:57,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 902 [2025-01-10 01:43:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:57,231 INFO L225 Difference]: With dead ends: 587 [2025-01-10 01:43:57,231 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:43:57,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1808 GetRequests, 1801 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:57,233 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:57,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:43:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:43:57,237 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 01:43:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:43:57,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 902 [2025-01-10 01:43:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:57,238 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:43:57,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:43:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:43:57,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:43:57,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 01:43:57,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 01:43:57,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 01:43:57,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 01:43:57,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 01:43:57,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 01:43:57,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 01:43:57,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 01:43:57,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 01:43:57,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 01:43:57,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 01:43:57,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 01:43:57,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:43:57,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 01:43:57,450 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:57,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:43:58,612 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:43:58,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:43:58 BoogieIcfgContainer [2025-01-10 01:43:58,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:43:58,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:43:58,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:43:58,629 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:43:58,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:45" (3/4) ... [2025-01-10 01:43:58,632 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:43:58,637 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:43:58,641 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 01:43:58,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:43:58,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:43:58,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:43:58,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:43:58,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:43:58,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:43:58,716 INFO L158 Benchmark]: Toolchain (without parser) took 13694.25ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 123.0MB in the beginning and 147.6MB in the end (delta: -24.6MB). Peak memory consumption was 210.3MB. Max. memory is 16.1GB. [2025-01-10 01:43:58,717 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:43:58,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.74ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 112.6MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:43:58,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.80ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:43:58,717 INFO L158 Benchmark]: Boogie Preprocessor took 40.18ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:43:58,718 INFO L158 Benchmark]: RCFGBuilder took 324.37ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 98.6MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:43:58,718 INFO L158 Benchmark]: TraceAbstraction took 12983.87ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 97.7MB in the beginning and 151.9MB in the end (delta: -54.2MB). Peak memory consumption was 197.2MB. Max. memory is 16.1GB. [2025-01-10 01:43:58,718 INFO L158 Benchmark]: Witness Printer took 87.35ms. Allocated memory is still 402.7MB. Free memory was 151.9MB in the beginning and 147.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:43:58,721 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.13ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.74ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 112.6MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.80ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.18ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 324.37ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 98.6MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12983.87ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 97.7MB in the beginning and 151.9MB in the end (delta: -54.2MB). Peak memory consumption was 197.2MB. Max. memory is 16.1GB. * Witness Printer took 87.35ms. Allocated memory is still 402.7MB. Free memory was 151.9MB in the beginning and 147.6MB in the end (delta: 4.3MB). 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 16, TraceHistogramMax: 80, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 324 mSDsluCounter, 1331 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 973 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 980 IncrementalHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 358 mSDtfsCounter, 980 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4279 GetRequests, 4137 SyntacticMatches, 17 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=14, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 4778 NumberOfCodeBlocks, 2643 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 6802 ConstructedInterpolants, 0 QuantifiedInterpolants, 15254 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2030 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 88951/106441 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: 27]: Loop Invariant Derived loop invariant: (((i == 0) && (nlen <= 2147483647)) || (((1 <= nlen) && (1 <= i)) && (nlen <= 2147483647))) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((0 <= (j + 2147483648)) && (1 <= nlen)) && (i == 0)) && (nlen <= 2147483647)) || ((((0 <= (j + 2147483648)) && (1 <= i)) && (nlen <= 2147483647)) && (((long long) i + 1) <= nlen))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:43:58,741 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