./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/ldv-regression/test22-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:38:11,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:38:11,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:38:11,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:38:11,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:38:11,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:38:11,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:38:11,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:38:11,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:38:11,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:38:11,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:38:11,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:38:11,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:38:11,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:38:11,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:38:11,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:38:11,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:11,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:11,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:11,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:38:11,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:38:11,719 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 ! call(reach_error())) ) 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 -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2025-01-09 02:38:12,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:38:12,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:38:12,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:38:12,032 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:38:12,033 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:38:12,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-1.c [2025-01-09 02:38:13,348 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ffe36dc2/95803959623f4679974c32a81e63e10c/FLAG2303fe479 [2025-01-09 02:38:13,609 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:38:13,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2025-01-09 02:38:13,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ffe36dc2/95803959623f4679974c32a81e63e10c/FLAG2303fe479 [2025-01-09 02:38:13,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ffe36dc2/95803959623f4679974c32a81e63e10c [2025-01-09 02:38:13,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:38:13,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:38:13,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:13,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:38:13,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:38:13,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:13" (1/1) ... [2025-01-09 02:38:13,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:13, skipping insertion in model container [2025-01-09 02:38:13,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:13" (1/1) ... [2025-01-09 02:38:13,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:38:14,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2025-01-09 02:38:14,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:14,078 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:38:14,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2025-01-09 02:38:14,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:14,112 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:38:14,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14 WrapperNode [2025-01-09 02:38:14,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:14,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:14,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:38:14,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:38:14,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,151 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2025-01-09 02:38:14,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:14,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:38:14,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:38:14,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:38:14,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,184 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 4 writes are split as follows [0, 4]. [2025-01-09 02:38:14,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:38:14,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:38:14,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:38:14,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:38:14,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (1/1) ... [2025-01-09 02:38:14,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:14,240 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-09 02:38:14,248 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-09 02:38:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:38:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:38:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:38:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:38:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:38:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2025-01-09 02:38:14,272 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2025-01-09 02:38:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:38:14,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:38:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:38:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:38:14,339 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:38:14,341 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:38:14,552 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 02:38:14,552 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:38:14,566 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:38:14,566 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:38:14,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:14 BoogieIcfgContainer [2025-01-09 02:38:14,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:38:14,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:38:14,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:38:14,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:38:14,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:38:13" (1/3) ... [2025-01-09 02:38:14,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424a263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:14, skipping insertion in model container [2025-01-09 02:38:14,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:14" (2/3) ... [2025-01-09 02:38:14,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424a263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:14, skipping insertion in model container [2025-01-09 02:38:14,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:14" (3/3) ... [2025-01-09 02:38:14,580 INFO L128 eAbstractionObserver]: Analyzing ICFG test22-1.c [2025-01-09 02:38:14,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:38:14,596 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test22-1.c that has 2 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 02:38:14,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:38:14,656 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;@6f2c4e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:38:14,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:38:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:38:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:38:14,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:14,667 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:14,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:14,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1406894689, now seen corresponding path program 1 times [2025-01-09 02:38:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498958257] [2025-01-09 02:38:14,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:38:14,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:38:14,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:14,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:14,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498958257] [2025-01-09 02:38:14,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498958257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:14,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:14,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:38:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370141594] [2025-01-09 02:38:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:38:14,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:14,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:38:14,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:38:14,950 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:14,965 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-01-09 02:38:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:38:14,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-01-09 02:38:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:14,972 INFO L225 Difference]: With dead ends: 35 [2025-01-09 02:38:14,972 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 02:38:14,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:38:14,981 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:14,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 02:38:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 02:38:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:38:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-01-09 02:38:15,016 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 25 [2025-01-09 02:38:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:15,018 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-01-09 02:38:15,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-01-09 02:38:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:38:15,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:15,020 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:15,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:38:15,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:15,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash 400796250, now seen corresponding path program 1 times [2025-01-09 02:38:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:15,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231341180] [2025-01-09 02:38:15,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:15,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:38:15,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:38:15,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:15,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:15,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231341180] [2025-01-09 02:38:15,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231341180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:15,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:15,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:38:15,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21509188] [2025-01-09 02:38:15,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:15,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:38:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:15,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:38:15,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:38:15,161 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:15,181 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-01-09 02:38:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:38:15,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-01-09 02:38:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:15,183 INFO L225 Difference]: With dead ends: 31 [2025-01-09 02:38:15,183 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 02:38:15,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:38:15,186 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:15,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 02:38:15,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 02:38:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:38:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-01-09 02:38:15,194 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 26 [2025-01-09 02:38:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:15,194 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-01-09 02:38:15,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-01-09 02:38:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:38:15,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:15,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:15,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:38:15,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:15,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1210142876, now seen corresponding path program 1 times [2025-01-09 02:38:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804051467] [2025-01-09 02:38:15,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:15,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:38:15,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:38:15,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:15,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804051467] [2025-01-09 02:38:15,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804051467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:15,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:15,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:38:15,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097073092] [2025-01-09 02:38:15,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:15,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:38:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:15,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:38:15,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:38:15,709 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:15,793 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-01-09 02:38:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:38:15,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-01-09 02:38:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:15,794 INFO L225 Difference]: With dead ends: 30 [2025-01-09 02:38:15,794 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 02:38:15,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:38:15,795 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:15,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:38:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 02:38:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-01-09 02:38:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:38:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-01-09 02:38:15,803 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 26 [2025-01-09 02:38:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:15,803 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-01-09 02:38:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-01-09 02:38:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:38:15,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:15,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:15,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:38:15,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:15,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash 582548351, now seen corresponding path program 1 times [2025-01-09 02:38:15,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:15,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930010656] [2025-01-09 02:38:15,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:15,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:15,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:38:15,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:38:15,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:15,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930010656] [2025-01-09 02:38:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930010656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005611734] [2025-01-09 02:38:16,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:16,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:16,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:16,263 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-09 02:38:16,265 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-09 02:38:16,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:38:16,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:38:16,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:16,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:16,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 02:38:16,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:16,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 02:38:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:16,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:16,762 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 02:38:16,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-01-09 02:38:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005611734] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:38:16,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:38:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-01-09 02:38:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536463067] [2025-01-09 02:38:16,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:16,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 02:38:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:16,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 02:38:16,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-01-09 02:38:16,820 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:17,028 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-01-09 02:38:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 02:38:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-01-09 02:38:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:17,029 INFO L225 Difference]: With dead ends: 39 [2025-01-09 02:38:17,029 INFO L226 Difference]: Without dead ends: 34 [2025-01-09 02:38:17,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-01-09 02:38:17,030 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:17,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 149 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:38:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-09 02:38:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-01-09 02:38:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:38:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-01-09 02:38:17,038 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2025-01-09 02:38:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:17,038 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-01-09 02:38:17,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-01-09 02:38:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:38:17,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:17,041 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:17,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:38:17,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:17,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1798448420, now seen corresponding path program 2 times [2025-01-09 02:38:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431414276] [2025-01-09 02:38:17,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:38:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:17,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 02:38:17,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:38:17,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:38:17,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:17,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:17,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431414276] [2025-01-09 02:38:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431414276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:17,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705565005] [2025-01-09 02:38:17,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:38:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:17,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:17,682 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-09 02:38:17,684 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-09 02:38:17,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 02:38:17,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:38:17,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:38:17,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:17,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 02:38:17,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:18,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 02:38:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:18,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:18,423 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 02:38:18,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-01-09 02:38:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:38:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705565005] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:38:18,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:38:18,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-01-09 02:38:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419797802] [2025-01-09 02:38:18,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:18,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 02:38:18,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:18,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 02:38:18,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-01-09 02:38:18,455 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:18,749 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2025-01-09 02:38:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 02:38:18,750 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-01-09 02:38:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:18,751 INFO L225 Difference]: With dead ends: 57 [2025-01-09 02:38:18,751 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 02:38:18,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 02:38:18,753 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:18,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:38:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 02:38:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-01-09 02:38:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:38:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-01-09 02:38:18,769 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2025-01-09 02:38:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:18,769 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-01-09 02:38:18,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:38:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-01-09 02:38:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 02:38:18,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:18,771 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:18,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:38:18,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:18,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:18,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1466788292, now seen corresponding path program 3 times [2025-01-09 02:38:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763696829] [2025-01-09 02:38:18,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:38:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:18,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-01-09 02:38:19,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 56 statements. [2025-01-09 02:38:19,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:38:19,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 28 proven. 14 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 02:38:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763696829] [2025-01-09 02:38:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763696829] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366724676] [2025-01-09 02:38:20,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:38:20,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:20,063 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-09 02:38:20,065 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-09 02:38:20,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-01-09 02:38:20,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 56 statements. [2025-01-09 02:38:20,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:38:20,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:20,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 02:38:20,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-01-09 02:38:20,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:20,941 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 02:38:20,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 30 [2025-01-09 02:38:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-01-09 02:38:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366724676] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:38:21,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:38:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 30 [2025-01-09 02:38:21,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891366946] [2025-01-09 02:38:21,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 02:38:21,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:21,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 02:38:21,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-01-09 02:38:21,074 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:38:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:21,560 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2025-01-09 02:38:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 02:38:21,560 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2025-01-09 02:38:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:21,561 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:38:21,561 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:38:21,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 02:38:21,562 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:21,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 100 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:38:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:38:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:38:21,564 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-09 02:38:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:38:21,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-01-09 02:38:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:21,564 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:38:21,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:38:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:38:21,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:38:21,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:38:21,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:38:21,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:21,770 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-01-09 02:38:21,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:38:21,907 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:38:21,914 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2025-01-09 02:38:21,915 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2025-01-09 02:38:21,915 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!base [2025-01-09 02:38:21,916 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!offset [2025-01-09 02:38:21,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2025-01-09 02:38:21,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!base [2025-01-09 02:38:21,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!base [2025-01-09 02:38:21,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 02:38:21,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 02:38:21,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pa~0!base,]]] [2025-01-09 02:38:21,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!offset [2025-01-09 02:38:21,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!offset [2025-01-09 02:38:21,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:38:21 BoogieIcfgContainer [2025-01-09 02:38:21,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:38:21,919 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:38:21,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:38:21,919 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:38:21,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:14" (3/4) ... [2025-01-09 02:38:21,923 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 02:38:21,930 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2025-01-09 02:38:21,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 02:38:21,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 02:38:21,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 02:38:21,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 02:38:22,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:38:22,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:38:22,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:38:22,006 INFO L158 Benchmark]: Toolchain (without parser) took 8079.96ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 158.5MB in the beginning and 125.2MB in the end (delta: 33.3MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2025-01-09 02:38:22,006 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:38:22,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.33ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 147.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:38:22,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.47ms. Allocated memory is still 201.3MB. Free memory was 147.2MB in the beginning and 145.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:38:22,007 INFO L158 Benchmark]: Boogie Preprocessor took 55.85ms. Allocated memory is still 201.3MB. Free memory was 145.7MB in the beginning and 144.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:38:22,007 INFO L158 Benchmark]: RCFGBuilder took 357.78ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 131.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:38:22,008 INFO L158 Benchmark]: TraceAbstraction took 7346.68ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 130.7MB in the beginning and 131.4MB in the end (delta: -662.1kB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-01-09 02:38:22,008 INFO L158 Benchmark]: Witness Printer took 86.71ms. Allocated memory is still 243.3MB. Free memory was 131.4MB in the beginning and 125.2MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:38:22,009 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.30ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.33ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 147.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.47ms. Allocated memory is still 201.3MB. Free memory was 147.2MB in the beginning and 145.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.85ms. Allocated memory is still 201.3MB. Free memory was 145.7MB in the beginning and 144.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 357.78ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 131.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7346.68ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 130.7MB in the beginning and 131.4MB in the end (delta: -662.1kB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Witness Printer took 86.71ms. Allocated memory is still 243.3MB. Free memory was 131.4MB in the beginning and 125.2MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pa~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!offset * 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: 50]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 6, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 523 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 403 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 469 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 120 mSDtfsCounter, 469 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=5, InterpolantAutomatonStates: 62, 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, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 323 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 434 ConstructedInterpolants, 0 QuantifiedInterpolants, 2691 SizeOfPredicates, 15 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 511/657 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 02:38:22,025 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