./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_init4_ground-1.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/array-examples/standard_init4_ground-1.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 84dd450b83ffc0eda27ceeda48a4324978aec0ffc3f50cf64d7cfe4a88062bda --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:18:42,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:18:42,236 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:18:42,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:18:42,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:18:42,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:18:42,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:18:42,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:18:42,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:18:42,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:18:42,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:18:42,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:18:42,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:18:42,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:18:42,282 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:18:42,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:18:42,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:18:42,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:18:42,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:18:42,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:18:42,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:18:42,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:18:42,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:18:42,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:18:42,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:42,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:42,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:18:42,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:18:42,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:18:42,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:18:42,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:18:42,286 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 -> 84dd450b83ffc0eda27ceeda48a4324978aec0ffc3f50cf64d7cfe4a88062bda [2025-01-10 01:18:42,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:18:42,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:18:42,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:18:42,529 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:18:42,529 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:18:42,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init4_ground-1.i [2025-01-10 01:18:43,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85441dffe/dd8c80cb728c4273bf40d0bb93d2efe2/FLAGb6f707c3f [2025-01-10 01:18:44,246 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:18:44,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init4_ground-1.i [2025-01-10 01:18:44,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85441dffe/dd8c80cb728c4273bf40d0bb93d2efe2/FLAGb6f707c3f [2025-01-10 01:18:44,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85441dffe/dd8c80cb728c4273bf40d0bb93d2efe2 [2025-01-10 01:18:44,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:18:44,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:18:44,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:18:44,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:18:44,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:18:44,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44, skipping insertion in model container [2025-01-10 01:18:44,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:18:44,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:18:44,540 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:18:44,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:18:44,559 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:18:44,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44 WrapperNode [2025-01-10 01:18:44,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:18:44,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:18:44,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:18:44,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:18:44,564 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:18:44" (1/1) ... [2025-01-10 01:18:44,569 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:18:44" (1/1) ... [2025-01-10 01:18:44,578 INFO L138 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2025-01-10 01:18:44,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:18:44,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:18:44,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:18:44,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:18:44,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,593 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-10 01:18:44,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:18:44,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:18:44,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:18:44,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:18:44,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (1/1) ... [2025-01-10 01:18:44,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:44,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:44,625 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:18:44,627 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:18:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:18:44,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:18:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:18:44,686 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:18:44,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:18:44,791 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-10 01:18:44,791 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:18:44,801 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:18:44,801 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:18:44,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:44 BoogieIcfgContainer [2025-01-10 01:18:44,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:18:44,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:18:44,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:18:44,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:18:44,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:18:44" (1/3) ... [2025-01-10 01:18:44,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1140c90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:18:44, skipping insertion in model container [2025-01-10 01:18:44,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:44" (2/3) ... [2025-01-10 01:18:44,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1140c90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:18:44, skipping insertion in model container [2025-01-10 01:18:44,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:44" (3/3) ... [2025-01-10 01:18:44,810 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_init4_ground-1.i [2025-01-10 01:18:44,822 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:18:44,824 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_init4_ground-1.i that has 1 procedures, 35 locations, 1 initial locations, 5 loop locations, and 10 error locations. [2025-01-10 01:18:44,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:18:44,875 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;@649f73e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:18:44,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:18:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 34 states have internal predecessors, (41), 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:18:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:18:44,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:44,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:18:44,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:18:44,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:18:44,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313839302] [2025-01-10 01:18:44,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:44,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:18:44,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:18:44,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:44,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:45,044 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:18:45,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:45,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313839302] [2025-01-10 01:18:45,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313839302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:45,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:45,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:18:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683589249] [2025-01-10 01:18:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:45,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:45,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:45,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:45,067 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 34 states have internal predecessors, (41), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:45,169 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2025-01-10 01:18:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:18:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:45,176 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:18:45,177 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 01:18:45,182 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:18:45,184 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:45,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 01:18:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-10 01:18:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 40 states have internal predecessors, (45), 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:18:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-01-10 01:18:45,216 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 4 [2025-01-10 01:18:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:45,216 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-01-10 01:18:45,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-01-10 01:18:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:18:45,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:45,217 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:18:45,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:18:45,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:18:45,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1805857894, now seen corresponding path program 1 times [2025-01-10 01:18:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:45,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484078805] [2025-01-10 01:18:45,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:45,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:18:45,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:18:45,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:45,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484078805] [2025-01-10 01:18:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484078805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355721611] [2025-01-10 01:18:45,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:45,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:45,299 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:18:45,301 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:18:45,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:18:45,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:18:45,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:45,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:45,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:18:45,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:45,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355721611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:45,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:45,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 01:18:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066011947] [2025-01-10 01:18:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:45,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:45,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:45,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:18:45,382 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:45,493 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-01-10 01:18:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:18:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:45,495 INFO L225 Difference]: With dead ends: 41 [2025-01-10 01:18:45,495 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:18:45,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:18:45,500 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:45,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:18:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 01:18:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 36 states have internal predecessors, (41), 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:18:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-01-10 01:18:45,508 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 7 [2025-01-10 01:18:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:45,509 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-01-10 01:18:45,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-01-10 01:18:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:18:45,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:45,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 01:18:45,520 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:18:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:45,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:18:45,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 147019906, now seen corresponding path program 1 times [2025-01-10 01:18:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624547478] [2025-01-10 01:18:45,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:45,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:18:45,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:18:45,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:45,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:45,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624547478] [2025-01-10 01:18:45,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624547478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:45,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:18:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554537007] [2025-01-10 01:18:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:45,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:45,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:45,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:45,751 INFO L87 Difference]: Start difference. First operand 37 states and 41 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:18:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:45,805 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-01-10 01:18:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:45,805 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:18:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:45,806 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:18:45,806 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:18:45,806 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:18:45,807 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:45,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:18:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2025-01-10 01:18:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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:18:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-01-10 01:18:45,819 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2025-01-10 01:18:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:45,819 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-01-10 01:18:45,819 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:18:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-01-10 01:18:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:18:45,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:45,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:45,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:18:45,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:18:45,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash 973248354, now seen corresponding path program 1 times [2025-01-10 01:18:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:45,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174885669] [2025-01-10 01:18:45,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:45,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:45,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:18:45,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:18:45,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:45,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:18:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:45,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174885669] [2025-01-10 01:18:45,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174885669] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:45,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840809285] [2025-01-10 01:18:45,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:45,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:45,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:45,941 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:18:45,942 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:18:45,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:18:45,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:18:45,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:45,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:45,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:18:45,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:18:45,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:18:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840809285] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:46,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:46,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:18:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025432837] [2025-01-10 01:18:46,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:46,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:18:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:46,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:18:46,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:18:46,021 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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:18:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:46,117 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2025-01-10 01:18:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:18:46,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 22 [2025-01-10 01:18:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:46,118 INFO L225 Difference]: With dead ends: 80 [2025-01-10 01:18:46,118 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 01:18:46,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:18:46,119 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:46,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 21 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 01:18:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-10 01:18:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 60 states have internal predecessors, (65), 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:18:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2025-01-10 01:18:46,125 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2025-01-10 01:18:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:46,125 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2025-01-10 01:18:46,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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:18:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2025-01-10 01:18:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 01:18:46,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:46,127 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:46,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:18:46,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:46,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:18:46,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1324013850, now seen corresponding path program 2 times [2025-01-10 01:18:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:46,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122608178] [2025-01-10 01:18:46,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:46,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:46,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-01-10 01:18:46,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 58 statements. [2025-01-10 01:18:46,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:18:46,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-10 01:18:46,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122608178] [2025-01-10 01:18:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122608178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:46,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972584427] [2025-01-10 01:18:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:46,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:46,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:46,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:46,400 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:46,417 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-01-10 01:18:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:46,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-10 01:18:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:46,419 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:18:46,419 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 01:18:46,419 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:18:46,419 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 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:18:46,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 01:18:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 01:18:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 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:18:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-01-10 01:18:46,425 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 58 [2025-01-10 01:18:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:46,425 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-01-10 01:18:46,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-01-10 01:18:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 01:18:46,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:46,427 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:46,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:18:46,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:18:46,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash 437908170, now seen corresponding path program 1 times [2025-01-10 01:18:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:46,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079402574] [2025-01-10 01:18:46,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:46,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 01:18:46,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 01:18:46,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:46,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 01:18:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:46,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079402574] [2025-01-10 01:18:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079402574] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:46,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780058125] [2025-01-10 01:18:46,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:46,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:46,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:46,599 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:18:46,601 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:18:46,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 01:18:46,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 01:18:46,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:46,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:46,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:18:46,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 01:18:46,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 01:18:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780058125] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:46,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:46,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 01:18:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945397743] [2025-01-10 01:18:46,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:46,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:18:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:46,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:18:46,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:18:46,795 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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:18:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:47,002 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2025-01-10 01:18:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:18:47,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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 63 [2025-01-10 01:18:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:47,004 INFO L225 Difference]: With dead ends: 189 [2025-01-10 01:18:47,004 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 01:18:47,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:18:47,005 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 214 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:47,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 21 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:18:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 01:18:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-10 01:18:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.0441176470588236) internal successors, (142), 137 states have internal predecessors, (142), 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:18:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2025-01-10 01:18:47,013 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 63 [2025-01-10 01:18:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:47,013 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2025-01-10 01:18:47,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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:18:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2025-01-10 01:18:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-10 01:18:47,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:47,016 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:47,022 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:18:47,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:47,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:18:47,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash -187400630, now seen corresponding path program 2 times [2025-01-10 01:18:47,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:47,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095494205] [2025-01-10 01:18:47,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:47,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-01-10 01:18:47,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-01-10 01:18:47,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:18:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-01-10 01:18:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:47,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095494205] [2025-01-10 01:18:47,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095494205] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:47,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997041807] [2025-01-10 01:18:47,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:47,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:47,549 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:18:47,551 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:18:47,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-01-10 01:18:47,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-01-10 01:18:47,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:18:47,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:47,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:18:47,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-01-10 01:18:47,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-01-10 01:18:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997041807] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:48,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 28 [2025-01-10 01:18:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915205750] [2025-01-10 01:18:48,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:48,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:18:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:48,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:18:48,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:18:48,103 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 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:18:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:48,525 INFO L93 Difference]: Finished difference Result 386 states and 442 transitions. [2025-01-10 01:18:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 01:18:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 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 135 [2025-01-10 01:18:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:48,528 INFO L225 Difference]: With dead ends: 386 [2025-01-10 01:18:48,528 INFO L226 Difference]: Without dead ends: 281 [2025-01-10 01:18:48,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:18:48,530 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 329 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:48,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 44 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:18:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-10 01:18:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-01-10 01:18:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.0178571428571428) internal successors, (285), 280 states have internal predecessors, (285), 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:18:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 285 transitions. [2025-01-10 01:18:48,555 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 285 transitions. Word has length 135 [2025-01-10 01:18:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:48,555 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 285 transitions. [2025-01-10 01:18:48,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 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:18:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 285 transitions. [2025-01-10 01:18:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-01-10 01:18:48,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:48,561 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:48,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:18:48,766 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,SelfDestructingSolverStorable6 [2025-01-10 01:18:48,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:18:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1998637994, now seen corresponding path program 1 times [2025-01-10 01:18:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805492233] [2025-01-10 01:18:48,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:48,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-10 01:18:48,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-10 01:18:48,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:48,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2865 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2861 trivial. 0 not checked. [2025-01-10 01:18:49,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:49,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805492233] [2025-01-10 01:18:49,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805492233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:49,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:49,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:49,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666192757] [2025-01-10 01:18:49,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:49,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:49,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:49,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:49,237 INFO L87 Difference]: Start difference. First operand 281 states and 285 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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:18:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:49,270 INFO L93 Difference]: Finished difference Result 281 states and 285 transitions. [2025-01-10 01:18:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 280 [2025-01-10 01:18:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:49,271 INFO L225 Difference]: With dead ends: 281 [2025-01-10 01:18:49,271 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:18:49,272 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:18:49,272 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:49,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:18:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:18:49,273 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:18:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:18:49,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280 [2025-01-10 01:18:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:49,273 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:18:49,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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:18:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:18:49,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:18:49,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 01:18:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-01-10 01:18:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:18:49,285 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-01-10 01:18:49,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:18:49,403 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:18:49,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:18:49 BoogieIcfgContainer [2025-01-10 01:18:49,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:18:49,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:18:49,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:18:49,424 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:18:49,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:44" (3/4) ... [2025-01-10 01:18:49,431 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:18:49,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 01:18:49,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:18:49,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:18:49,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:18:49,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:18:49,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:18:49,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:18:49,537 INFO L158 Benchmark]: Toolchain (without parser) took 5107.84ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.7MB in the beginning and 282.2MB in the end (delta: -176.5MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2025-01-10 01:18:49,537 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 125.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:18:49,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 129.66ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 95.3MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:49,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.36ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:18:49,538 INFO L158 Benchmark]: Boogie Preprocessor took 21.53ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.9MB in the end (delta: 873.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:49,539 INFO L158 Benchmark]: RCFGBuilder took 201.92ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 80.3MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:49,539 INFO L158 Benchmark]: TraceAbstraction took 4618.98ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 41.5MB in the end (delta: 37.9MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-01-10 01:18:49,539 INFO L158 Benchmark]: Witness Printer took 112.08ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 41.5MB in the beginning and 282.2MB in the end (delta: -240.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2025-01-10 01:18:49,542 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.26ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 125.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 129.66ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 95.3MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.36ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.53ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.9MB in the end (delta: 873.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 201.92ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 80.3MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4618.98ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 41.5MB in the end (delta: 37.9MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 112.08ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 41.5MB in the beginning and 282.2MB in the end (delta: -240.7MB). Peak memory consumption was 12.2MB. 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: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: 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: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: 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 1 procedures, 35 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 634 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 281 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 122 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=7, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 804 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 1297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 776 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 4635/5000 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 10 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((0 < x) || (x == 0)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:18:49,557 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