./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/copy-2-u.c --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-multidimensional/copy-2-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9e382438d8fbe8dfce0f613a239dc56836f436a035cb511dde070c4306eb1f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:21:05,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:21:05,316 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:21:05,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:21:05,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:21:05,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:21:05,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:21:05,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:21:05,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:21:05,356 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:21:05,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:21:05,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:21:05,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:21:05,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:21:05,358 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:21:05,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:21:05,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:21:05,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:21:05,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:21:05,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:21:05,360 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:21:05,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:21:05,360 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:21:05,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:05,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:05,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:05,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:05,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:21:05,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:05,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:05,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:05,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:05,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:21:05,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:21:05,362 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 -> d9e382438d8fbe8dfce0f613a239dc56836f436a035cb511dde070c4306eb1f9 [2025-01-10 01:21:05,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:21:05,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:21:05,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:21:05,673 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:21:05,673 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:21:05,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-2-u.c [2025-01-10 01:21:07,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c2f7f4bf/2cedaff22da4481eb8bdd915dbb8f36c/FLAG0a432a892 [2025-01-10 01:21:07,362 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:21:07,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-2-u.c [2025-01-10 01:21:07,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c2f7f4bf/2cedaff22da4481eb8bdd915dbb8f36c/FLAG0a432a892 [2025-01-10 01:21:07,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c2f7f4bf/2cedaff22da4481eb8bdd915dbb8f36c [2025-01-10 01:21:07,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:21:07,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:21:07,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:21:07,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:21:07,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:21:07,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329ee5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07, skipping insertion in model container [2025-01-10 01:21:07,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:21:07,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:21:07,827 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:21:07,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:21:07,861 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:21:07,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07 WrapperNode [2025-01-10 01:21:07,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:21:07,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:21:07,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:21:07,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:21:07,871 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:21:07" (1/1) ... [2025-01-10 01:21:07,877 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:21:07" (1/1) ... [2025-01-10 01:21:07,899 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2025-01-10 01:21:07,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:21:07,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:21:07,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:21:07,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:21:07,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,930 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-01-10 01:21:07,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:21:07,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:21:07,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:21:07,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:21:07,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (1/1) ... [2025-01-10 01:21:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:07,986 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:21:07,990 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:21:08,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:21:08,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:21:08,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:21:08,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:21:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:21:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:21:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:21:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:21:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:21:08,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:21:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:21:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:21:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:21:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:21:08,084 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:21:08,086 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:21:08,252 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-10 01:21:08,252 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:21:08,263 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:21:08,264 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:21:08,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:08 BoogieIcfgContainer [2025-01-10 01:21:08,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:21:08,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:21:08,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:21:08,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:21:08,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:21:07" (1/3) ... [2025-01-10 01:21:08,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be3674b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:21:08, skipping insertion in model container [2025-01-10 01:21:08,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:07" (2/3) ... [2025-01-10 01:21:08,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be3674b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:21:08, skipping insertion in model container [2025-01-10 01:21:08,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:08" (3/3) ... [2025-01-10 01:21:08,275 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-2-u.c [2025-01-10 01:21:08,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:21:08,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-2-u.c that has 1 procedures, 39 locations, 1 initial locations, 6 loop locations, and 12 error locations. [2025-01-10 01:21:08,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:21:08,363 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;@b20ae3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:21:08,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 01:21:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 38 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:21:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:21:08,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:08,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:21:08,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:21:08,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash 28695012, now seen corresponding path program 1 times [2025-01-10 01:21:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:08,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888693127] [2025-01-10 01:21:08,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:08,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:21:08,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:21:08,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:08,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:08,641 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:21:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:08,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888693127] [2025-01-10 01:21:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888693127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:21:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562297222] [2025-01-10 01:21:08,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:08,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:08,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:08,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:08,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:08,668 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 38 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:08,793 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2025-01-10 01:21:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:21:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:08,802 INFO L225 Difference]: With dead ends: 87 [2025-01-10 01:21:08,802 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 01:21:08,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:08,808 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:08,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 44 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 01:21:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-10 01:21:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-01-10 01:21:08,848 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 5 [2025-01-10 01:21:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:08,849 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-01-10 01:21:08,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-01-10 01:21:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:21:08,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:08,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:08,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:21:08,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:21:08,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash 148934474, now seen corresponding path program 1 times [2025-01-10 01:21:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710987927] [2025-01-10 01:21:08,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:08,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:21:08,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:21:08,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:08,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:21:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710987927] [2025-01-10 01:21:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710987927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:21:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864509435] [2025-01-10 01:21:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:21:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:08,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:21:08,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:21:08,952 INFO L87 Difference]: Start difference. First operand 45 states and 50 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:21:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:09,020 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2025-01-10 01:21:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:21:09,021 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:21:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:09,022 INFO L225 Difference]: With dead ends: 88 [2025-01-10 01:21:09,022 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:21:09,022 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:21:09,023 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:09,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 43 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:21:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2025-01-10 01:21:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.4375) internal successors, (92), 75 states have internal predecessors, (92), 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:21:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2025-01-10 01:21:09,035 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 8 [2025-01-10 01:21:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:09,035 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2025-01-10 01:21:09,035 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:21:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2025-01-10 01:21:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:21:09,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:09,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:09,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:21:09,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:21:09,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash 148934282, now seen corresponding path program 1 times [2025-01-10 01:21:09,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:09,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705106791] [2025-01-10 01:21:09,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:09,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:09,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:21:09,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:21:09,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:09,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:09,149 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:21:09,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:09,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705106791] [2025-01-10 01:21:09,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705106791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:09,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650191716] [2025-01-10 01:21:09,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:09,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:09,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:09,155 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:21:09,156 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:21:09,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:21:09,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:21:09,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:09,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:09,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:21:09,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:09,281 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:21:09,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650191716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:09,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 01:21:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279228475] [2025-01-10 01:21:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:09,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:09,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:21:09,284 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:21:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:09,351 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2025-01-10 01:21:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:09,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:21:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:09,353 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:21:09,353 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 01:21:09,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:21:09,354 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:09,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 41 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 01:21:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 01:21:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.34375) internal successors, (86), 72 states have internal predecessors, (86), 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:21:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2025-01-10 01:21:09,366 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 8 [2025-01-10 01:21:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:09,366 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2025-01-10 01:21:09,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:21:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2025-01-10 01:21:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:21:09,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:09,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:21:09,376 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:21:09,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:09,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:21:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash 321995490, now seen corresponding path program 1 times [2025-01-10 01:21:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035813940] [2025-01-10 01:21:09,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:09,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:09,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:21:09,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:21:09,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:09,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:09,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035813940] [2025-01-10 01:21:09,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035813940] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824597877] [2025-01-10 01:21:09,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:09,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:09,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:09,664 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:21:09,668 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:21:09,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:21:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:21:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:09,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:21:09,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:09,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:09,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824597877] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:09,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 01:21:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297742716] [2025-01-10 01:21:09,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:09,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:21:09,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:09,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:21:09,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:21:09,781 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:09,905 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2025-01-10 01:21:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:21:09,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:21:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:09,908 INFO L225 Difference]: With dead ends: 142 [2025-01-10 01:21:09,908 INFO L226 Difference]: Without dead ends: 139 [2025-01-10 01:21:09,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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:21:09,909 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:09,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 66 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-10 01:21:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-01-10 01:21:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 138 states have internal predecessors, (170), 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:21:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2025-01-10 01:21:09,926 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 9 [2025-01-10 01:21:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:09,926 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2025-01-10 01:21:09,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2025-01-10 01:21:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:21:09,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:09,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:21:09,937 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:21:10,128 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:21:10,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:21:10,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1628110544, now seen corresponding path program 1 times [2025-01-10 01:21:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827039089] [2025-01-10 01:21:10,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:10,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:21:10,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:21:10,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:10,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:21:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827039089] [2025-01-10 01:21:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827039089] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746109640] [2025-01-10 01:21:10,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:10,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:10,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:10,197 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:21:10,199 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:21:10,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:21:10,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:21:10,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:10,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:10,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:21:10,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:21:10,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:21:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746109640] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:10,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-01-10 01:21:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100062587] [2025-01-10 01:21:10,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:10,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:21:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:10,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:21:10,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:10,339 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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:21:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:10,725 INFO L93 Difference]: Finished difference Result 260 states and 316 transitions. [2025-01-10 01:21:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:21:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 01:21:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:10,727 INFO L225 Difference]: With dead ends: 260 [2025-01-10 01:21:10,727 INFO L226 Difference]: Without dead ends: 139 [2025-01-10 01:21:10,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:21:10,728 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 373 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:10,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 27 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:21:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-10 01:21:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-01-10 01:21:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 135 states have internal predecessors, (147), 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:21:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2025-01-10 01:21:10,751 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 15 [2025-01-10 01:21:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:10,751 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2025-01-10 01:21:10,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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:21:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2025-01-10 01:21:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:21:10,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:10,752 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-01-10 01:21:10,761 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:21:10,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:10,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:21:10,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash 533335816, now seen corresponding path program 2 times [2025-01-10 01:21:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763280797] [2025-01-10 01:21:10,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:10,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:10,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:21:10,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 01:21:10,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:10,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:11,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:11,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763280797] [2025-01-10 01:21:11,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763280797] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:11,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131467968] [2025-01-10 01:21:11,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:11,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:11,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:11,003 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:21:11,006 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:21:11,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:21:11,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 01:21:11,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:11,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:11,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:21:11,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:11,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131467968] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:11,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:21:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444296197] [2025-01-10 01:21:11,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:11,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:21:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:11,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:21:11,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:21:11,117 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:21:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:11,175 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2025-01-10 01:21:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:21:11,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 18 [2025-01-10 01:21:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:11,176 INFO L225 Difference]: With dead ends: 136 [2025-01-10 01:21:11,176 INFO L226 Difference]: Without dead ends: 133 [2025-01-10 01:21:11,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:21:11,177 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:11,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-10 01:21:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2025-01-10 01:21:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 116 states have internal predecessors, (125), 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:21:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2025-01-10 01:21:11,197 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 18 [2025-01-10 01:21:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:11,197 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2025-01-10 01:21:11,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:21:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2025-01-10 01:21:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:21:11,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:11,197 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:21:11,209 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:21:11,404 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,SelfDestructingSolverStorable5 [2025-01-10 01:21:11,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:21:11,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:11,405 INFO L85 PathProgramCache]: Analyzing trace with hash 401977562, now seen corresponding path program 1 times [2025-01-10 01:21:11,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:11,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301411738] [2025-01-10 01:21:11,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:11,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:11,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:21:11,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:21:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-10 01:21:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301411738] [2025-01-10 01:21:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301411738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531896880] [2025-01-10 01:21:11,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:11,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:11,538 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:21:11,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:21:11,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:21:11,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:21:11,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:11,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:21:11,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:11,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:11,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531896880] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:11,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:11,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-01-10 01:21:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590695647] [2025-01-10 01:21:11,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:11,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:21:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:11,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:21:11,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:21:11,843 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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:21:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:12,633 INFO L93 Difference]: Finished difference Result 472 states and 549 transitions. [2025-01-10 01:21:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-10 01:21:12,634 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 34 [2025-01-10 01:21:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:12,636 INFO L225 Difference]: With dead ends: 472 [2025-01-10 01:21:12,636 INFO L226 Difference]: Without dead ends: 371 [2025-01-10 01:21:12,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-01-10 01:21:12,641 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1050 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:12,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 48 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:21:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-10 01:21:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-01-10 01:21:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 368 states have (on average 1.0380434782608696) internal successors, (382), 370 states have internal predecessors, (382), 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:21:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 382 transitions. [2025-01-10 01:21:12,683 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 382 transitions. Word has length 34 [2025-01-10 01:21:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:12,683 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 382 transitions. [2025-01-10 01:21:12,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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:21:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 382 transitions. [2025-01-10 01:21:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 01:21:12,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:12,688 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 3, 3, 3, 2, 1, 1, 1] [2025-01-10 01:21:12,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:21:12,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:12,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:21:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -821708250, now seen corresponding path program 2 times [2025-01-10 01:21:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459896240] [2025-01-10 01:21:12,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:12,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:12,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-01-10 01:21:12,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 104 statements. [2025-01-10 01:21:12,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:12,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-01-10 01:21:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459896240] [2025-01-10 01:21:12,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459896240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594833942] [2025-01-10 01:21:12,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:12,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:12,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:12,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:21:12,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:21:13,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-01-10 01:21:13,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 104 statements. [2025-01-10 01:21:13,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:13,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:13,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:21:13,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-01-10 01:21:13,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-01-10 01:21:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594833942] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:13,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:21:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406014941] [2025-01-10 01:21:13,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:13,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:21:13,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:13,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:21:13,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:21:13,345 INFO L87 Difference]: Start difference. First operand 371 states and 382 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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:21:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:13,400 INFO L93 Difference]: Finished difference Result 371 states and 382 transitions. [2025-01-10 01:21:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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 104 [2025-01-10 01:21:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:13,401 INFO L225 Difference]: With dead ends: 371 [2025-01-10 01:21:13,401 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:21:13,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:21:13,404 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:13,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 13 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:21:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:21:13,406 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:21:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:21:13,407 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2025-01-10 01:21:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:13,407 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:21:13,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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:21:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:21:13,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:21:13,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 01:21:13,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 01:21:13,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 01:21:13,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 01:21:13,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 01:21:13,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 01:21:13,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 01:21:13,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 01:21:13,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 01:21:13,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 01:21:13,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 01:21:13,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 01:21:13,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:13,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 01:21:13,617 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-01-10 01:21:13,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:21:14,522 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:21:14,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:21:14 BoogieIcfgContainer [2025-01-10 01:21:14,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:21:14,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:21:14,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:21:14,538 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:21:14,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:08" (3/4) ... [2025-01-10 01:21:14,543 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:21:14,551 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 01:21:14,551 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:21:14,551 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:21:14,551 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:21:14,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:21:14,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:21:14,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:21:14,631 INFO L158 Benchmark]: Toolchain (without parser) took 6977.35ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 45.6MB in the end (delta: 59.8MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2025-01-10 01:21:14,631 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:21:14,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.87ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 94.5MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:21:14,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.62ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.6MB in the end (delta: 879.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:21:14,632 INFO L158 Benchmark]: Boogie Preprocessor took 48.22ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:21:14,632 INFO L158 Benchmark]: RCFGBuilder took 312.96ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 78.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:21:14,632 INFO L158 Benchmark]: TraceAbstraction took 6270.61ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 52.2MB in the end (delta: 26.2MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2025-01-10 01:21:14,632 INFO L158 Benchmark]: Witness Printer took 93.05ms. Allocated memory is still 142.6MB. Free memory was 52.2MB in the beginning and 45.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:21:14,634 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.51ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.87ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 94.5MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.62ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.6MB in the end (delta: 879.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.22ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 312.96ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 78.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6270.61ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 52.2MB in the end (delta: 26.2MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. * Witness Printer took 93.05ms. Allocated memory is still 142.6MB. Free memory was 52.2MB in the beginning and 45.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: 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, 39 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 30, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1648 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1648 mSDsluCounter, 318 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 666 IncrementalHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 133 mSDtfsCounter, 666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=7, InterpolantAutomatonStates: 74, 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, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 389 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 1598 SizeOfPredicates, 4 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 2580/4667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:21:14,656 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