./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:56:28,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:56:28,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:56:28,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:56:28,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:56:28,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:56:28,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:56:28,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:56:28,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:56:28,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:56:28,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:56:28,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:56:28,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:56:28,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:56:28,861 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:56:28,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:56:28,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:56:28,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:56:28,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:56:28,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:56:28,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:56:28,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:56:28,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:56:28,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:56:28,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:56:28,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:56:28,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:56:28,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:56:28,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:56:28,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:56:28,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:56:28,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:56:28,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:56:28,864 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/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 -> 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff [2025-03-16 18:56:29,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:56:29,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:56:29,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:56:29,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:56:29,098 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:56:29,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2025-03-16 18:56:30,235 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b0554f7/c7220cea0a7a412fa644499e5ce12d24/FLAGabae9ca85 [2025-03-16 18:56:30,426 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:56:30,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2025-03-16 18:56:30,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b0554f7/c7220cea0a7a412fa644499e5ce12d24/FLAGabae9ca85 [2025-03-16 18:56:30,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b0554f7/c7220cea0a7a412fa644499e5ce12d24 [2025-03-16 18:56:30,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:56:30,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:56:30,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:56:30,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:56:30,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:56:30,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f65a6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30, skipping insertion in model container [2025-03-16 18:56:30,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:56:30,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c[1277,1290] [2025-03-16 18:56:30,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:56:30,607 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:56:30,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c[1277,1290] [2025-03-16 18:56:30,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:56:30,626 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:56:30,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30 WrapperNode [2025-03-16 18:56:30,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:56:30,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:56:30,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:56:30,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:56:30,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,648 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-03-16 18:56:30,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:56:30,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:56:30,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:56:30,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:56:30,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,666 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2025-03-16 18:56:30,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:56:30,677 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:56:30,677 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:56:30,677 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:56:30,678 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (1/1) ... [2025-03-16 18:56:30,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:56:30,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:30,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:56:30,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:56:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 18:56:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 18:56:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:56:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_19_to_19_0 [2025-03-16 18:56:30,724 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_19_to_19_0 [2025-03-16 18:56:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:56:30,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:56:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 18:56:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 18:56:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:56:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:56:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 18:56:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 18:56:30,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:56:30,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:56:30,850 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-16 18:56:30,856 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-03-16 18:56:30,857 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:56:30,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:56:30,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:56:30,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:56:30 BoogieIcfgContainer [2025-03-16 18:56:30,866 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:56:30,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:56:30,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:56:30,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:56:30,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:56:30" (1/3) ... [2025-03-16 18:56:30,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ae3df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:56:30, skipping insertion in model container [2025-03-16 18:56:30,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:30" (2/3) ... [2025-03-16 18:56:30,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ae3df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:56:30, skipping insertion in model container [2025-03-16 18:56:30,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:56:30" (3/3) ... [2025-03-16 18:56:30,874 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_1b.c [2025-03-16 18:56:30,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:56:30,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_1b.c that has 2 procedures, 15 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 18:56:30,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:56:30,930 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;@34e912c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:56:30,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:56:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 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-03-16 18:56:30,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 18:56:30,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:30,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:30,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -60796584, now seen corresponding path program 1 times [2025-03-16 18:56:30,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:30,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310164581] [2025-03-16 18:56:30,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:31,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 18:56:31,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 18:56:31,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:31,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:56:31,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310164581] [2025-03-16 18:56:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310164581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:56:31,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:56:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:56:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532747893] [2025-03-16 18:56:31,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:56:31,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:56:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:31,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:56:31,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:56:31,339 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 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 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-03-16 18:56:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:31,421 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-16 18:56:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:56:31,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2025-03-16 18:56:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:31,431 INFO L225 Difference]: With dead ends: 25 [2025-03-16 18:56:31,432 INFO L226 Difference]: Without dead ends: 13 [2025-03-16 18:56:31,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:56:31,436 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:31,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:56:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-16 18:56:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-16 18:56:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 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-03-16 18:56:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-16 18:56:31,462 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2025-03-16 18:56:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:31,462 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-16 18:56:31,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-03-16 18:56:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-16 18:56:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 18:56:31,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:31,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:31,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:56:31,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:31,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1383116127, now seen corresponding path program 1 times [2025-03-16 18:56:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:31,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896076481] [2025-03-16 18:56:31,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:31,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 18:56:31,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 18:56:31,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:31,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:56:31,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:31,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896076481] [2025-03-16 18:56:31,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896076481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:31,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369834942] [2025-03-16 18:56:31,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:31,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:31,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:31,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:56:31,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:56:31,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 18:56:31,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 18:56:31,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:31,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:31,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 18:56:31,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:56:31,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 18:56:32,018 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-16 18:56:32,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 32 [2025-03-16 18:56:32,059 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 15 treesize of output 7 [2025-03-16 18:56:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:56:32,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:56:36,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369834942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:36,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:56:36,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2025-03-16 18:56:36,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030648442] [2025-03-16 18:56:36,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:56:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 18:56:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:36,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 18:56:36,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2025-03-16 18:56:36,214 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 18:56:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:36,362 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-03-16 18:56:36,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:56:36,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 14 [2025-03-16 18:56:36,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:36,363 INFO L225 Difference]: With dead ends: 19 [2025-03-16 18:56:36,363 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 18:56:36,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=75, Invalid=304, Unknown=1, NotChecked=0, Total=380 [2025-03-16 18:56:36,364 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:36,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:56:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 18:56:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-16 18:56:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 18:56:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-16 18:56:36,369 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2025-03-16 18:56:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:36,369 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-16 18:56:36,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 18:56:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-16 18:56:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 18:56:36,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:36,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:36,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:56:36,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:36,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:36,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:36,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1506481188, now seen corresponding path program 2 times [2025-03-16 18:56:36,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:36,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550990665] [2025-03-16 18:56:36,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:56:36,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:36,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-16 18:56:36,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 18:56:36,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:56:36,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:56:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550990665] [2025-03-16 18:56:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550990665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206150098] [2025-03-16 18:56:36,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:56:36,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:36,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:36,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:56:36,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:56:36,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-16 18:56:36,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 18:56:36,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:56:36,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:36,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 18:56:36,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:56:36,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 18:56:37,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 3 [2025-03-16 18:56:37,150 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 15 treesize of output 7 [2025-03-16 18:56:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:56:37,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:56:37,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206150098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:37,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:56:37,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-03-16 18:56:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090335747] [2025-03-16 18:56:37,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:56:37,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 18:56:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:37,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 18:56:37,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-03-16 18:56:37,524 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 18:56:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:37,598 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-03-16 18:56:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:56:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 19 [2025-03-16 18:56:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:37,599 INFO L225 Difference]: With dead ends: 25 [2025-03-16 18:56:37,599 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 18:56:37,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-03-16 18:56:37,600 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:37,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:56:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 18:56:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-16 18:56:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 18:56:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-03-16 18:56:37,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 19 [2025-03-16 18:56:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:37,607 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-03-16 18:56:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 18:56:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-03-16 18:56:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 18:56:37,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:37,608 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:37,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:56:37,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 18:56:37,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:37,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1691442272, now seen corresponding path program 3 times [2025-03-16 18:56:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120367956] [2025-03-16 18:56:37,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:56:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:37,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-03-16 18:56:37,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 18:56:37,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-16 18:56:37,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:56:38,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:38,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120367956] [2025-03-16 18:56:38,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120367956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:38,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200994969] [2025-03-16 18:56:38,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:56:38,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:38,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:38,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:56:38,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:56:38,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-03-16 18:56:38,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 18:56:38,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-16 18:56:38,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:38,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-16 18:56:38,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:56:38,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 18:56:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 18:56:38,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:56:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:56:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200994969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:56:40,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:56:40,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 21] total 39 [2025-03-16 18:56:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567202927] [2025-03-16 18:56:40,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:56:40,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 18:56:40,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:40,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 18:56:40,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 18:56:40,383 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 40 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 6 states have call predecessors, (10), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2025-03-16 18:56:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:40,804 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-16 18:56:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 18:56:40,805 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 6 states have call predecessors, (10), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) Word has length 29 [2025-03-16 18:56:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:40,809 INFO L225 Difference]: With dead ends: 34 [2025-03-16 18:56:40,809 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 18:56:40,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=548, Invalid=2208, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 18:56:40,810 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:40,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 69 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:56:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 18:56:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-16 18:56:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:56:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-16 18:56:40,815 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 29 [2025-03-16 18:56:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:40,815 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-16 18:56:40,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 6 states have call predecessors, (10), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2025-03-16 18:56:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-16 18:56:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 18:56:40,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:40,816 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:40,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 18:56:41,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:41,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:41,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1825874660, now seen corresponding path program 4 times [2025-03-16 18:56:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:41,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915758643] [2025-03-16 18:56:41,021 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:56:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:41,027 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-16 18:56:41,043 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 18:56:41,043 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 18:56:41,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:56:41,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 18:56:41,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 18:56:41,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 18:56:41,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:41,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:56:41,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 18:56:41,063 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 18:56:41,064 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:56:41,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:56:41,068 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-03-16 18:56:41,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:56:41,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:56:41 BoogieIcfgContainer [2025-03-16 18:56:41,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:56:41,091 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:56:41,091 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:56:41,092 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:56:41,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:56:30" (3/4) ... [2025-03-16 18:56:41,093 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 18:56:41,134 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 23. [2025-03-16 18:56:41,179 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:56:41,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:56:41,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:56:41,183 INFO L158 Benchmark]: Toolchain (without parser) took 10702.50ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.4MB in the beginning and 222.9MB in the end (delta: -116.5MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2025-03-16 18:56:41,183 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:56:41,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.03ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 96.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:56:41,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.80ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:56:41,184 INFO L158 Benchmark]: Boogie Preprocessor took 26.91ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 94.0MB in the end (delta: 793.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:56:41,184 INFO L158 Benchmark]: IcfgBuilder took 188.34ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 83.3MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:56:41,184 INFO L158 Benchmark]: TraceAbstraction took 10222.56ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 82.5MB in the beginning and 228.3MB in the end (delta: -145.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:56:41,185 INFO L158 Benchmark]: Witness Printer took 90.78ms. Allocated memory is still 285.2MB. Free memory was 228.3MB in the beginning and 222.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:56:41,186 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.22ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.03ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 96.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.80ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.91ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 94.0MB in the end (delta: 793.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 188.34ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 83.3MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10222.56ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 82.5MB in the beginning and 228.3MB in the end (delta: -145.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 90.78ms. Allocated memory is still 285.2MB. Free memory was 228.3MB in the beginning and 222.9MB in the end (delta: 5.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: 48]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] int a = 6; [L41] int a = 6; [L43] a = 0 [L44] CALL func_to_recursive_line_19_to_19_0(&a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND FALSE !((*a) < 6) [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L44] RET func_to_recursive_line_19_to_19_0(&a) VAL [a={7:0}] [L46] EXPR \read(a) [L46] COND TRUE a == 6 [L48] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 19 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 255 IncrementalHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 34 mSDtfsCounter, 255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=4, InterpolantAutomatonStates: 43, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 154 ConstructedInterpolants, 3 QuantifiedInterpolants, 1781 SizeOfPredicates, 20 NumberOfNonLiveVariables, 310 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 50/172 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-03-16 18:56:41,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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