./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.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/Fibonacci05.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 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:04:00,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:04:00,973 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:04:00,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:04:00,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:04:00,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:04:00,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:04:00,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:04:00,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:04:00,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:04:00,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:04:00,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:04:00,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:04:00,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:04:00,991 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:04:00,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:04:00,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:04:00,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:04:00,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:04:00,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:04:00,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:04:00,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:04:00,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:04:00,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:04:00,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:04:00,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:04:00,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:04:00,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:04:00,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:04:00,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:04:00,993 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 -> 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 [2025-01-09 04:04:01,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:04:01,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:04:01,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:04:01,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:04:01,217 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:04:01,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2025-01-09 04:04:02,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb4a98d65/2223fe526cfc46a5b9929156022c067e/FLAG3e94457d8 [2025-01-09 04:04:02,538 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:04:02,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2025-01-09 04:04:02,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb4a98d65/2223fe526cfc46a5b9929156022c067e/FLAG3e94457d8 [2025-01-09 04:04:02,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb4a98d65/2223fe526cfc46a5b9929156022c067e [2025-01-09 04:04:02,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:04:02,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:04:02,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:04:02,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:04:02,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:04:02,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61448821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02, skipping insertion in model container [2025-01-09 04:04:02,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:04:02,673 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/Fibonacci05.c[788,801] [2025-01-09 04:04:02,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:04:02,683 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:04:02,692 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/Fibonacci05.c[788,801] [2025-01-09 04:04:02,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:04:02,702 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:04:02,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02 WrapperNode [2025-01-09 04:04:02,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:04:02,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:04:02,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:04:02,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:04:02,709 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:04:02" (1/1) ... [2025-01-09 04:04:02,713 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:04:02" (1/1) ... [2025-01-09 04:04:02,721 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-01-09 04:04:02,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:04:02,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:04:02,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:04:02,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:04:02,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,738 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:04:02,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:04:02,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:04:02,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:04:02,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:04:02,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (1/1) ... [2025-01-09 04:04:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:04:02,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:02,769 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:04:02,774 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:04:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-01-09 04:04:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-01-09 04:04:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:04:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:04:02,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:04:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:04:02,830 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:04:02,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:04:02,918 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 04:04:02,918 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:04:02,927 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:04:02,927 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:04:02,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:02 BoogieIcfgContainer [2025-01-09 04:04:02,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:04:02,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:04:02,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:04:02,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:04:02,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:04:02" (1/3) ... [2025-01-09 04:04:02,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3e3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:04:02, skipping insertion in model container [2025-01-09 04:04:02,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:02" (2/3) ... [2025-01-09 04:04:02,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3e3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:04:02, skipping insertion in model container [2025-01-09 04:04:02,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:02" (3/3) ... [2025-01-09 04:04:02,937 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2025-01-09 04:04:02,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:04:02,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci05.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:04:02,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:04:03,001 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;@18ee36fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:04:03,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:04:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:04:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 04:04:03,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:03,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:03,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:03,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1939714822, now seen corresponding path program 1 times [2025-01-09 04:04:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:03,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140544705] [2025-01-09 04:04:03,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:03,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 04:04:03,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 04:04:03,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:03,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:03,169 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:04:03,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:03,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140544705] [2025-01-09 04:04:03,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140544705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:04:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:04:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:04:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015598097] [2025-01-09 04:04:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:04:03,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:04:03,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:03,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:04:03,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:04:03,187 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:04:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:03,278 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-01-09 04:04:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:04:03,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-01-09 04:04:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:03,288 INFO L225 Difference]: With dead ends: 31 [2025-01-09 04:04:03,288 INFO L226 Difference]: Without dead ends: 21 [2025-01-09 04:04:03,291 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:04:03,294 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:03,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-09 04:04:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-01-09 04:04:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:04:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-01-09 04:04:03,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2025-01-09 04:04:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:03,327 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-09 04:04:03,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:04:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-01-09 04:04:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 04:04:03,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:03,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:03,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:04:03,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:03,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash 692912656, now seen corresponding path program 1 times [2025-01-09 04:04:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:03,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379357950] [2025-01-09 04:04:03,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:03,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 04:04:03,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 04:04:03,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:03,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:03,381 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:04:03,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379357950] [2025-01-09 04:04:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379357950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:04:03,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:04:03,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:04:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399208230] [2025-01-09 04:04:03,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:04:03,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:04:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:03,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:04:03,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:04:03,383 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:04:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:03,420 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-01-09 04:04:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:04:03,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-01-09 04:04:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:03,421 INFO L225 Difference]: With dead ends: 25 [2025-01-09 04:04:03,421 INFO L226 Difference]: Without dead ends: 21 [2025-01-09 04:04:03,422 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:04:03,422 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:03,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:04:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-09 04:04:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-01-09 04:04:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:04:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-01-09 04:04:03,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2025-01-09 04:04:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:03,426 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-09 04:04:03,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:04:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-01-09 04:04:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 04:04:03,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:03,427 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:03,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:04:03,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash 453332055, now seen corresponding path program 1 times [2025-01-09 04:04:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:03,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375643393] [2025-01-09 04:04:03,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:03,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 04:04:03,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 04:04:03,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:03,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:04:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:03,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375643393] [2025-01-09 04:04:03,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375643393] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:03,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592901409] [2025-01-09 04:04:03,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:03,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:03,584 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:04:03,585 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:04:03,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 04:04:03,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 04:04:03,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:03,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:03,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:04:03,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:04:03,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:04:03,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592901409] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:03,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:03,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2025-01-09 04:04:03,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317040984] [2025-01-09 04:04:03,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:03,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:04:03,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:03,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:04:03,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:04:03,901 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 04:04:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:03,997 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-01-09 04:04:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:04:03,997 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2025-01-09 04:04:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:03,998 INFO L225 Difference]: With dead ends: 43 [2025-01-09 04:04:03,998 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 04:04:03,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:04:04,003 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:04,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 04:04:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 04:04:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 04:04:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-01-09 04:04:04,013 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 24 [2025-01-09 04:04:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:04,013 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-01-09 04:04:04,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 04:04:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-01-09 04:04:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:04:04,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:04,015 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:04,022 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:04:04,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:04,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:04,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1186000891, now seen corresponding path program 1 times [2025-01-09 04:04:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:04,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963558262] [2025-01-09 04:04:04,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:04,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:04:04,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:04:04,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:04,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 04:04:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963558262] [2025-01-09 04:04:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963558262] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877580097] [2025-01-09 04:04:04,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:04:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:04,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:04,358 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:04:04,364 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:04:04,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:04:04,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:04:04,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:04,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:04,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:04:04,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 04:04:04,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 04:04:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877580097] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:04,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:04,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2025-01-09 04:04:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725421965] [2025-01-09 04:04:04,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:04,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:04:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:04,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:04:04,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:04:04,981 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 04:04:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:05,099 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2025-01-09 04:04:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:04:05,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 52 [2025-01-09 04:04:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:05,101 INFO L225 Difference]: With dead ends: 45 [2025-01-09 04:04:05,101 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 04:04:05,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:04:05,102 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:05,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 69 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 04:04:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-01-09 04:04:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2025-01-09 04:04:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2025-01-09 04:04:05,109 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 52 [2025-01-09 04:04:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:05,109 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2025-01-09 04:04:05,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 04:04:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2025-01-09 04:04:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 04:04:05,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:05,112 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 15, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:05,119 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:04:05,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:05,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:05,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:05,317 INFO L85 PathProgramCache]: Analyzing trace with hash 843019629, now seen corresponding path program 2 times [2025-01-09 04:04:05,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043903614] [2025-01-09 04:04:05,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:04:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:05,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-01-09 04:04:05,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 04:04:05,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:04:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2025-01-09 04:04:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:05,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043903614] [2025-01-09 04:04:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043903614] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331223991] [2025-01-09 04:04:05,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:04:05,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:05,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:05,717 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:04:05,720 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:04:05,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-01-09 04:04:05,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 04:04:05,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:04:05,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:05,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 04:04:05,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2025-01-09 04:04:05,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 427 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-01-09 04:04:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331223991] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:06,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:06,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2025-01-09 04:04:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055785507] [2025-01-09 04:04:06,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:06,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 04:04:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:06,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 04:04:06,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:04:06,836 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-09 04:04:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:06,969 INFO L93 Difference]: Finished difference Result 55 states and 111 transitions. [2025-01-09 04:04:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:04:06,970 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) Word has length 158 [2025-01-09 04:04:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:06,972 INFO L225 Difference]: With dead ends: 55 [2025-01-09 04:04:06,973 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 04:04:06,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 309 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:04:06,976 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:06,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:04:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 04:04:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2025-01-09 04:04:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (56), 13 states have call predecessors, (56), 8 states have call successors, (56) [2025-01-09 04:04:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 95 transitions. [2025-01-09 04:04:06,988 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 95 transitions. Word has length 158 [2025-01-09 04:04:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:06,989 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 95 transitions. [2025-01-09 04:04:06,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-09 04:04:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 95 transitions. [2025-01-09 04:04:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-01-09 04:04:06,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:06,993 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 41, 29, 29, 29, 29, 29, 29, 29, 18, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:07,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:04:07,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:07,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:07,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1718675215, now seen corresponding path program 3 times [2025-01-09 04:04:07,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:07,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766460208] [2025-01-09 04:04:07,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:04:07,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:07,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 400 statements into 50 equivalence classes. [2025-01-09 04:04:07,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 62 of 400 statements. [2025-01-09 04:04:07,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 04:04:07,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 1080 proven. 43 refuted. 0 times theorem prover too weak. 8165 trivial. 0 not checked. [2025-01-09 04:04:07,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:07,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766460208] [2025-01-09 04:04:07,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766460208] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:07,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843374651] [2025-01-09 04:04:07,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:04:07,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:07,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:07,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:04:07,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:04:07,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 400 statements into 50 equivalence classes. [2025-01-09 04:04:07,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 62 of 400 statements. [2025-01-09 04:04:07,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 04:04:07,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:07,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:04:07,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 2073 proven. 13 refuted. 0 times theorem prover too weak. 7202 trivial. 0 not checked. [2025-01-09 04:04:07,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 1262 proven. 60 refuted. 0 times theorem prover too weak. 7966 trivial. 0 not checked. [2025-01-09 04:04:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843374651] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:08,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-01-09 04:04:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88481511] [2025-01-09 04:04:08,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:04:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:08,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:04:08,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:04:08,551 INFO L87 Difference]: Start difference. First operand 46 states and 95 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (14), 4 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-09 04:04:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:08,619 INFO L93 Difference]: Finished difference Result 93 states and 240 transitions. [2025-01-09 04:04:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:04:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (14), 4 states have call predecessors, (14), 7 states have call successors, (14) Word has length 400 [2025-01-09 04:04:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:08,620 INFO L225 Difference]: With dead ends: 93 [2025-01-09 04:04:08,620 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 04:04:08,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 791 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:04:08,622 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:08,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 75 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:04:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 04:04:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-01-09 04:04:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (51), 13 states have call predecessors, (51), 8 states have call successors, (51) [2025-01-09 04:04:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2025-01-09 04:04:08,629 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 400 [2025-01-09 04:04:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:08,629 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 92 transitions. [2025-01-09 04:04:08,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (14), 4 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-09 04:04:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2025-01-09 04:04:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-01-09 04:04:08,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:08,633 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 61, 35, 35, 35, 35, 35, 35, 35, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:08,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:04:08,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 04:04:08,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:08,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:08,835 INFO L85 PathProgramCache]: Analyzing trace with hash 482273333, now seen corresponding path program 4 times [2025-01-09 04:04:08,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:08,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597522167] [2025-01-09 04:04:08,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:04:08,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:08,851 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 492 statements into 2 equivalence classes. [2025-01-09 04:04:08,885 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 417 of 492 statements. [2025-01-09 04:04:08,885 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:04:08,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 1256 proven. 2490 refuted. 0 times theorem prover too weak. 10404 trivial. 0 not checked. [2025-01-09 04:04:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:09,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597522167] [2025-01-09 04:04:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597522167] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:09,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992973296] [2025-01-09 04:04:09,630 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:04:09,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:09,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:09,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:04:09,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:04:09,692 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 492 statements into 2 equivalence classes. [2025-01-09 04:04:09,756 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 417 of 492 statements. [2025-01-09 04:04:09,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:04:09,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:09,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 04:04:09,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 4694 proven. 170 refuted. 0 times theorem prover too weak. 9286 trivial. 0 not checked. [2025-01-09 04:04:09,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 506 proven. 2500 refuted. 0 times theorem prover too weak. 11144 trivial. 0 not checked. [2025-01-09 04:04:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992973296] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:11,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 15] total 27 [2025-01-09 04:04:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127900974] [2025-01-09 04:04:11,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:11,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:04:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:11,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:04:11,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:04:11,523 INFO L87 Difference]: Start difference. First operand 48 states and 92 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) [2025-01-09 04:04:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:12,143 INFO L93 Difference]: Finished difference Result 140 states and 339 transitions. [2025-01-09 04:04:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 04:04:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) Word has length 492 [2025-01-09 04:04:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:12,145 INFO L225 Difference]: With dead ends: 140 [2025-01-09 04:04:12,145 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 04:04:12,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 975 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=654, Invalid=2102, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 04:04:12,147 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 185 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:12,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 203 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:04:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 04:04:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 04:04:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 66 states have internal predecessors, (73), 17 states have call successors, (17), 14 states have call predecessors, (17), 9 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2025-01-09 04:04:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2025-01-09 04:04:12,155 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 492 [2025-01-09 04:04:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:12,155 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2025-01-09 04:04:12,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 27 states have internal predecessors, (88), 21 states have call successors, (28), 2 states have call predecessors, (28), 14 states have return successors, (39), 17 states have call predecessors, (39), 21 states have call successors, (39) [2025-01-09 04:04:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2025-01-09 04:04:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-01-09 04:04:12,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:12,162 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 78, 48, 48, 48, 48, 48, 48, 48, 30, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:12,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:04:12,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:12,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:12,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1230230680, now seen corresponding path program 5 times [2025-01-09 04:04:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:12,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454341442] [2025-01-09 04:04:12,368 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:04:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:12,381 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 665 statements into 78 equivalence classes. [2025-01-09 04:04:12,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) and asserted 463 of 665 statements. [2025-01-09 04:04:12,447 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2025-01-09 04:04:12,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3735 proven. 1741 refuted. 0 times theorem prover too weak. 20663 trivial. 0 not checked. [2025-01-09 04:04:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:04:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454341442] [2025-01-09 04:04:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454341442] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:04:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527585845] [2025-01-09 04:04:13,017 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:04:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:04:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:04:13,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:04:13,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:04:13,090 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 665 statements into 78 equivalence classes. [2025-01-09 04:04:13,209 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) and asserted 463 of 665 statements. [2025-01-09 04:04:13,209 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2025-01-09 04:04:13,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:04:13,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 04:04:13,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:04:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 11426 proven. 865 refuted. 0 times theorem prover too weak. 13848 trivial. 0 not checked. [2025-01-09 04:04:13,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:04:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3888 proven. 1940 refuted. 0 times theorem prover too weak. 20311 trivial. 0 not checked. [2025-01-09 04:04:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527585845] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:04:17,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:04:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 23] total 28 [2025-01-09 04:04:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655571587] [2025-01-09 04:04:17,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:04:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:04:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:04:17,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:04:17,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:04:17,225 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) [2025-01-09 04:04:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:04:17,618 INFO L93 Difference]: Finished difference Result 201 states and 301 transitions. [2025-01-09 04:04:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 04:04:17,619 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) Word has length 665 [2025-01-09 04:04:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:04:17,622 INFO L225 Difference]: With dead ends: 201 [2025-01-09 04:04:17,622 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 04:04:17,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1314 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 04:04:17,624 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:04:17,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 221 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:04:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 04:04:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2025-01-09 04:04:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 66 states have internal predecessors, (72), 18 states have call successors, (18), 14 states have call predecessors, (18), 9 states have return successors, (43), 16 states have call predecessors, (43), 18 states have call successors, (43) [2025-01-09 04:04:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2025-01-09 04:04:17,640 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 665 [2025-01-09 04:04:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:04:17,641 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2025-01-09 04:04:17,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (37), 14 states have call predecessors, (37), 21 states have call successors, (37) [2025-01-09 04:04:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2025-01-09 04:04:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-01-09 04:04:17,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:04:17,643 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:04:17,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 04:04:17,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 04:04:17,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:04:17,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:04:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash -45194381, now seen corresponding path program 6 times [2025-01-09 04:04:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:04:17,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990817587] [2025-01-09 04:04:17,844 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 04:04:17,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:04:17,854 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 461 statements into 54 equivalence classes. [2025-01-09 04:04:17,928 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 54 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 04:04:17,928 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 54 check-sat command(s) [2025-01-09 04:04:17,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:04:17,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 04:04:17,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 04:04:17,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 04:04:17,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:04:17,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:04:17,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 04:04:17,996 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 04:04:17,997 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:04:17,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:04:18,000 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2025-01-09 04:04:18,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:04:18,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:04:18 BoogieIcfgContainer [2025-01-09 04:04:18,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:04:18,079 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:04:18,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:04:18,079 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:04:18,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:02" (3/4) ... [2025-01-09 04:04:18,083 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 04:04:18,178 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 258. [2025-01-09 04:04:18,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:04:18,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:04:18,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:04:18,294 INFO L158 Benchmark]: Toolchain (without parser) took 15734.29ms. Allocated memory was 201.3MB in the beginning and 444.6MB in the end (delta: 243.3MB). Free memory was 157.4MB in the beginning and 263.5MB in the end (delta: -106.1MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. [2025-01-09 04:04:18,294 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:04:18,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.63ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 146.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:04:18,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.20ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.9MB in the end (delta: 845.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:04:18,294 INFO L158 Benchmark]: Boogie Preprocessor took 23.31ms. Allocated memory is still 201.3MB. Free memory was 145.9MB in the beginning and 145.0MB in the end (delta: 903.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:04:18,294 INFO L158 Benchmark]: RCFGBuilder took 182.51ms. Allocated memory is still 201.3MB. Free memory was 145.0MB in the beginning and 133.5MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:04:18,294 INFO L158 Benchmark]: TraceAbstraction took 15148.52ms. Allocated memory was 201.3MB in the beginning and 444.6MB in the end (delta: 243.3MB). Free memory was 133.5MB in the beginning and 280.3MB in the end (delta: -146.8MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2025-01-09 04:04:18,295 INFO L158 Benchmark]: Witness Printer took 214.21ms. Allocated memory is still 444.6MB. Free memory was 280.3MB in the beginning and 263.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:04:18,295 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.14ms. Allocated memory is still 218.1MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.63ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 146.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.20ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.9MB in the end (delta: 845.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.31ms. Allocated memory is still 201.3MB. Free memory was 145.9MB in the beginning and 145.0MB in the end (delta: 903.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 182.51ms. Allocated memory is still 201.3MB. Free memory was 145.0MB in the beginning and 133.5MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15148.52ms. Allocated memory was 201.3MB in the beginning and 444.6MB in the end (delta: 243.3MB). Free memory was 133.5MB in the beginning and 280.3MB in the end (delta: -146.8MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. * Witness Printer took 214.21ms. Allocated memory is still 444.6MB. Free memory was 280.3MB in the beginning and 263.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 36]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] COND FALSE !(x > 46) VAL [x=8] [L32] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L32] RET, EXPR fibonacci(x) VAL [x=8] [L32] int result = fibonacci(x); [L33] COND FALSE !(x < 8 || result >= 34) [L36] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 9, TraceHistogramMax: 97, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 813 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1249 IncrementalHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 353 mSolverCounterUnsat, 167 mSDtfsCounter, 1249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3726 GetRequests, 3536 SyntacticMatches, 29 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 4066 NumberOfCodeBlocks, 2836 NumberOfCodeBlocksAsserted, 194 NumberOfCheckSat, 5376 ConstructedInterpolants, 0 QuantifiedInterpolants, 7056 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2634 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 141878/153096 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:04:18,319 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