./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-2.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/recursive-simple/id_i15_o15-2.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 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:07:34,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:07:34,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:07:34,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:07:34,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:07:34,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:07:34,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:07:34,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:07:34,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:07:34,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:07:34,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:07:34,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:07:34,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:07:34,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:07:34,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:07:34,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:07:34,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:07:34,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:07:34,587 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 -> 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 [2025-01-09 04:07:34,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:07:34,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:07:34,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:07:34,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:07:34,863 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:07:34,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2025-01-09 04:07:36,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/571c24b2c/3ddf3898fdc04a68a967fac143662ce1/FLAG68a2aa534 [2025-01-09 04:07:36,199 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:07:36,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2025-01-09 04:07:36,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/571c24b2c/3ddf3898fdc04a68a967fac143662ce1/FLAG68a2aa534 [2025-01-09 04:07:36,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/571c24b2c/3ddf3898fdc04a68a967fac143662ce1 [2025-01-09 04:07:36,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:07:36,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:07:36,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:07:36,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:07:36,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:07:36,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0d975f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36, skipping insertion in model container [2025-01-09 04:07:36,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:07:36,710 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/recursive-simple/id_i15_o15-2.c[454,467] [2025-01-09 04:07:36,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:07:36,721 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:07:36,731 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/recursive-simple/id_i15_o15-2.c[454,467] [2025-01-09 04:07:36,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:07:36,743 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:07:36,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36 WrapperNode [2025-01-09 04:07:36,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:07:36,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:07:36,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:07:36,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:07:36,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,765 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-01-09 04:07:36,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:07:36,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:07:36,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:07:36,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:07:36,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,783 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:07:36,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:07:36,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:07:36,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:07:36,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:07:36,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (1/1) ... [2025-01-09 04:07:36,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:07:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:07:36,822 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 04:07:36,826 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 04:07:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:07:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:07:36,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:07:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:07:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-01-09 04:07:36,850 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-01-09 04:07:36,895 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:07:36,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:07:36,975 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-01-09 04:07:36,975 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:07:36,982 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:07:36,983 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:07:36,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:07:36 BoogieIcfgContainer [2025-01-09 04:07:36,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:07:36,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:07:36,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:07:36,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:07:36,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:07:36" (1/3) ... [2025-01-09 04:07:36,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db960a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:07:36, skipping insertion in model container [2025-01-09 04:07:36,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:36" (2/3) ... [2025-01-09 04:07:36,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db960a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:07:36, skipping insertion in model container [2025-01-09 04:07:36,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:07:36" (3/3) ... [2025-01-09 04:07:36,994 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2025-01-09 04:07:37,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:07:37,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i15_o15-2.c that has 2 procedures, 16 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:07:37,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:07:37,057 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;@444f6ab7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:07:37,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:07:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:07:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 04:07:37,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:07:37,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:07:37,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:07:37,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:07:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2025-01-09 04:07:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:07:37,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960663009] [2025-01-09 04:07:37,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:07:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:07:37,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 04:07:37,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 04:07:37,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:07:37,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:07:37,266 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-09 04:07:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:07:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960663009] [2025-01-09 04:07:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960663009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:07:37,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:07:37,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:07:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982456262] [2025-01-09 04:07:37,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:07:37,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:07:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:07:37,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:07:37,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:07:37,284 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:07:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:07:37,318 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-01-09 04:07:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:07:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-01-09 04:07:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:07:37,323 INFO L225 Difference]: With dead ends: 25 [2025-01-09 04:07:37,323 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 04:07:37,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:07:37,327 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:07:37,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:07:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 04:07:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 04:07:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:07:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-01-09 04:07:37,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2025-01-09 04:07:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:07:37,358 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-01-09 04:07:37,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:07:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-01-09 04:07:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 04:07:37,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:07:37,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:07:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:07:37,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:07:37,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:07:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2025-01-09 04:07:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:07:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585213746] [2025-01-09 04:07:37,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:07:37,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:07:37,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 04:07:37,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 04:07:37,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:07:37,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:07:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:07:37,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:07:37,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585213746] [2025-01-09 04:07:37,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585213746] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:07:37,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052950899] [2025-01-09 04:07:37,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:07:37,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:07:37,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:07:37,522 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 04:07:37,524 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 04:07:37,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 04:07:37,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 04:07:37,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:07:37,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:07:37,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:07:37,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:07:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:07:37,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:07:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:07:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052950899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:07:37,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:07:37,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2025-01-09 04:07:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455775243] [2025-01-09 04:07:37,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:07:37,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:07:37,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:07:37,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:07:37,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:07:37,828 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:07:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:07:37,919 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-01-09 04:07:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:07:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 16 [2025-01-09 04:07:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:07:37,920 INFO L225 Difference]: With dead ends: 34 [2025-01-09 04:07:37,920 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 04:07:37,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:07:37,921 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:07:37,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 60 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:07:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 04:07:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-01-09 04:07:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 04:07:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-01-09 04:07:37,929 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2025-01-09 04:07:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:07:37,929 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-09 04:07:37,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:07:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-01-09 04:07:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 04:07:37,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:07:37,930 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:07:37,936 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-09 04:07:38,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:07:38,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:07:38,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:07:38,135 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 2 times [2025-01-09 04:07:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:07:38,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140677364] [2025-01-09 04:07:38,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:07:38,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:07:38,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 04:07:38,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:07:38,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:07:38,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:07:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:07:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:07:38,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140677364] [2025-01-09 04:07:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140677364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:07:38,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425847194] [2025-01-09 04:07:38,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:07:38,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:07:38,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:07:38,350 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 04:07:38,351 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 04:07:38,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 04:07:38,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:07:38,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:07:38,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:07:38,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 04:07:38,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:07:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 04:07:38,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:07:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:07:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425847194] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:07:39,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:07:39,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 22 [2025-01-09 04:07:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129487943] [2025-01-09 04:07:39,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:07:39,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:07:39,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:07:39,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:07:39,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:07:39,163 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 22 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-09 04:07:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:07:39,301 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-01-09 04:07:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:07:39,303 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 22 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 34 [2025-01-09 04:07:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:07:39,303 INFO L225 Difference]: With dead ends: 49 [2025-01-09 04:07:39,303 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 04:07:39,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:07:39,305 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:07:39,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 74 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:07:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 04:07:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-01-09 04:07:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:07:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-01-09 04:07:39,312 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2025-01-09 04:07:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:07:39,312 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-01-09 04:07:39,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 22 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-09 04:07:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-01-09 04:07:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:07:39,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:07:39,316 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:07:39,324 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-09 04:07:39,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:07:39,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:07:39,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:07:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 3 times [2025-01-09 04:07:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:07:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305751463] [2025-01-09 04:07:39,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:07:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:07:39,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 8 equivalence classes. [2025-01-09 04:07:39,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:07:39,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 04:07:39,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:07:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 15 proven. 103 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 04:07:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:07:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305751463] [2025-01-09 04:07:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305751463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:07:39,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716203301] [2025-01-09 04:07:39,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:07:39,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:07:39,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:07:39,790 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 04:07:39,792 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 04:07:39,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 8 equivalence classes. [2025-01-09 04:07:39,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:07:39,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 04:07:39,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:07:39,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 04:07:39,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:07:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-09 04:07:40,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:07:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-09 04:07:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716203301] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:07:41,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:07:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 49 [2025-01-09 04:07:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468463776] [2025-01-09 04:07:41,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:07:41,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-09 04:07:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:07:41,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-09 04:07:41,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2017, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 04:07:41,658 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 33 states have internal predecessors, (68), 6 states have call successors, (7), 1 states have call predecessors, (7), 23 states have return successors, (24), 24 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 04:07:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:07:42,557 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2025-01-09 04:07:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-09 04:07:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 33 states have internal predecessors, (68), 6 states have call successors, (7), 1 states have call predecessors, (7), 23 states have return successors, (24), 24 states have call predecessors, (24), 6 states have call successors, (24) Word has length 52 [2025-01-09 04:07:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:07:42,558 INFO L225 Difference]: With dead ends: 93 [2025-01-09 04:07:42,558 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 04:07:42,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2539 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1475, Invalid=7837, Unknown=0, NotChecked=0, Total=9312 [2025-01-09 04:07:42,562 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 214 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:07:42,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 115 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:07:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 04:07:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2025-01-09 04:07:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 16 states have return successors, (17), 16 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:07:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2025-01-09 04:07:42,569 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 52 [2025-01-09 04:07:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:07:42,569 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2025-01-09 04:07:42,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 33 states have internal predecessors, (68), 6 states have call successors, (7), 1 states have call predecessors, (7), 23 states have return successors, (24), 24 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 04:07:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2025-01-09 04:07:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:07:42,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:07:42,572 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:07:42,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:07:42,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:07:42,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:07:42,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:07:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 4 times [2025-01-09 04:07:42,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:07:42,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575058448] [2025-01-09 04:07:42,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:07:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:07:42,781 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-01-09 04:07:42,795 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:07:42,795 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 04:07:42,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:07:42,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 04:07:42,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:07:42,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:07:42,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:07:42,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:07:42,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 04:07:42,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 04:07:42,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:07:42,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:07:42,841 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-01-09 04:07:42,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:07:42,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:07:42 BoogieIcfgContainer [2025-01-09 04:07:42,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:07:42,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:07:42,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:07:42,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:07:42,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:07:36" (3/4) ... [2025-01-09 04:07:42,872 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 04:07:42,916 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 50. [2025-01-09 04:07:42,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:07:42,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:07:42,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:07:42,980 INFO L158 Benchmark]: Toolchain (without parser) took 6394.49ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 104.2MB in the end (delta: 9.4MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-01-09 04:07:42,980 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:07:42,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.71ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 103.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:07:42,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.03ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 102.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:07:42,980 INFO L158 Benchmark]: Boogie Preprocessor took 25.03ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:07:42,981 INFO L158 Benchmark]: RCFGBuilder took 192.31ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 91.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:07:42,981 INFO L158 Benchmark]: TraceAbstraction took 5884.54ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 91.4MB in the beginning and 111.6MB in the end (delta: -20.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-01-09 04:07:42,981 INFO L158 Benchmark]: Witness Printer took 108.32ms. Allocated memory is still 176.2MB. Free memory was 111.6MB in the beginning and 104.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:07:42,982 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.18ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.71ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 103.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.03ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 102.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.03ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 192.31ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 91.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5884.54ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 91.4MB in the beginning and 111.6MB in the end (delta: -20.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 108.32ms. Allocated memory is still 176.2MB. Free memory was 111.6MB in the beginning and 104.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 15; VAL [input=15] [L13] CALL, EXPR id(input) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=15] [L13] int result = id(input); [L14] COND TRUE result == 15 VAL [input=15] [L15] reach_error() VAL [input=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 305 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 42 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 153 SyntacticMatches, 8 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2858 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 796 SizeOfPredicates, 5 NumberOfNonLiveVariables, 297 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 262/630 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-09 04:07:43,001 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE